./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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/heap-manipulation/sll_to_dll_rev-2.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 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:34:50,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:34:50,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:34:50,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:34:50,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:34:50,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:34:50,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:34:50,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:34:50,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:34:50,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:34:50,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:34:50,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:34:50,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:34:50,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:34:50,274 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:34:50,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:34:50,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:34:50,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:34:50,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:34:50,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:34:50,275 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:34:50,280 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:34:50,280 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:34:50,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:34:50,281 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:34:50,281 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:34:50,281 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:34:50,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:34:50,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:34:50,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:34:50,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:34:50,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:34:50,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:34:50,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:34:50,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:34:50,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:34:50,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:34:50,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:34:50,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:34:50,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:34:50,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:34:50,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:34:50,286 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 -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2024-11-12 13:34:50,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:34:50,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:34:50,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:34:50,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:34:50,533 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:34:50,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-11-12 13:34:51,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:34:52,132 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:34:52,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-11-12 13:34:52,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746c35d94/d2b0bd05d08e4b4a98b2b7ce23cc0c46/FLAGa96cffcae [2024-11-12 13:34:52,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746c35d94/d2b0bd05d08e4b4a98b2b7ce23cc0c46 [2024-11-12 13:34:52,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:34:52,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:34:52,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:34:52,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:34:52,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:34:52,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8b81a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52, skipping insertion in model container [2024-11-12 13:34:52,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:34:52,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:34:52,686 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:34:52,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:34:52,785 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:34:52,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52 WrapperNode [2024-11-12 13:34:52,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:34:52,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:34:52,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:34:52,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:34:52,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,834 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2024-11-12 13:34:52,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:34:52,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:34:52,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:34:52,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:34:52,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,899 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 8, 6, 8, 18]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1, 0, 0]. The 10 writes are split as follows [0, 1, 1, 1, 7]. [2024-11-12 13:34:52,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:34:52,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:34:52,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:34:52,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:34:52,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (1/1) ... [2024-11-12 13:34:52,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:34:52,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:34:52,967 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-12 13:34:52,971 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-12 13:34:53,018 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-12 13:34:53,018 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-12 13:34:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:34:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:34:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 13:34:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:34:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:34:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 13:34:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-12 13:34:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-12 13:34:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:34:53,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:34:53,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 13:34:53,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-12 13:34:53,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-12 13:34:53,022 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-11-12 13:34:53,022 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-11-12 13:34:53,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:34:53,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:34:53,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:34:53,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 13:34:53,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-12 13:34:53,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-12 13:34:53,024 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-11-12 13:34:53,024 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-11-12 13:34:53,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:34:53,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:34:53,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 13:34:53,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 13:34:53,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 13:34:53,025 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-11-12 13:34:53,026 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-11-12 13:34:53,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:34:53,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:34:53,207 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:34:53,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:34:53,787 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2024-11-12 13:34:53,787 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:34:53,803 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:34:53,803 INFO L316 CfgBuilder]: Removed 33 assume(true) statements. [2024-11-12 13:34:53,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:34:53 BoogieIcfgContainer [2024-11-12 13:34:53,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:34:53,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:34:53,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:34:53,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:34:53,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:34:52" (1/3) ... [2024-11-12 13:34:53,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103f6be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:34:53, skipping insertion in model container [2024-11-12 13:34:53,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:34:52" (2/3) ... [2024-11-12 13:34:53,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103f6be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:34:53, skipping insertion in model container [2024-11-12 13:34:53,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:34:53" (3/3) ... [2024-11-12 13:34:53,813 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2024-11-12 13:34:53,830 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:34:53,831 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2024-11-12 13:34:53,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:34:53,897 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;@1181f12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:34:53,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2024-11-12 13:34:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 123 states have (on average 2.073170731707317) internal successors, (255), 211 states have internal predecessors, (255), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 13:34:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 13:34:53,910 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:53,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 13:34:53,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:34:53,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash 6467046, now seen corresponding path program 1 times [2024-11-12 13:34:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:53,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444410320] [2024-11-12 13:34:53,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:53,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:54,113 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-12 13:34:54,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:54,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444410320] [2024-11-12 13:34:54,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444410320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:34:54,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:34:54,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:34:54,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594739924] [2024-11-12 13:34:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:34:54,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:34:54,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:54,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:34:54,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:34:54,163 INFO L87 Difference]: Start difference. First operand has 225 states, 123 states have (on average 2.073170731707317) internal successors, (255), 211 states have internal predecessors, (255), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:34:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:54,201 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2024-11-12 13:34:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:34:54,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-12 13:34:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:54,214 INFO L225 Difference]: With dead ends: 222 [2024-11-12 13:34:54,214 INFO L226 Difference]: Without dead ends: 220 [2024-11-12 13:34:54,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:34:54,220 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:54,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:34:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-12 13:34:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-11-12 13:34:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 117 states have (on average 1.8376068376068375) internal successors, (215), 206 states have internal predecessors, (215), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:34:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 241 transitions. [2024-11-12 13:34:54,278 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 241 transitions. Word has length 4 [2024-11-12 13:34:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:54,278 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 241 transitions. [2024-11-12 13:34:54,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:34:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 241 transitions. [2024-11-12 13:34:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:34:54,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:54,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:34:54,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:34:54,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:34:54,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:54,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1928521722, now seen corresponding path program 1 times [2024-11-12 13:34:54,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:54,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685021537] [2024-11-12 13:34:54,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:54,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:54,434 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-12 13:34:54,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:54,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685021537] [2024-11-12 13:34:54,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685021537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:34:54,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:34:54,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:34:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747224468] [2024-11-12 13:34:54,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:34:54,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:34:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:54,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:34:54,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:34:54,438 INFO L87 Difference]: Start difference. First operand 220 states and 241 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:34:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:54,621 INFO L93 Difference]: Finished difference Result 218 states and 239 transitions. [2024-11-12 13:34:54,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:34:54,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:34:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:54,624 INFO L225 Difference]: With dead ends: 218 [2024-11-12 13:34:54,624 INFO L226 Difference]: Without dead ends: 218 [2024-11-12 13:34:54,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:34:54,629 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:54,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 383 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:34:54,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-12 13:34:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-12 13:34:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 117 states have (on average 1.8205128205128205) internal successors, (213), 204 states have internal predecessors, (213), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:34:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 239 transitions. [2024-11-12 13:34:54,648 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 239 transitions. Word has length 6 [2024-11-12 13:34:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:54,649 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 239 transitions. [2024-11-12 13:34:54,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:34:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 239 transitions. [2024-11-12 13:34:54,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:34:54,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:54,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:34:54,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:34:54,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:34:54,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:54,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1928521723, now seen corresponding path program 1 times [2024-11-12 13:34:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:54,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614688903] [2024-11-12 13:34:54,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:54,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:54,798 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-12 13:34:54,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:54,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614688903] [2024-11-12 13:34:54,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614688903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:34:54,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:34:54,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:34:54,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228031539] [2024-11-12 13:34:54,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:34:54,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:34:54,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:54,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:34:54,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:34:54,801 INFO L87 Difference]: Start difference. First operand 218 states and 239 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:34:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:54,937 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2024-11-12 13:34:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:34:54,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:34:54,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:54,938 INFO L225 Difference]: With dead ends: 216 [2024-11-12 13:34:54,938 INFO L226 Difference]: Without dead ends: 216 [2024-11-12 13:34:54,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:34:54,940 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 2 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:54,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 388 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:34:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-12 13:34:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-11-12 13:34:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 117 states have (on average 1.8034188034188035) internal successors, (211), 202 states have internal predecessors, (211), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:34:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 237 transitions. [2024-11-12 13:34:54,955 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 237 transitions. Word has length 6 [2024-11-12 13:34:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:54,956 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 237 transitions. [2024-11-12 13:34:54,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:34:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 237 transitions. [2024-11-12 13:34:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:34:54,956 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:54,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:54,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:34:54,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:34:54,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1860239838, now seen corresponding path program 1 times [2024-11-12 13:34:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:54,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822014376] [2024-11-12 13:34:54,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:55,214 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-12 13:34:55,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:55,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822014376] [2024-11-12 13:34:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822014376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:34:55,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:34:55,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:34:55,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886590501] [2024-11-12 13:34:55,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:34:55,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:34:55,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:55,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:34:55,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:34:55,218 INFO L87 Difference]: Start difference. First operand 216 states and 237 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-12 13:34:55,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:55,506 INFO L93 Difference]: Finished difference Result 211 states and 232 transitions. [2024-11-12 13:34:55,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:34:55,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 10 [2024-11-12 13:34:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:55,508 INFO L225 Difference]: With dead ends: 211 [2024-11-12 13:34:55,508 INFO L226 Difference]: Without dead ends: 211 [2024-11-12 13:34:55,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:34:55,509 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 40 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:55,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 747 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:34:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-12 13:34:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-12 13:34:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 117 states have (on average 1.7606837606837606) internal successors, (206), 197 states have internal predecessors, (206), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:34:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 232 transitions. [2024-11-12 13:34:55,529 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 232 transitions. Word has length 10 [2024-11-12 13:34:55,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:55,530 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 232 transitions. [2024-11-12 13:34:55,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-12 13:34:55,530 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 232 transitions. [2024-11-12 13:34:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:34:55,531 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:55,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:55,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:34:55,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:34:55,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1860239839, now seen corresponding path program 1 times [2024-11-12 13:34:55,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:55,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093694380] [2024-11-12 13:34:55,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:55,784 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-12 13:34:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093694380] [2024-11-12 13:34:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093694380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:34:55,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:34:55,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:34:55,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653747368] [2024-11-12 13:34:55,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:34:55,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:34:55,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:55,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:34:55,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:34:55,787 INFO L87 Difference]: Start difference. First operand 211 states and 232 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-12 13:34:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:56,062 INFO L93 Difference]: Finished difference Result 206 states and 227 transitions. [2024-11-12 13:34:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:34:56,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2024-11-12 13:34:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:56,063 INFO L225 Difference]: With dead ends: 206 [2024-11-12 13:34:56,064 INFO L226 Difference]: Without dead ends: 206 [2024-11-12 13:34:56,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:34:56,065 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 36 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:56,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 550 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:34:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-12 13:34:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-12 13:34:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 117 states have (on average 1.7179487179487178) internal successors, (201), 192 states have internal predecessors, (201), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:34:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2024-11-12 13:34:56,085 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 10 [2024-11-12 13:34:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:56,085 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2024-11-12 13:34:56,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-12 13:34:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2024-11-12 13:34:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:34:56,085 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:56,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:56,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:34:56,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:34:56,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1832860119, now seen corresponding path program 1 times [2024-11-12 13:34:56,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:56,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152897821] [2024-11-12 13:34:56,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:56,158 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-12 13:34:56,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152897821] [2024-11-12 13:34:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152897821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:34:56,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:34:56,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:34:56,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676046631] [2024-11-12 13:34:56,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:34:56,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:34:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:56,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:34:56,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:34:56,162 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-12 13:34:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:56,340 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2024-11-12 13:34:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:34:56,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2024-11-12 13:34:56,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:56,342 INFO L225 Difference]: With dead ends: 205 [2024-11-12 13:34:56,342 INFO L226 Difference]: Without dead ends: 205 [2024-11-12 13:34:56,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:34:56,343 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 3 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:56,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 648 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:34:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-12 13:34:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-12 13:34:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 117 states have (on average 1.7094017094017093) internal successors, (200), 191 states have internal predecessors, (200), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:34:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 226 transitions. [2024-11-12 13:34:56,355 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 226 transitions. Word has length 11 [2024-11-12 13:34:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:56,356 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 226 transitions. [2024-11-12 13:34:56,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-12 13:34:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 226 transitions. [2024-11-12 13:34:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:34:56,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:56,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:56,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:34:56,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:34:56,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1832860120, now seen corresponding path program 1 times [2024-11-12 13:34:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:56,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656532892] [2024-11-12 13:34:56,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:56,486 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-12 13:34:56,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:56,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656532892] [2024-11-12 13:34:56,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656532892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:34:56,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:34:56,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:34:56,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504720512] [2024-11-12 13:34:56,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:34:56,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:34:56,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:56,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:34:56,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:34:56,489 INFO L87 Difference]: Start difference. First operand 205 states and 226 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-12 13:34:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:56,635 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2024-11-12 13:34:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:34:56,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 11 [2024-11-12 13:34:56,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:56,637 INFO L225 Difference]: With dead ends: 204 [2024-11-12 13:34:56,637 INFO L226 Difference]: Without dead ends: 204 [2024-11-12 13:34:56,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:34:56,639 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 4 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:56,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 730 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:34:56,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-12 13:34:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-12 13:34:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 117 states have (on average 1.7008547008547008) internal successors, (199), 190 states have internal predecessors, (199), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:34:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2024-11-12 13:34:56,648 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 11 [2024-11-12 13:34:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:56,648 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2024-11-12 13:34:56,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-12 13:34:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2024-11-12 13:34:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:34:56,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:56,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:56,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:34:56,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:34:56,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash -502411055, now seen corresponding path program 1 times [2024-11-12 13:34:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:56,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347846309] [2024-11-12 13:34:56,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:56,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:34:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:56,943 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-12 13:34:56,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:56,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347846309] [2024-11-12 13:34:56,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347846309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:34:56,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:34:56,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:34:56,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561578638] [2024-11-12 13:34:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:34:56,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:34:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:56,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:34:56,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:34:56,947 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:34:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:57,420 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2024-11-12 13:34:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:34:57,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-12 13:34:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:57,422 INFO L225 Difference]: With dead ends: 203 [2024-11-12 13:34:57,422 INFO L226 Difference]: Without dead ends: 203 [2024-11-12 13:34:57,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:34:57,423 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 55 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:57,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 461 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:34:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-12 13:34:57,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-12 13:34:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 189 states have internal predecessors, (198), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:34:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2024-11-12 13:34:57,429 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 19 [2024-11-12 13:34:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:57,430 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2024-11-12 13:34:57,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:34:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2024-11-12 13:34:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:34:57,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:57,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:57,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:34:57,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:34:57,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash -502411054, now seen corresponding path program 1 times [2024-11-12 13:34:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:57,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429097218] [2024-11-12 13:34:57,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:57,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:57,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:34:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:57,832 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-12 13:34:57,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:57,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429097218] [2024-11-12 13:34:57,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429097218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:34:57,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:34:57,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:34:57,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986068299] [2024-11-12 13:34:57,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:34:57,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:34:57,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:57,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:34:57,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:34:57,834 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:34:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:58,158 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2024-11-12 13:34:58,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:34:58,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-12 13:34:58,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:58,161 INFO L225 Difference]: With dead ends: 203 [2024-11-12 13:34:58,161 INFO L226 Difference]: Without dead ends: 203 [2024-11-12 13:34:58,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:34:58,162 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 97 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:58,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 344 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:34:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-12 13:34:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2024-11-12 13:34:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 117 states have (on average 1.6837606837606838) internal successors, (197), 188 states have internal predecessors, (197), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:34:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2024-11-12 13:34:58,168 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 19 [2024-11-12 13:34:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:58,169 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2024-11-12 13:34:58,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:34:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2024-11-12 13:34:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:34:58,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:58,170 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:58,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:34:58,170 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:34:58,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:58,170 INFO L85 PathProgramCache]: Analyzing trace with hash 45731933, now seen corresponding path program 1 times [2024-11-12 13:34:58,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:58,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387426884] [2024-11-12 13:34:58,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:58,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:34:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:58,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 13:34:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:34:58,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:58,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387426884] [2024-11-12 13:34:58,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387426884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:34:58,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522599158] [2024-11-12 13:34:58,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:58,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:34:58,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:34:58,705 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-12 13:34:58,706 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-12 13:34:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:58,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 13:34:58,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:34:58,958 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-12 13:34:58,958 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 21 treesize of output 13 [2024-11-12 13:34:58,993 INFO L349 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2024-11-12 13:34:58,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 11 [2024-11-12 13:34:59,032 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 7 [2024-11-12 13:34:59,069 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#valid| |chain_node_alloc_node_~ptr~0#1.base|))))) is different from true [2024-11-12 13:34:59,183 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-12 13:34:59,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2024-11-12 13:34:59,267 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 7 [2024-11-12 13:34:59,281 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#valid| |chain_node_alloc_node_~ptr~0#1.base|))))) is different from true [2024-11-12 13:34:59,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:34:59,382 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-12 13:34:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2024-11-12 13:34:59,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:34:59,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522599158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:34:59,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:34:59,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2024-11-12 13:34:59,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230096071] [2024-11-12 13:34:59,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:34:59,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:34:59,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:59,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:34:59,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=141, Unknown=2, NotChecked=50, Total=240 [2024-11-12 13:34:59,531 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:35:00,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:35:00,262 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2024-11-12 13:35:00,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:35:00,262 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-11-12 13:35:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:35:00,263 INFO L225 Difference]: With dead ends: 201 [2024-11-12 13:35:00,264 INFO L226 Difference]: Without dead ends: 201 [2024-11-12 13:35:00,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=212, Unknown=2, NotChecked=62, Total=342 [2024-11-12 13:35:00,265 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 115 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:35:00,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 711 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 894 Invalid, 0 Unknown, 422 Unchecked, 0.6s Time] [2024-11-12 13:35:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-12 13:35:00,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-12 13:35:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 117 states have (on average 1.6752136752136753) internal successors, (196), 187 states have internal predecessors, (196), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:35:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 222 transitions. [2024-11-12 13:35:00,270 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 222 transitions. Word has length 37 [2024-11-12 13:35:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:35:00,270 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 222 transitions. [2024-11-12 13:35:00,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:35:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 222 transitions. [2024-11-12 13:35:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:35:00,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:35:00,272 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:35:00,291 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-12 13:35:00,472 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,SelfDestructingSolverStorable9 [2024-11-12 13:35:00,473 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:35:00,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:35:00,474 INFO L85 PathProgramCache]: Analyzing trace with hash 45731934, now seen corresponding path program 1 times [2024-11-12 13:35:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:35:00,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907413320] [2024-11-12 13:35:00,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:35:00,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:35:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:00,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:35:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:01,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 13:35:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:35:01,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:35:01,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907413320] [2024-11-12 13:35:01,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907413320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:35:01,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:35:01,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:35:01,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906681701] [2024-11-12 13:35:01,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:35:01,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:35:01,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:35:01,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:35:01,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:35:01,358 INFO L87 Difference]: Start difference. First operand 201 states and 222 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-12 13:35:02,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:35:02,082 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2024-11-12 13:35:02,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:35:02,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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 37 [2024-11-12 13:35:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:35:02,083 INFO L225 Difference]: With dead ends: 202 [2024-11-12 13:35:02,084 INFO L226 Difference]: Without dead ends: 202 [2024-11-12 13:35:02,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:35:02,084 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 58 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 13:35:02,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 630 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 13:35:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-12 13:35:02,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-11-12 13:35:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 117 states have (on average 1.6666666666666667) internal successors, (195), 186 states have internal predecessors, (195), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:35:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2024-11-12 13:35:02,090 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 37 [2024-11-12 13:35:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:35:02,090 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2024-11-12 13:35:02,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-12 13:35:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2024-11-12 13:35:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 13:35:02,106 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:35:02,106 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:35:02,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:35:02,107 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:35:02,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:35:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1491506621, now seen corresponding path program 1 times [2024-11-12 13:35:02,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:35:02,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952461143] [2024-11-12 13:35:02,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:35:02,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:35:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:02,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:35:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:02,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 13:35:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 13:35:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:35:02,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:35:02,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952461143] [2024-11-12 13:35:02,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952461143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:35:02,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:35:02,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:35:02,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491324609] [2024-11-12 13:35:02,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:35:02,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:35:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:35:02,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:35:02,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:35:02,556 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:35:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:35:02,986 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2024-11-12 13:35:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:35:02,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2024-11-12 13:35:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:35:02,988 INFO L225 Difference]: With dead ends: 205 [2024-11-12 13:35:02,988 INFO L226 Difference]: Without dead ends: 205 [2024-11-12 13:35:02,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:35:02,989 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 210 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:35:02,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 312 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:35:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-12 13:35:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2024-11-12 13:35:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 117 states have (on average 1.606837606837607) internal successors, (188), 179 states have internal predecessors, (188), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:35:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 214 transitions. [2024-11-12 13:35:02,996 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 214 transitions. Word has length 58 [2024-11-12 13:35:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:35:02,996 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 214 transitions. [2024-11-12 13:35:02,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:35:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 214 transitions. [2024-11-12 13:35:02,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 13:35:02,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:35:02,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:35:02,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:35:02,999 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:35:03,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:35:03,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1491506620, now seen corresponding path program 1 times [2024-11-12 13:35:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:35:03,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499825587] [2024-11-12 13:35:03,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:35:03,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:35:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:03,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:35:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:03,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 13:35:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:03,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 13:35:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:35:03,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:35:03,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499825587] [2024-11-12 13:35:03,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499825587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:35:03,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:35:03,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:35:03,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082319379] [2024-11-12 13:35:03,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:35:03,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:35:03,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:35:03,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:35:03,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:35:03,499 INFO L87 Difference]: Start difference. First operand 193 states and 214 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:35:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:35:04,052 INFO L93 Difference]: Finished difference Result 204 states and 232 transitions. [2024-11-12 13:35:04,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:35:04,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2024-11-12 13:35:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:35:04,054 INFO L225 Difference]: With dead ends: 204 [2024-11-12 13:35:04,054 INFO L226 Difference]: Without dead ends: 204 [2024-11-12 13:35:04,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:35:04,055 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 145 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:35:04,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 380 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:35:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-12 13:35:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 195. [2024-11-12 13:35:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 124 states have (on average 1.532258064516129) internal successors, (190), 180 states have internal predecessors, (190), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:35:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2024-11-12 13:35:04,061 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 58 [2024-11-12 13:35:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:35:04,062 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2024-11-12 13:35:04,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:35:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2024-11-12 13:35:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 13:35:04,063 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:35:04,063 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:35:04,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:35:04,063 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:35:04,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:35:04,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1007935234, now seen corresponding path program 1 times [2024-11-12 13:35:04,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:35:04,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452964215] [2024-11-12 13:35:04,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:35:04,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:35:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:04,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:35:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:04,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 13:35:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:04,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 13:35:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:35:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:35:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452964215] [2024-11-12 13:35:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452964215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:35:04,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:35:04,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:35:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453312265] [2024-11-12 13:35:04,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:35:04,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:35:04,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:35:04,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:35:04,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:35:04,580 INFO L87 Difference]: Start difference. First operand 195 states and 218 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:35:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:35:05,163 INFO L93 Difference]: Finished difference Result 200 states and 224 transitions. [2024-11-12 13:35:05,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:35:05,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-12 13:35:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:35:05,165 INFO L225 Difference]: With dead ends: 200 [2024-11-12 13:35:05,167 INFO L226 Difference]: Without dead ends: 200 [2024-11-12 13:35:05,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:35:05,167 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 148 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:35:05,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 448 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:35:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-12 13:35:05,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 188. [2024-11-12 13:35:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 124 states have (on average 1.4758064516129032) internal successors, (183), 173 states have internal predecessors, (183), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:35:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2024-11-12 13:35:05,182 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 59 [2024-11-12 13:35:05,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:35:05,183 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2024-11-12 13:35:05,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:35:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2024-11-12 13:35:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 13:35:05,184 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:35:05,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:35:05,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:35:05,184 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:35:05,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:35:05,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1007935235, now seen corresponding path program 1 times [2024-11-12 13:35:05,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:35:05,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213449448] [2024-11-12 13:35:05,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:35:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:35:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:05,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:35:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:05,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 13:35:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:05,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 13:35:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:35:05,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:35:05,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213449448] [2024-11-12 13:35:05,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213449448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:35:05,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:35:05,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:35:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850003665] [2024-11-12 13:35:05,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:35:05,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:35:05,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:35:05,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:35:05,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:35:05,769 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 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-12 13:35:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:35:06,283 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2024-11-12 13:35:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:35:06,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2024-11-12 13:35:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:35:06,285 INFO L225 Difference]: With dead ends: 183 [2024-11-12 13:35:06,285 INFO L226 Difference]: Without dead ends: 183 [2024-11-12 13:35:06,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:35:06,286 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 211 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:35:06,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 345 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:35:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-12 13:35:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-11-12 13:35:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 166 states have internal predecessors, (176), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:35:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 204 transitions. [2024-11-12 13:35:06,291 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 204 transitions. Word has length 59 [2024-11-12 13:35:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:35:06,291 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 204 transitions. [2024-11-12 13:35:06,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 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-12 13:35:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 204 transitions. [2024-11-12 13:35:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 13:35:06,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:35:06,296 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:35:06,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:35:06,296 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:35:06,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:35:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1384284051, now seen corresponding path program 1 times [2024-11-12 13:35:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:35:06,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453181221] [2024-11-12 13:35:06,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:35:06,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:35:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:06,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:35:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 13:35:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 13:35:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:35:06,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:35:06,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453181221] [2024-11-12 13:35:06,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453181221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:35:06,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660807088] [2024-11-12 13:35:06,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:35:06,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:35:06,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:35:06,824 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-12 13:35:06,826 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-12 13:35:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:07,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-12 13:35:07,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:35:07,275 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-12 13:35:07,468 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:35:07,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:35:07,472 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-12 13:35:07,525 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-12 13:35:07,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:35:07,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:35:07,782 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-12 13:35:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:35:07,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:35:07,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-12 13:35:07,997 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 16 [2024-11-12 13:35:08,003 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 26 treesize of output 24 [2024-11-12 13:35:08,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-12 13:35:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:35:08,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660807088] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:35:08,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:35:08,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 32 [2024-11-12 13:35:08,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811944093] [2024-11-12 13:35:08,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:35:08,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 13:35:08,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:35:08,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 13:35:08,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2024-11-12 13:35:08,527 INFO L87 Difference]: Start difference. First operand 181 states and 204 transitions. Second operand has 32 states, 32 states have (on average 3.40625) internal successors, (109), 30 states have internal predecessors, (109), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-12 13:35:12,587 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-12 13:35:16,613 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-12 13:35:20,626 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-12 13:35:24,686 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-12 13:35:28,698 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-12 13:35:32,861 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-12 13:35:36,918 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-12 13:35:40,934 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-12 13:35:45,027 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-12 13:35:49,039 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-12 13:35:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:35:50,335 INFO L93 Difference]: Finished difference Result 224 states and 249 transitions. [2024-11-12 13:35:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 13:35:50,336 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.40625) internal successors, (109), 30 states have internal predecessors, (109), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 66 [2024-11-12 13:35:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:35:50,337 INFO L225 Difference]: With dead ends: 224 [2024-11-12 13:35:50,337 INFO L226 Difference]: Without dead ends: 224 [2024-11-12 13:35:50,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=221, Invalid=2229, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 13:35:50,339 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 369 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 47 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:35:50,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 2111 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1947 Invalid, 10 Unknown, 0 Unchecked, 41.2s Time] [2024-11-12 13:35:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-12 13:35:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 207. [2024-11-12 13:35:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 148 states have (on average 1.3986486486486487) internal successors, (207), 190 states have internal predecessors, (207), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:35:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 235 transitions. [2024-11-12 13:35:50,345 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 235 transitions. Word has length 66 [2024-11-12 13:35:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:35:50,346 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 235 transitions. [2024-11-12 13:35:50,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.40625) internal successors, (109), 30 states have internal predecessors, (109), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-12 13:35:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 235 transitions. [2024-11-12 13:35:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 13:35:50,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:35:50,347 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:35:50,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 13:35:50,547 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,SelfDestructingSolverStorable15 [2024-11-12 13:35:50,548 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:35:50,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:35:50,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1374309996, now seen corresponding path program 1 times [2024-11-12 13:35:50,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:35:50,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246811659] [2024-11-12 13:35:50,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:35:50,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:35:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:51,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:35:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:51,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 13:35:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 13:35:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:35:51,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:35:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246811659] [2024-11-12 13:35:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246811659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:35:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021428524] [2024-11-12 13:35:51,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:35:51,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:35:51,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:35:51,545 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-12 13:35:51,548 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-12 13:35:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:51,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-12 13:35:51,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:35:52,071 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-12 13:35:52,253 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:35:52,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:35:52,256 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 26 treesize of output 17 [2024-11-12 13:35:52,302 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-12 13:35:52,377 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-12 13:35:52,407 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#valid| |chain_node_alloc_node_~ptr~0#1.base|))))) is different from true [2024-11-12 13:35:52,482 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-12 13:35:52,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-12 13:35:52,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:35:52,544 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-12 13:35:52,609 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:35:52,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:35:52,611 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 12 [2024-11-12 13:35:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2024-11-12 13:35:52,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:35:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021428524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:35:52,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:35:52,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2024-11-12 13:35:52,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492356892] [2024-11-12 13:35:52,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:35:52,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 13:35:52,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:35:52,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 13:35:52,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=914, Unknown=1, NotChecked=60, Total=1056 [2024-11-12 13:35:52,734 INFO L87 Difference]: Start difference. First operand 207 states and 235 transitions. Second operand has 32 states, 31 states have (on average 3.225806451612903) internal successors, (100), 29 states have internal predecessors, (100), 6 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 13:35:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:35:54,360 INFO L93 Difference]: Finished difference Result 213 states and 238 transitions. [2024-11-12 13:35:54,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:35:54,361 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.225806451612903) internal successors, (100), 29 states have internal predecessors, (100), 6 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 66 [2024-11-12 13:35:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:35:54,361 INFO L225 Difference]: With dead ends: 213 [2024-11-12 13:35:54,362 INFO L226 Difference]: Without dead ends: 213 [2024-11-12 13:35:54,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=1655, Unknown=1, NotChecked=82, Total=1892 [2024-11-12 13:35:54,363 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 399 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:35:54,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1250 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2225 Invalid, 0 Unknown, 206 Unchecked, 1.2s Time] [2024-11-12 13:35:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-12 13:35:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2024-11-12 13:35:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 148 states have (on average 1.3918918918918919) internal successors, (206), 190 states have internal predecessors, (206), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:35:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 234 transitions. [2024-11-12 13:35:54,368 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 234 transitions. Word has length 66 [2024-11-12 13:35:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:35:54,369 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 234 transitions. [2024-11-12 13:35:54,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.225806451612903) internal successors, (100), 29 states have internal predecessors, (100), 6 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 13:35:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 234 transitions. [2024-11-12 13:35:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 13:35:54,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:35:54,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:35:54,388 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-12 13:35:54,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:35:54,571 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-12 13:35:54,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:35:54,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1374309997, now seen corresponding path program 1 times [2024-11-12 13:35:54,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:35:54,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395488865] [2024-11-12 13:35:54,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:35:54,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:35:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:55,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:35:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:55,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 13:35:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:55,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 13:35:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:35:55,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:35:55,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395488865] [2024-11-12 13:35:55,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395488865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:35:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138188895] [2024-11-12 13:35:55,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:35:55,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:35:55,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:35:55,652 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-12 13:35:55,653 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-12 13:35:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:35:55,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-12 13:35:55,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:35:56,191 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-12 13:35:56,196 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-12 13:35:56,396 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:35:56,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-12 13:35:56,404 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:35:56,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:35:56,407 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 26 treesize of output 17 [2024-11-12 13:35:56,457 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-12 13:35:56,462 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-12 13:35:56,543 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 15 treesize of output 9 [2024-11-12 13:35:56,546 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-12 13:35:56,587 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) (exists ((|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_12| Int)) (<= 0 (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_12|) 0)))) is different from true [2024-11-12 13:35:56,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:35:56,658 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 24 treesize of output 19 [2024-11-12 13:35:56,668 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:35:56,668 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-12 13:35:56,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:35:56,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-12 13:35:56,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:35:56,820 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:35:56,833 INFO L349 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2024-11-12 13:35:56,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 28 [2024-11-12 13:35:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2024-11-12 13:35:56,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:35:57,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138188895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:35:57,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:35:57,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2024-11-12 13:35:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113621595] [2024-11-12 13:35:57,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:35:57,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-12 13:35:57,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:35:57,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-12 13:35:57,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1099, Unknown=1, NotChecked=66, Total=1260 [2024-11-12 13:35:57,153 INFO L87 Difference]: Start difference. First operand 207 states and 234 transitions. Second operand has 34 states, 33 states have (on average 3.242424242424242) internal successors, (107), 30 states have internal predecessors, (107), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6)