./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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_append_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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:29:56,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:29:56,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:29:56,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:29:56,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:29:56,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:29:56,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:29:56,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:29:56,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:29:56,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:29:56,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:29:56,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:29:56,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:29:56,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:29:56,456 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:29:56,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:29:56,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:29:56,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:29:56,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:29:56,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:29:56,463 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:29:56,463 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:29:56,463 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:29:56,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:29:56,464 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:29:56,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:29:56,464 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:29:56,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:29:56,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:29:56,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:29:56,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:29:56,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:29:56,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:29:56,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:29:56,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:29:56,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:29:56,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:29:56,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:29:56,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:29:56,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:29:56,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:29:56,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:29:56,469 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2024-11-10 15:29:56,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:29:56,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:29:56,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:29:56,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:29:56,732 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:29:56,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-10 15:29:58,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:29:58,393 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:29:58,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-10 15:29:58,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b610e267/870d6572addd47e8827da94b3b01a3a7/FLAG6ec11afaf [2024-11-10 15:29:58,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b610e267/870d6572addd47e8827da94b3b01a3a7 [2024-11-10 15:29:58,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:29:58,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:29:58,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:29:58,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:29:58,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:29:58,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:58,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2c142d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58, skipping insertion in model container [2024-11-10 15:29:58,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:58,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:29:58,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:29:58,807 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:29:58,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:29:58,912 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:29:58,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58 WrapperNode [2024-11-10 15:29:58,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:29:58,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:29:58,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:29:58,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:29:58,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:58,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:58,971 INFO L138 Inliner]: procedures = 127, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 122 [2024-11-10 15:29:58,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:29:58,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:29:58,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:29:58,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:29:58,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:58,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:58,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:59,008 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 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-10 15:29:59,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:59,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:59,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:59,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:59,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:59,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:59,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:29:59,024 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:29:59,024 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:29:59,024 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:29:59,025 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (1/1) ... [2024-11-10 15:29:59,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:29:59,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:59,060 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-10 15:29:59,062 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-10 15:29:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:29:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:29:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 15:29:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:29:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:29:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 15:29:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-10 15:29:59,109 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-10 15:29:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:29:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:29:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:29:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:29:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:29:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 15:29:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:29:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:29:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 15:29:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:29:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:29:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:29:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 15:29:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:29:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:29:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 15:29:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:29:59,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:29:59,267 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:29:59,269 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:29:59,500 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: 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-10 15:29:59,527 INFO L1247 $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-10 15:29:59,561 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2024-11-10 15:29:59,562 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:29:59,576 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:29:59,577 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:29:59,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:29:59 BoogieIcfgContainer [2024-11-10 15:29:59,578 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:29:59,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:29:59,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:29:59,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:29:59,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:29:58" (1/3) ... [2024-11-10 15:29:59,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cf3d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:29:59, skipping insertion in model container [2024-11-10 15:29:59,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:58" (2/3) ... [2024-11-10 15:29:59,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cf3d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:29:59, skipping insertion in model container [2024-11-10 15:29:59,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:29:59" (3/3) ... [2024-11-10 15:29:59,588 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2024-11-10 15:29:59,603 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:29:59,603 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2024-11-10 15:29:59,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:29:59,644 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;@1034c2f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:29:59,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-11-10 15:29:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 58 states have (on average 1.793103448275862) internal successors, (104), 91 states have internal predecessors, (104), 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-10 15:29:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:29:59,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:59,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:59,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:29:59,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:59,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1212752565, now seen corresponding path program 1 times [2024-11-10 15:29:59,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:59,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389237117] [2024-11-10 15:29:59,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:59,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:59,899 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-10 15:29:59,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:59,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389237117] [2024-11-10 15:29:59,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389237117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:29:59,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:29:59,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:29:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396582498] [2024-11-10 15:29:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:29:59,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:29:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:59,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:29:59,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:29:59,927 INFO L87 Difference]: Start difference. First operand has 95 states, 58 states have (on average 1.793103448275862) internal successors, (104), 91 states have internal predecessors, (104), 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-10 15:30:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:00,024 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2024-11-10 15:30:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:30:00,026 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-10 15:30:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:00,044 INFO L225 Difference]: With dead ends: 92 [2024-11-10 15:30:00,044 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 15:30:00,046 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-10 15:30:00,049 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:00,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 150 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:30:00,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 15:30:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-10 15:30:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.6666666666666667) internal successors, (90), 84 states have internal predecessors, (90), 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-10 15:30:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2024-11-10 15:30:00,122 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 8 [2024-11-10 15:30:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:00,123 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2024-11-10 15:30:00,124 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-10 15:30:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2024-11-10 15:30:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:30:00,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:00,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:00,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:30:00,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:00,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:00,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1212752566, now seen corresponding path program 1 times [2024-11-10 15:30:00,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:00,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107013244] [2024-11-10 15:30:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:00,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:00,316 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-10 15:30:00,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:00,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107013244] [2024-11-10 15:30:00,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107013244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:00,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:00,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:30:00,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241116199] [2024-11-10 15:30:00,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:00,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:30:00,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:00,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:30:00,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:30:00,322 INFO L87 Difference]: Start difference. First operand 88 states and 94 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-10 15:30:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:00,403 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2024-11-10 15:30:00,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:30:00,405 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-10 15:30:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:00,406 INFO L225 Difference]: With dead ends: 86 [2024-11-10 15:30:00,406 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 15:30:00,407 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-10 15:30:00,408 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:00,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 149 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:30:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 15:30:00,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 15:30:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 82 states have internal predecessors, (88), 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-10 15:30:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2024-11-10 15:30:00,419 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 8 [2024-11-10 15:30:00,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:00,419 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2024-11-10 15:30:00,419 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-10 15:30:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2024-11-10 15:30:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:30:00,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:00,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:00,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:30:00,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:00,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1461722603, now seen corresponding path program 1 times [2024-11-10 15:30:00,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:00,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980433872] [2024-11-10 15:30:00,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:00,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:00,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:00,649 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-10 15:30:00,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:00,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980433872] [2024-11-10 15:30:00,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980433872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:00,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:00,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:30:00,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984970910] [2024-11-10 15:30:00,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:00,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:30:00,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:00,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:30:00,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:30:00,656 INFO L87 Difference]: Start difference. First operand 86 states and 92 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-10 15:30:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:00,856 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2024-11-10 15:30:00,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:30:00,857 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-10 15:30:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:00,858 INFO L225 Difference]: With dead ends: 85 [2024-11-10 15:30:00,859 INFO L226 Difference]: Without dead ends: 85 [2024-11-10 15:30:00,860 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-10 15:30:00,861 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:00,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 321 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:30:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-10 15:30:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-10 15:30:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 81 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-10 15:30:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-10 15:30:00,874 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 14 [2024-11-10 15:30:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:00,876 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-10 15:30:00,876 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-10 15:30:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-10 15:30:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:30:00,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:00,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:00,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:30:00,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:00,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:00,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1461722602, now seen corresponding path program 1 times [2024-11-10 15:30:00,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:00,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911939951] [2024-11-10 15:30:00,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:00,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:01,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:01,138 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-10 15:30:01,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:01,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911939951] [2024-11-10 15:30:01,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911939951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:01,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:01,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:30:01,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939328303] [2024-11-10 15:30:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:01,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:30:01,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:01,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:30:01,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:30:01,142 INFO L87 Difference]: Start difference. First operand 85 states and 91 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-10 15:30:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:01,305 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-10 15:30:01,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:30:01,306 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-10 15:30:01,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:01,307 INFO L225 Difference]: With dead ends: 84 [2024-11-10 15:30:01,307 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 15:30:01,307 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-10 15:30:01,308 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:01,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 341 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:30:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 15:30:01,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 15:30:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 80 states have internal predecessors, (86), 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-10 15:30:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-11-10 15:30:01,318 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 14 [2024-11-10 15:30:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:01,318 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-11-10 15:30:01,318 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-10 15:30:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-11-10 15:30:01,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:30:01,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:01,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:30:01,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:30:01,319 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:01,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash 505211506, now seen corresponding path program 1 times [2024-11-10 15:30:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:01,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435535652] [2024-11-10 15:30:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:01,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:01,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:30:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:01,503 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-10 15:30:01,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:01,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435535652] [2024-11-10 15:30:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435535652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:01,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:01,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:30:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042769602] [2024-11-10 15:30:01,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:01,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:30:01,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:01,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:30:01,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:30:01,508 INFO L87 Difference]: Start difference. First operand 84 states and 90 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-10 15:30:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:01,586 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-11-10 15:30:01,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:30:01,587 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-10 15:30:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:01,588 INFO L225 Difference]: With dead ends: 90 [2024-11-10 15:30:01,588 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 15:30:01,588 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-10 15:30:01,589 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 3 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:01,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 213 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:30:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 15:30:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-11-10 15:30:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 82 states have internal predecessors, (88), 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-10 15:30:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2024-11-10 15:30:01,599 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 16 [2024-11-10 15:30:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:01,599 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2024-11-10 15:30:01,599 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-10 15:30:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2024-11-10 15:30:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:30:01,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:01,600 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-10 15:30:01,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:30:01,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:01,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash 812346935, now seen corresponding path program 1 times [2024-11-10 15:30:01,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:01,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950907583] [2024-11-10 15:30:01,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:01,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:01,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:01,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 15:30:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:01,750 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-10 15:30:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:01,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950907583] [2024-11-10 15:30:01,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950907583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:01,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866894671] [2024-11-10 15:30:01,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:01,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:01,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:01,754 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-10 15:30:01,756 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-10 15:30:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:01,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:30:01,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:01,968 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-10 15:30:01,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:02,029 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-10 15:30:02,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866894671] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:30:02,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:30:02,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-10 15:30:02,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008589608] [2024-11-10 15:30:02,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:02,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:30:02,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:02,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:30:02,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:30:02,031 INFO L87 Difference]: Start difference. First operand 86 states and 92 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-10 15:30:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:02,125 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2024-11-10 15:30:02,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:30:02,125 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-10 15:30:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:02,126 INFO L225 Difference]: With dead ends: 92 [2024-11-10 15:30:02,126 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 15:30:02,127 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-10 15:30:02,127 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 3 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:02,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 293 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:30:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 15:30:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-10 15:30:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 87 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:30:02,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2024-11-10 15:30:02,140 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 29 [2024-11-10 15:30:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:02,141 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2024-11-10 15:30:02,141 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-10 15:30:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-10 15:30:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:30:02,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:02,143 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-10 15:30:02,159 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-10 15:30:02,344 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-10 15:30:02,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:02,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash 448131730, now seen corresponding path program 2 times [2024-11-10 15:30:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742589504] [2024-11-10 15:30:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:02,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:02,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:02,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:03,012 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-10 15:30:03,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:03,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742589504] [2024-11-10 15:30:03,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742589504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:03,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597497618] [2024-11-10 15:30:03,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:30:03,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:03,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:03,015 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-10 15:30:03,018 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-10 15:30:03,178 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:30:03,178 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:30:03,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 15:30:03,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:03,222 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-10 15:30:03,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:30:03,278 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-10 15:30:03,347 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:30:03,347 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-10 15:30:03,389 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-10 15:30:03,408 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-10 15:30:03,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:03,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:30:03,515 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-10 15:30:03,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:03,578 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-10 15:30:03,582 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-10 15:30:03,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:03,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597497618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:03,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:30:03,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2024-11-10 15:30:03,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013310055] [2024-11-10 15:30:03,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:03,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:30:03,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:03,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:30:03,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=124, Unknown=2, NotChecked=46, Total=210 [2024-11-10 15:30:03,664 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:30:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:03,995 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2024-11-10 15:30:03,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:30:03,995 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2024-11-10 15:30:03,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:03,996 INFO L225 Difference]: With dead ends: 101 [2024-11-10 15:30:03,996 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 15:30:03,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=190, Unknown=2, NotChecked=58, Total=306 [2024-11-10 15:30:03,999 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:03,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 312 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 315 Invalid, 0 Unknown, 188 Unchecked, 0.2s Time] [2024-11-10 15:30:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 15:30:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2024-11-10 15:30:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 82 states have internal predecessors, (88), 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-10 15:30:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2024-11-10 15:30:04,008 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 42 [2024-11-10 15:30:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:04,009 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2024-11-10 15:30:04,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:30:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-11-10 15:30:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:30:04,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:04,013 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-10 15:30:04,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:30:04,213 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-10 15:30:04,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:04,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:04,214 INFO L85 PathProgramCache]: Analyzing trace with hash 448131731, now seen corresponding path program 1 times [2024-11-10 15:30:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:04,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340724109] [2024-11-10 15:30:04,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:04,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:04,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:04,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 15:30:04,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:04,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340724109] [2024-11-10 15:30:04,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340724109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:04,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527925481] [2024-11-10 15:30:04,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:04,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:04,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:04,828 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-10 15:30:04,829 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-10 15:30:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:04,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 15:30:04,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:05,001 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-10 15:30:05,022 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-10 15:30:05,042 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-10 15:30:05,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:05,094 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-10 15:30:05,137 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-10 15:30:05,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:05,185 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-10 15:30:05,241 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-10 15:30:05,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:05,286 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-10 15:30:05,292 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-10 15:30:05,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:30:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527925481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:05,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:30:05,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-10 15:30:05,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054940864] [2024-11-10 15:30:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:05,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:30:05,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:30:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2024-11-10 15:30:05,294 INFO L87 Difference]: Start difference. First operand 87 states and 94 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-10 15:30:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:05,401 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2024-11-10 15:30:05,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:30:05,402 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-10 15:30:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:05,402 INFO L225 Difference]: With dead ends: 84 [2024-11-10 15:30:05,402 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 15:30:05,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2024-11-10 15:30:05,403 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:05,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 252 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 106 Unchecked, 0.1s Time] [2024-11-10 15:30:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 15:30:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 15:30:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 79 states have internal predecessors, (85), 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-10 15:30:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2024-11-10 15:30:05,411 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 42 [2024-11-10 15:30:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:05,411 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2024-11-10 15:30:05,411 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-10 15:30:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-10 15:30:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:30:05,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:05,415 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] [2024-11-10 15:30:05,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 15:30:05,616 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-10 15:30:05,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:05,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash 310666573, now seen corresponding path program 1 times [2024-11-10 15:30:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:05,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846227793] [2024-11-10 15:30:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:05,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:05,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:05,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:05,937 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:30:05,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:05,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846227793] [2024-11-10 15:30:05,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846227793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:05,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947588993] [2024-11-10 15:30:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:05,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:05,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:05,940 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-10 15:30:05,941 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-10 15:30:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:06,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 15:30:06,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:06,121 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-10 15:30:06,158 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-10 15:30:06,178 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-10 15:30:06,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:06,219 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-10 15:30:06,260 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-10 15:30:06,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:06,307 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-10 15:30:06,359 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-10 15:30:06,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:06,407 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-10 15:30:06,445 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-10 15:30:06,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:30:06,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947588993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:06,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:30:06,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-10 15:30:06,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669624722] [2024-11-10 15:30:06,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:06,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:30:06,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:06,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:30:06,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=156, Unknown=1, NotChecked=24, Total=210 [2024-11-10 15:30:06,447 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:30:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:06,507 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2024-11-10 15:30:06,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:30:06,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-10 15:30:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:06,510 INFO L225 Difference]: With dead ends: 82 [2024-11-10 15:30:06,510 INFO L226 Difference]: Without dead ends: 82 [2024-11-10 15:30:06,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=156, Unknown=1, NotChecked=24, Total=210 [2024-11-10 15:30:06,511 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:06,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 162 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 96 Unchecked, 0.1s Time] [2024-11-10 15:30:06,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-10 15:30:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-10 15:30:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.360655737704918) internal successors, (83), 77 states have internal predecessors, (83), 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-10 15:30:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-11-10 15:30:06,520 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 46 [2024-11-10 15:30:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:06,520 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-11-10 15:30:06,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:30:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-11-10 15:30:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 15:30:06,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:06,522 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-10 15:30:06,541 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-10 15:30:06,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:06,727 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:06,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:06,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1059815292, now seen corresponding path program 1 times [2024-11-10 15:30:06,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:06,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576453885] [2024-11-10 15:30:06,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:06,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:06,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:07,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:07,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:30:07,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:07,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576453885] [2024-11-10 15:30:07,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576453885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715111423] [2024-11-10 15:30:07,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:07,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:07,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:07,121 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-10 15:30:07,122 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-10 15:30:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:07,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 15:30:07,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:07,387 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-10 15:30:07,513 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-10 15:30:07,534 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-10 15:30:07,561 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-10 15:30:07,561 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 18 [2024-11-10 15:30:07,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:30:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2024-11-10 15:30:07,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:07,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-10 15:30:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:30:07,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715111423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:30:07,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:30:07,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 22 [2024-11-10 15:30:07,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204260613] [2024-11-10 15:30:07,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:07,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 15:30:07,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:07,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 15:30:07,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=405, Unknown=1, NotChecked=40, Total=506 [2024-11-10 15:30:07,793 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 19 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-10 15:30:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:08,314 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-11-10 15:30:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:30:08,314 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 19 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 47 [2024-11-10 15:30:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:08,315 INFO L225 Difference]: With dead ends: 82 [2024-11-10 15:30:08,316 INFO L226 Difference]: Without dead ends: 82 [2024-11-10 15:30:08,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=717, Unknown=1, NotChecked=54, Total=870 [2024-11-10 15:30:08,317 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 51 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:08,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 669 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 647 Invalid, 0 Unknown, 81 Unchecked, 0.4s Time] [2024-11-10 15:30:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-10 15:30:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-10 15:30:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 77 states have internal predecessors, (84), 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-10 15:30:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-11-10 15:30:08,324 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 47 [2024-11-10 15:30:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:08,324 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-11-10 15:30:08,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 19 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-10 15:30:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-11-10 15:30:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 15:30:08,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:08,328 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-10 15:30:08,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 15:30:08,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 15:30:08,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:08,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1059815293, now seen corresponding path program 1 times [2024-11-10 15:30:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:08,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987580535] [2024-11-10 15:30:08,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:08,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:09,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:09,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:09,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:30:09,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:09,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987580535] [2024-11-10 15:30:09,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987580535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:09,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249670672] [2024-11-10 15:30:09,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:09,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:09,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:09,184 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-10 15:30:09,185 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-10 15:30:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:09,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-10 15:30:09,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:09,552 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-10 15:30:09,862 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-10 15:30:09,865 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-10 15:30:09,914 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2024-11-10 15:30:09,970 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:30:09,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:30:09,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:30:10,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:30:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2024-11-10 15:30:10,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:10,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249670672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:10,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:30:10,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 32 [2024-11-10 15:30:10,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622845261] [2024-11-10 15:30:10,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:10,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-10 15:30:10,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:10,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-10 15:30:10,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1149, Unknown=1, NotChecked=68, Total=1332 [2024-11-10 15:30:10,239 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 33 states, 30 states have (on average 2.533333333333333) internal successors, (76), 28 states have internal predecessors, (76), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:30:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:10,885 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2024-11-10 15:30:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:30:10,885 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.533333333333333) internal successors, (76), 28 states have internal predecessors, (76), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2024-11-10 15:30:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:10,886 INFO L225 Difference]: With dead ends: 92 [2024-11-10 15:30:10,886 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 15:30:10,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=1810, Unknown=1, NotChecked=86, Total=2070 [2024-11-10 15:30:10,888 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:10,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 961 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 761 Invalid, 0 Unknown, 88 Unchecked, 0.4s Time] [2024-11-10 15:30:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 15:30:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-10 15:30:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 86 states have internal predecessors, (93), 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-10 15:30:10,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2024-11-10 15:30:10,899 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 47 [2024-11-10 15:30:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:10,902 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2024-11-10 15:30:10,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.533333333333333) internal successors, (76), 28 states have internal predecessors, (76), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:30:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-10 15:30:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:30:10,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:10,903 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] [2024-11-10 15:30:10,924 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-10 15:30:11,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:11,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:11,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:11,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1006424858, now seen corresponding path program 1 times [2024-11-10 15:30:11,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:11,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641229573] [2024-11-10 15:30:11,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:11,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,373 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-10 15:30:11,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:11,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641229573] [2024-11-10 15:30:11,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641229573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:11,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:11,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:30:11,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070788027] [2024-11-10 15:30:11,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:11,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:30:11,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:11,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:30:11,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:30:11,376 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:11,585 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2024-11-10 15:30:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:30:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2024-11-10 15:30:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:11,587 INFO L225 Difference]: With dead ends: 112 [2024-11-10 15:30:11,587 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 15:30:11,587 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-10 15:30:11,587 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:11,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 398 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:30:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 15:30:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2024-11-10 15:30:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 91 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:30:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2024-11-10 15:30:11,597 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 50 [2024-11-10 15:30:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:11,597 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2024-11-10 15:30:11,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:30:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2024-11-10 15:30:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:30:11,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:11,598 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] [2024-11-10 15:30:11,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:30:11,601 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:11,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1006424857, now seen corresponding path program 1 times [2024-11-10 15:30:11,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:11,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846102640] [2024-11-10 15:30:11,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:11,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:30:11,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846102640] [2024-11-10 15:30:11,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846102640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769433313] [2024-11-10 15:30:11,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:11,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:11,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:11,883 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-10 15:30:11,885 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-10 15:30:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:12,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 15:30:12,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:12,306 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:30:12,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:30:12,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:30:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:30:12,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:12,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:30:12,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-10 15:30:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:30:12,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769433313] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:30:12,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:30:12,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2024-11-10 15:30:12,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075954167] [2024-11-10 15:30:12,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:12,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 15:30:12,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:12,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 15:30:12,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-10 15:30:12,574 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 20 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-10 15:30:16,586 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-10 15:30:20,615 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-10 15:30:24,632 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-10 15:30:28,662 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-10 15:30:32,717 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-10 15:30:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:32,992 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2024-11-10 15:30:32,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:30:32,993 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 20 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 50 [2024-11-10 15:30:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:32,994 INFO L225 Difference]: With dead ends: 90 [2024-11-10 15:30:32,994 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 15:30:32,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2024-11-10 15:30:32,995 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 99 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:32,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1014 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 407 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2024-11-10 15:30:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 15:30:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 15:30:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.267605633802817) internal successors, (90), 84 states have internal predecessors, (90), 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-10 15:30:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2024-11-10 15:30:33,004 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 50 [2024-11-10 15:30:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:33,004 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2024-11-10 15:30:33,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 20 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-10 15:30:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2024-11-10 15:30:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:30:33,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:33,006 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] [2024-11-10 15:30:33,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 15:30:33,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:33,207 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:33,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:33,208 INFO L85 PathProgramCache]: Analyzing trace with hash 285827176, now seen corresponding path program 1 times [2024-11-10 15:30:33,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:33,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854249985] [2024-11-10 15:30:33,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:33,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:33,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:33,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:34,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:34,295 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:30:34,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:34,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854249985] [2024-11-10 15:30:34,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854249985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:34,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896495229] [2024-11-10 15:30:34,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:34,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:34,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:34,297 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-10 15:30:34,299 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-10 15:30:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:34,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-10 15:30:34,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:34,543 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-10 15:30:34,798 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:30:34,799 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-10 15:30:34,888 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-10 15:30:35,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 13 treesize of output 5 [2024-11-10 15:30:35,093 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 15:30:35,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:30:35,259 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2024-11-10 15:30:35,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:35,286 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 22 treesize of output 17 [2024-11-10 15:30:35,310 INFO L349 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2024-11-10 15:30:35,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2024-11-10 15:30:35,471 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 50 treesize of output 30 [2024-11-10 15:30:35,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:30:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-10 15:30:35,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:35,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896495229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:35,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:30:35,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2024-11-10 15:30:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920035514] [2024-11-10 15:30:35,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:35,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-10 15:30:35,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:35,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-10 15:30:35,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2197, Unknown=1, NotChecked=94, Total=2450 [2024-11-10 15:30:35,975 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 46 states, 43 states have (on average 2.046511627906977) internal successors, (88), 39 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:30:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:37,369 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2024-11-10 15:30:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 15:30:37,370 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.046511627906977) internal successors, (88), 39 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2024-11-10 15:30:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:37,371 INFO L225 Difference]: With dead ends: 99 [2024-11-10 15:30:37,371 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 15:30:37,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=306, Invalid=4119, Unknown=1, NotChecked=130, Total=4556 [2024-11-10 15:30:37,373 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:37,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1251 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1461 Invalid, 0 Unknown, 107 Unchecked, 0.8s Time] [2024-11-10 15:30:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 15:30:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-11-10 15:30:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 87 states have internal predecessors, (94), 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-10 15:30:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2024-11-10 15:30:37,378 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 52 [2024-11-10 15:30:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:37,378 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2024-11-10 15:30:37,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.046511627906977) internal successors, (88), 39 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:30:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-11-10 15:30:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:30:37,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:37,381 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] [2024-11-10 15:30:37,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 15:30:37,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-10 15:30:37,585 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:37,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash 285827177, now seen corresponding path program 1 times [2024-11-10 15:30:37,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:37,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861545626] [2024-11-10 15:30:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:37,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:38,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:38,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:38,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:30:39,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:39,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861545626] [2024-11-10 15:30:39,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861545626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:39,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030830652] [2024-11-10 15:30:39,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:39,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:39,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:39,276 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-10 15:30:39,277 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-10 15:30:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:39,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-10 15:30:39,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:39,522 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-10 15:30:39,524 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-10 15:30:39,901 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:30:39,902 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-10 15:30:39,923 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:30:39,923 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-10 15:30:40,019 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-10 15:30:40,022 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-10 15:30:40,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-10 15:30:40,273 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-10 15:30:40,277 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-10 15:30:40,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-10 15:30:40,537 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) is different from true [2024-11-10 15:30:40,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:40,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2024-11-10 15:30:40,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:40,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-10 15:30:40,600 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-10 15:30:40,600 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-10 15:30:40,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-10 15:30:40,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2024-11-10 15:30:40,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 25 treesize of output 13 [2024-11-10 15:30:40,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:30:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-10 15:30:40,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:41,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030830652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:41,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:30:41,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2024-11-10 15:30:41,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955191685] [2024-11-10 15:30:41,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:41,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-10 15:30:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:41,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-10 15:30:41,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2601, Unknown=1, NotChecked=102, Total=2862 [2024-11-10 15:30:41,343 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 48 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 41 states have internal predecessors, (88), 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-10 15:30:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:43,137 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2024-11-10 15:30:43,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 15:30:43,137 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 41 states have internal predecessors, (88), 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 52 [2024-11-10 15:30:43,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:43,138 INFO L225 Difference]: With dead ends: 99 [2024-11-10 15:30:43,138 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 15:30:43,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=336, Invalid=4923, Unknown=1, NotChecked=142, Total=5402 [2024-11-10 15:30:43,140 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 64 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:43,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1343 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1615 Invalid, 0 Unknown, 104 Unchecked, 0.9s Time] [2024-11-10 15:30:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 15:30:43,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-10 15:30:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.263157894736842) internal successors, (96), 89 states have internal predecessors, (96), 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-10 15:30:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-10 15:30:43,143 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 52 [2024-11-10 15:30:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:43,143 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-10 15:30:43,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 41 states have internal predecessors, (88), 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-10 15:30:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-10 15:30:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 15:30:43,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:43,145 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] [2024-11-10 15:30:43,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 15:30:43,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 15:30:43,346 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:43,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:43,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1945745343, now seen corresponding path program 1 times [2024-11-10 15:30:43,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:43,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785418917] [2024-11-10 15:30:43,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:43,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:43,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:43,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:43,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:43,567 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-10 15:30:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:43,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785418917] [2024-11-10 15:30:43,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785418917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:30:43,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:30:43,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:30:43,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265412266] [2024-11-10 15:30:43,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:30:43,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:30:43,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:43,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:30:43,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:30:43,569 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-10 15:30:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:43,725 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-11-10 15:30:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:30:43,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 56 [2024-11-10 15:30:43,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:43,727 INFO L225 Difference]: With dead ends: 99 [2024-11-10 15:30:43,727 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 15:30:43,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:30:43,728 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 38 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:43,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 403 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:30:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 15:30:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-10 15:30:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:30:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-11-10 15:30:43,733 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 56 [2024-11-10 15:30:43,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:43,733 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-11-10 15:30:43,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-10 15:30:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-10 15:30:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 15:30:43,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:43,733 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] [2024-11-10 15:30:43,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:30:43,734 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:43,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:43,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1945745342, now seen corresponding path program 1 times [2024-11-10 15:30:43,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:43,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698125083] [2024-11-10 15:30:43,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:43,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:44,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:44,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:44,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:30:44,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:44,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698125083] [2024-11-10 15:30:44,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698125083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:44,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738704121] [2024-11-10 15:30:44,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:44,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:44,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:44,168 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:44,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:30:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:44,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-10 15:30:44,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:44,387 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-10 15:30:44,408 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-10 15:30:44,617 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-10 15:30:44,621 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-10 15:30:44,652 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_18| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_18|) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-10 15:30:44,688 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:30:44,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:30:44,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:30:44,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:30:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2024-11-10 15:30:44,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:44,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738704121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:44,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:30:44,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2024-11-10 15:30:44,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200597215] [2024-11-10 15:30:44,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:44,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 15:30:44,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:44,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 15:30:44,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=689, Unknown=1, NotChecked=52, Total=812 [2024-11-10 15:30:44,946 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 25 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 21 states have internal predecessors, (71), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:30:45,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:45,464 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2024-11-10 15:30:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 15:30:45,464 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 21 states have internal predecessors, (71), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 56 [2024-11-10 15:30:45,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:45,465 INFO L225 Difference]: With dead ends: 101 [2024-11-10 15:30:45,465 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 15:30:45,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=1351, Unknown=1, NotChecked=74, Total=1560 [2024-11-10 15:30:45,466 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 82 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:45,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 791 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 777 Invalid, 0 Unknown, 91 Unchecked, 0.3s Time] [2024-11-10 15:30:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 15:30:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-10 15:30:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 94 states have internal predecessors, (102), 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-10 15:30:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2024-11-10 15:30:45,469 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 56 [2024-11-10 15:30:45,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:45,469 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2024-11-10 15:30:45,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 21 states have internal predecessors, (71), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:30:45,470 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2024-11-10 15:30:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 15:30:45,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:45,470 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 15:30:45,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-10 15:30:45,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 15:30:45,671 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:45,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1316015364, now seen corresponding path program 2 times [2024-11-10 15:30:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:45,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984687791] [2024-11-10 15:30:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:47,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:47,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:30:47,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:47,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984687791] [2024-11-10 15:30:47,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984687791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:47,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756196742] [2024-11-10 15:30:47,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:30:47,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:47,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:47,783 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:47,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:30:47,965 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:30:47,965 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:30:47,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-10 15:30:47,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:48,103 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-10 15:30:48,106 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-10 15:30:48,406 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:30:48,406 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-10 15:30:48,413 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 16 treesize of output 11 [2024-11-10 15:30:48,418 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 16 treesize of output 11 [2024-11-10 15:30:48,552 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 33 treesize of output 17 [2024-11-10 15:30:48,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-11-10 15:30:48,834 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-10 15:30:48,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 27 [2024-11-10 15:30:48,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-10 15:30:48,844 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-10 15:30:48,869 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-10 15:30:48,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:48,893 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-10 15:30:48,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 75 [2024-11-10 15:30:48,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:48,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:30:48,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-10 15:30:48,913 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-10 15:30:48,913 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 34 treesize of output 36 [2024-11-10 15:30:48,990 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 89 treesize of output 65 [2024-11-10 15:30:48,992 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 69 treesize of output 49 [2024-11-10 15:30:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-10 15:30:49,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:49,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756196742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:49,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:30:49,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 53 [2024-11-10 15:30:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398623020] [2024-11-10 15:30:49,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:49,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-10 15:30:49,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:49,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-10 15:30:49,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3130, Unknown=1, NotChecked=112, Total=3422 [2024-11-10 15:30:49,845 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 53 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 47 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:30:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:51,139 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2024-11-10 15:30:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 15:30:51,139 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 47 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 57 [2024-11-10 15:30:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:51,141 INFO L225 Difference]: With dead ends: 127 [2024-11-10 15:30:51,141 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 15:30:51,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=274, Invalid=4985, Unknown=1, NotChecked=142, Total=5402 [2024-11-10 15:30:51,143 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 17 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:51,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1531 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1233 Invalid, 0 Unknown, 113 Unchecked, 0.7s Time] [2024-11-10 15:30:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 15:30:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2024-11-10 15:30:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.2277227722772277) internal successors, (124), 114 states have internal predecessors, (124), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:30:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2024-11-10 15:30:51,147 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 57 [2024-11-10 15:30:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:51,148 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2024-11-10 15:30:51,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 47 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:30:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2024-11-10 15:30:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 15:30:51,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:51,149 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, 1, 1] [2024-11-10 15:30:51,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-10 15:30:51,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 15:30:51,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:30:51,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:30:51,350 INFO L85 PathProgramCache]: Analyzing trace with hash -822156621, now seen corresponding path program 1 times [2024-11-10 15:30:51,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:30:51,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061536245] [2024-11-10 15:30:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:51,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:30:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:30:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:51,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:30:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:51,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:30:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:30:51,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:30:51,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061536245] [2024-11-10 15:30:51,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061536245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:30:51,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457223466] [2024-11-10 15:30:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:30:51,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:30:51,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:30:51,546 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:30:51,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 15:30:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:30:51,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 15:30:51,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:30:51,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-10 15:30:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:30:51,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:30:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:30:51,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457223466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:30:51,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:30:51,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 13 [2024-11-10 15:30:51,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259890780] [2024-11-10 15:30:51,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:51,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:30:51,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:51,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:30:51,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:30:51,884 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:30:55,893 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-10 15:30:59,904 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-10 15:31:03,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:31:07,927 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-10 15:31:11,960 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-10 15:31:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:12,087 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2024-11-10 15:31:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:31:12,087 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2024-11-10 15:31:12,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:12,088 INFO L225 Difference]: With dead ends: 122 [2024-11-10 15:31:12,088 INFO L226 Difference]: Without dead ends: 122 [2024-11-10 15:31:12,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:31:12,089 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 84 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:12,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 598 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 291 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2024-11-10 15:31:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-10 15:31:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-10 15:31:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.2178217821782178) internal successors, (123), 114 states have internal predecessors, (123), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:31:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2024-11-10 15:31:12,093 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 59 [2024-11-10 15:31:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:12,093 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2024-11-10 15:31:12,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:31:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2024-11-10 15:31:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 15:31:12,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:12,093 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, 1, 1, 1, 1, 1] [2024-11-10 15:31:12,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-10 15:31:12,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:12,294 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:31:12,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:12,295 INFO L85 PathProgramCache]: Analyzing trace with hash 925337568, now seen corresponding path program 1 times [2024-11-10 15:31:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:12,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965373730] [2024-11-10 15:31:12,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:12,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:31:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:12,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:31:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:13,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:31:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:31:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:13,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965373730] [2024-11-10 15:31:13,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965373730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:13,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70150671] [2024-11-10 15:31:13,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:13,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:13,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:13,234 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:13,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 15:31:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:13,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-10 15:31:13,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:13,617 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-10 15:31:13,714 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-10 15:31:13,715 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-10 15:31:13,962 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 13 [2024-11-10 15:31:13,965 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-10 15:31:14,085 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_11| Int)) (<= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_11|) 0) 0))) is different from true [2024-11-10 15:31:14,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:31:14,111 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 30 treesize of output 25 [2024-11-10 15:31:14,117 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:31:14,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:31:14,387 INFO L349 Elim1Store]: treesize reduction 41, result has 41.4 percent of original size [2024-11-10 15:31:14,387 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 49 treesize of output 43 [2024-11-10 15:31:14,468 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-10 15:31:14,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:14,475 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 39 treesize of output 31 [2024-11-10 15:31:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-11-10 15:31:14,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:15,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70150671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:15,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:31:15,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2024-11-10 15:31:15,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607686262] [2024-11-10 15:31:15,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:15,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 15:31:15,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:15,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 15:31:15,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2112, Unknown=1, NotChecked=92, Total=2352 [2024-11-10 15:31:15,116 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 42 states, 40 states have (on average 2.4) internal successors, (96), 38 states have internal predecessors, (96), 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-10 15:31:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:16,511 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2024-11-10 15:31:16,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 15:31:16,512 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 2.4) internal successors, (96), 38 states have internal predecessors, (96), 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 62 [2024-11-10 15:31:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:16,512 INFO L225 Difference]: With dead ends: 148 [2024-11-10 15:31:16,512 INFO L226 Difference]: Without dead ends: 148 [2024-11-10 15:31:16,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=309, Invalid=4524, Unknown=1, NotChecked=136, Total=4970 [2024-11-10 15:31:16,514 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 77 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:16,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1443 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1173 Invalid, 0 Unknown, 115 Unchecked, 0.6s Time] [2024-11-10 15:31:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-10 15:31:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 133. [2024-11-10 15:31:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 125 states have internal predecessors, (134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:31:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2024-11-10 15:31:16,518 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 62 [2024-11-10 15:31:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:16,519 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2024-11-10 15:31:16,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 2.4) internal successors, (96), 38 states have internal predecessors, (96), 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-10 15:31:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2024-11-10 15:31:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 15:31:16,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:16,520 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, 1, 1, 1, 1, 1] [2024-11-10 15:31:16,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-10 15:31:16,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-10 15:31:16,720 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:31:16,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash 925435876, now seen corresponding path program 1 times [2024-11-10 15:31:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:16,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971002494] [2024-11-10 15:31:16,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:17,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 15:31:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:17,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:31:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:17,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 15:31:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:31:17,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:17,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971002494] [2024-11-10 15:31:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971002494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:17,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291851836] [2024-11-10 15:31:17,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:17,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:17,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:17,607 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:17,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-10 15:31:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:17,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-10 15:31:17,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:17,928 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:31:17,928 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-10 15:31:17,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:31:18,093 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 5 [2024-11-10 15:31:18,101 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 15:31:18,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:31:18,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:31:18,245 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 28 treesize of output 23 [2024-11-10 15:31:18,267 INFO L349 Elim1Store]: treesize reduction 116, result has 32.2 percent of original size [2024-11-10 15:31:18,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 69 [2024-11-10 15:31:18,545 INFO L349 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2024-11-10 15:31:18,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2024-11-10 15:31:18,762 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 157 treesize of output 121 [2024-11-10 15:31:18,768 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 120 treesize of output 96 [2024-11-10 15:31:19,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:19,053 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 102 treesize of output 60 [2024-11-10 15:31:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:19,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:19,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291851836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:19,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:31:19,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 46 [2024-11-10 15:31:19,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183158743] [2024-11-10 15:31:19,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:19,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-10 15:31:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:19,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-10 15:31:19,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2806, Unknown=0, NotChecked=0, Total=2970 [2024-11-10 15:31:19,934 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 47 states, 44 states have (on average 2.227272727272727) internal successors, (98), 40 states have internal predecessors, (98), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:31:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:21,771 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2024-11-10 15:31:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-10 15:31:21,772 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 2.227272727272727) internal successors, (98), 40 states have internal predecessors, (98), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 62 [2024-11-10 15:31:21,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:21,772 INFO L225 Difference]: With dead ends: 141 [2024-11-10 15:31:21,772 INFO L226 Difference]: Without dead ends: 141 [2024-11-10 15:31:21,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=426, Invalid=6380, Unknown=0, NotChecked=0, Total=6806 [2024-11-10 15:31:21,774 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 148 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:21,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1283 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:31:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-10 15:31:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-11-10 15:31:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 129 states have internal predecessors, (141), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:31:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2024-11-10 15:31:21,778 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 62 [2024-11-10 15:31:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:21,778 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2024-11-10 15:31:21,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 2.227272727272727) internal successors, (98), 40 states have internal predecessors, (98), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:31:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2024-11-10 15:31:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 15:31:21,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:21,779 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, 1, 1, 1, 1, 1] [2024-11-10 15:31:21,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-10 15:31:21,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:21,982 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-10 15:31:21,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:21,983 INFO L85 PathProgramCache]: Analyzing trace with hash 925435877, now seen corresponding path program 1 times [2024-11-10 15:31:21,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:21,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907085132] [2024-11-10 15:31:21,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:21,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat