./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:23:03,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:23:03,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:23:03,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:23:03,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:23:03,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:23:03,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:23:03,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:23:03,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:23:03,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:23:03,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:23:03,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:23:03,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:23:03,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:23:03,324 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:23:03,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:23:03,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:23:03,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:23:03,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:23:03,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:23:03,327 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:23:03,328 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:23:03,328 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:23:03,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:23:03,330 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:23:03,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:23:03,330 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:23:03,330 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:23:03,330 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:23:03,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:23:03,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:23:03,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:23:03,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:23:03,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:23:03,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:23:03,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:23:03,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:23:03,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:23:03,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:23:03,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:23:03,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:23:03,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:23:03,334 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-10 15:23:03,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:23:03,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:23:03,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:23:03,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:23:03,547 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:23:03,548 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-10 15:23:04,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:23:04,934 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:23:04,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-11-10 15:23:04,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66378305a/1ade07a814ec4d27bebc622ce611eefc/FLAGa23ad885f [2024-11-10 15:23:05,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66378305a/1ade07a814ec4d27bebc622ce611eefc [2024-11-10 15:23:05,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:23:05,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:23:05,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:23:05,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:23:05,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:23:05,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@452d79fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05, skipping insertion in model container [2024-11-10 15:23:05,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:23:05,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:23:05,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:23:05,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:23:05,684 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:23:05,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05 WrapperNode [2024-11-10 15:23:05,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:23:05,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:23:05,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:23:05,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:23:05,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,719 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-11-10 15:23:05,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:23:05,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:23:05,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:23:05,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:23:05,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,764 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 6, 18, 8, 8]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0, 0]. The 10 writes are split as follows [0, 1, 7, 1, 1]. [2024-11-10 15:23:05,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:23:05,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:23:05,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:23:05,783 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:23:05,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (1/1) ... [2024-11-10 15:23:05,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:23:05,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:05,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:23:05,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:23:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-10 15:23:05,857 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-10 15:23:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:23:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:23:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:23:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:23:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:23:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 15:23:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-10 15:23:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-10 15:23:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:23:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:23:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 15:23:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-11-10 15:23:05,860 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-11-10 15:23:05,860 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 15:23:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 15:23:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 15:23:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-11-10 15:23:05,861 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-11-10 15:23:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:23:05,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:23:05,996 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:23:05,997 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:23:06,386 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: call ULTIMATE.dealloc(main_~#p1~0#1.base, main_~#p1~0#1.offset);havoc main_~#p1~0#1.base, main_~#p1~0#1.offset;call ULTIMATE.dealloc(main_~#p2~0#1.base, main_~#p2~0#1.offset);havoc main_~#p2~0#1.base, main_~#p2~0#1.offset; [2024-11-10 15:23:06,387 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L600: havoc create_sll_#t~mem11#1.base, create_sll_#t~mem11#1.offset;call ULTIMATE.dealloc(create_sll_~#list~0#1.base, create_sll_~#list~0#1.offset);havoc create_sll_~#list~0#1.base, create_sll_~#list~0#1.offset; [2024-11-10 15:23:06,409 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2024-11-10 15:23:06,409 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:23:06,424 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:23:06,424 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:23:06,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:23:06 BoogieIcfgContainer [2024-11-10 15:23:06,425 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:23:06,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:23:06,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:23:06,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:23:06,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:23:05" (1/3) ... [2024-11-10 15:23:06,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103ce90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:23:06, skipping insertion in model container [2024-11-10 15:23:06,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:05" (2/3) ... [2024-11-10 15:23:06,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103ce90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:23:06, skipping insertion in model container [2024-11-10 15:23:06,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:23:06" (3/3) ... [2024-11-10 15:23:06,430 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2024-11-10 15:23:06,442 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:23:06,442 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2024-11-10 15:23:06,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:23:06,493 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;@56e5d972, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:23:06,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2024-11-10 15:23:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 144 states have (on average 1.9375) internal successors, (279), 235 states have internal predecessors, (279), 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-10 15:23:06,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 15:23:06,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:06,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 15:23:06,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:06,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:06,509 INFO L85 PathProgramCache]: Analyzing trace with hash 10157689, now seen corresponding path program 1 times [2024-11-10 15:23:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:06,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485849530] [2024-11-10 15:23:06,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:06,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:06,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:06,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485849530] [2024-11-10 15:23:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485849530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:06,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:06,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:23:06,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115131859] [2024-11-10 15:23:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:06,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 15:23:06,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:06,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 15:23:06,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 15:23:06,662 INFO L87 Difference]: Start difference. First operand has 249 states, 144 states have (on average 1.9375) internal successors, (279), 235 states have internal predecessors, (279), 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-10 15:23:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:06,726 INFO L93 Difference]: Finished difference Result 246 states and 267 transitions. [2024-11-10 15:23:06,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 15:23:06,728 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-10 15:23:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:06,737 INFO L225 Difference]: With dead ends: 246 [2024-11-10 15:23:06,737 INFO L226 Difference]: Without dead ends: 243 [2024-11-10 15:23:06,739 INFO L431 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-10 15:23:06,742 INFO L432 NwaCegarLoop]: 267 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, 267 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-10 15:23:06,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:23:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-10 15:23:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2024-11-10 15:23:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 140 states have (on average 1.7) internal successors, (238), 229 states have internal predecessors, (238), 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-10 15:23:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 264 transitions. [2024-11-10 15:23:06,778 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 264 transitions. Word has length 4 [2024-11-10 15:23:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:06,778 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 264 transitions. [2024-11-10 15:23:06,778 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-10 15:23:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 264 transitions. [2024-11-10 15:23:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:23:06,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:06,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:06,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:23:06,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:06,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:06,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1960380589, now seen corresponding path program 1 times [2024-11-10 15:23:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130333429] [2024-11-10 15:23:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:06,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:06,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:06,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130333429] [2024-11-10 15:23:06,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130333429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:06,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:06,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:23:06,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872276671] [2024-11-10 15:23:06,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:06,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:23:06,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:06,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:23:06,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:23:06,891 INFO L87 Difference]: Start difference. First operand 243 states and 264 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:23:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:07,061 INFO L93 Difference]: Finished difference Result 241 states and 262 transitions. [2024-11-10 15:23:07,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:23:07,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-11-10 15:23:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:07,063 INFO L225 Difference]: With dead ends: 241 [2024-11-10 15:23:07,065 INFO L226 Difference]: Without dead ends: 241 [2024-11-10 15:23:07,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:23:07,066 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 2 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:07,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 428 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:23:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-10 15:23:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-11-10 15:23:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 140 states have (on average 1.6857142857142857) internal successors, (236), 227 states have internal predecessors, (236), 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-10 15:23:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 262 transitions. [2024-11-10 15:23:07,084 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 262 transitions. Word has length 7 [2024-11-10 15:23:07,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:07,085 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 262 transitions. [2024-11-10 15:23:07,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:23:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 262 transitions. [2024-11-10 15:23:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:23:07,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:07,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:07,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:23:07,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:07,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1960380590, now seen corresponding path program 1 times [2024-11-10 15:23:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:07,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069704326] [2024-11-10 15:23:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:07,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:07,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069704326] [2024-11-10 15:23:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069704326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:07,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:07,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:23:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083305992] [2024-11-10 15:23:07,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:07,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:23:07,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:07,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:23:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:23:07,203 INFO L87 Difference]: Start difference. First operand 241 states and 262 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:23:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:07,299 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2024-11-10 15:23:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:23:07,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-11-10 15:23:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:07,300 INFO L225 Difference]: With dead ends: 239 [2024-11-10 15:23:07,300 INFO L226 Difference]: Without dead ends: 239 [2024-11-10 15:23:07,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:23:07,301 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 2 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 434 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-10 15:23:07,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 434 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:23:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-10 15:23:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-11-10 15:23:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 140 states have (on average 1.6714285714285715) internal successors, (234), 225 states have internal predecessors, (234), 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-10 15:23:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 260 transitions. [2024-11-10 15:23:07,313 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 260 transitions. Word has length 7 [2024-11-10 15:23:07,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:07,314 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 260 transitions. [2024-11-10 15:23:07,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:23:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 260 transitions. [2024-11-10 15:23:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:23:07,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:07,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:07,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:23:07,318 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-10 15:23:07,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:07,319 INFO L85 PathProgramCache]: Analyzing trace with hash -627906103, now seen corresponding path program 1 times [2024-11-10 15:23:07,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:07,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194253168] [2024-11-10 15:23:07,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:07,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194253168] [2024-11-10 15:23:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194253168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:07,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:07,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:23:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563046391] [2024-11-10 15:23:07,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:07,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:23:07,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:07,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:23:07,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:23:07,457 INFO L87 Difference]: Start difference. First operand 239 states and 260 transitions. Second operand has 6 states, 5 states have (on average 2.0) 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-10 15:23:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:07,639 INFO L93 Difference]: Finished difference Result 234 states and 255 transitions. [2024-11-10 15:23:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:23:07,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) 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-10 15:23:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:07,640 INFO L225 Difference]: With dead ends: 234 [2024-11-10 15:23:07,640 INFO L226 Difference]: Without dead ends: 234 [2024-11-10 15:23:07,640 INFO L431 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-10 15:23:07,641 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 47 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:07,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 696 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:23:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-10 15:23:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-10 15:23:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 140 states have (on average 1.6357142857142857) internal successors, (229), 220 states have internal predecessors, (229), 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-10 15:23:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 255 transitions. [2024-11-10 15:23:07,655 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 255 transitions. Word has length 11 [2024-11-10 15:23:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:07,655 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 255 transitions. [2024-11-10 15:23:07,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) 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-10 15:23:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 255 transitions. [2024-11-10 15:23:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:23:07,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:07,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:07,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:23:07,656 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-10 15:23:07,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:07,656 INFO L85 PathProgramCache]: Analyzing trace with hash -627906102, now seen corresponding path program 1 times [2024-11-10 15:23:07,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:07,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505797306] [2024-11-10 15:23:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:07,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:07,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505797306] [2024-11-10 15:23:07,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505797306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:07,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:07,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:23:07,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316846553] [2024-11-10 15:23:07,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:07,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:23:07,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:07,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:23:07,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:23:07,838 INFO L87 Difference]: Start difference. First operand 234 states and 255 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-10 15:23:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:08,067 INFO L93 Difference]: Finished difference Result 229 states and 250 transitions. [2024-11-10 15:23:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:23:08,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-10 15:23:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:08,069 INFO L225 Difference]: With dead ends: 229 [2024-11-10 15:23:08,069 INFO L226 Difference]: Without dead ends: 229 [2024-11-10 15:23:08,069 INFO L431 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-10 15:23:08,072 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 38 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:08,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 637 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:23:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-10 15:23:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-10 15:23:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 140 states have (on average 1.6) internal successors, (224), 215 states have internal predecessors, (224), 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-10 15:23:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 250 transitions. [2024-11-10 15:23:08,082 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 250 transitions. Word has length 11 [2024-11-10 15:23:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:08,083 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 250 transitions. [2024-11-10 15:23:08,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-10 15:23:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 250 transitions. [2024-11-10 15:23:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:23:08,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:08,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:08,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:23:08,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:08,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2009747261, now seen corresponding path program 1 times [2024-11-10 15:23:08,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:08,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559356508] [2024-11-10 15:23:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:08,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:08,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559356508] [2024-11-10 15:23:08,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559356508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:08,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:08,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:23:08,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364937092] [2024-11-10 15:23:08,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:08,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:23:08,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:08,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:23:08,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:23:08,147 INFO L87 Difference]: Start difference. First operand 229 states and 250 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:23:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:08,287 INFO L93 Difference]: Finished difference Result 228 states and 249 transitions. [2024-11-10 15:23:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:23:08,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 12 [2024-11-10 15:23:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:08,288 INFO L225 Difference]: With dead ends: 228 [2024-11-10 15:23:08,288 INFO L226 Difference]: Without dead ends: 228 [2024-11-10 15:23:08,288 INFO L431 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-10 15:23:08,290 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 3 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:08,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 737 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:23:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-10 15:23:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-10 15:23:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 140 states have (on average 1.5928571428571427) internal successors, (223), 214 states have internal predecessors, (223), 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-10 15:23:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 249 transitions. [2024-11-10 15:23:08,297 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 249 transitions. Word has length 12 [2024-11-10 15:23:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:08,297 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 249 transitions. [2024-11-10 15:23:08,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:23:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 249 transitions. [2024-11-10 15:23:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:23:08,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:08,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:08,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:23:08,299 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:08,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2009747262, now seen corresponding path program 1 times [2024-11-10 15:23:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:08,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567787340] [2024-11-10 15:23:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:08,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567787340] [2024-11-10 15:23:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567787340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:08,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:08,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:23:08,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225290334] [2024-11-10 15:23:08,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:08,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:23:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:08,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:23:08,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:23:08,386 INFO L87 Difference]: Start difference. First operand 228 states and 249 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:23:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:08,531 INFO L93 Difference]: Finished difference Result 227 states and 248 transitions. [2024-11-10 15:23:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:23:08,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 12 [2024-11-10 15:23:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:08,532 INFO L225 Difference]: With dead ends: 227 [2024-11-10 15:23:08,532 INFO L226 Difference]: Without dead ends: 227 [2024-11-10 15:23:08,532 INFO L431 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-10 15:23:08,533 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 4 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:08,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 994 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:23:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-10 15:23:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-10 15:23:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 140 states have (on average 1.5857142857142856) internal successors, (222), 213 states have internal predecessors, (222), 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-10 15:23:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 248 transitions. [2024-11-10 15:23:08,536 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 248 transitions. Word has length 12 [2024-11-10 15:23:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:08,537 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 248 transitions. [2024-11-10 15:23:08,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:23:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 248 transitions. [2024-11-10 15:23:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:23:08,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:08,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:08,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:23:08,537 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:08,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1547617006, now seen corresponding path program 1 times [2024-11-10 15:23:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:08,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888673782] [2024-11-10 15:23:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:08,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 15:23:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:08,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:08,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888673782] [2024-11-10 15:23:08,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888673782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:08,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:08,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:23:08,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038929013] [2024-11-10 15:23:08,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:08,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:23:08,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:08,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:23:08,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:23:08,775 INFO L87 Difference]: Start difference. First operand 227 states and 248 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:23:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:09,186 INFO L93 Difference]: Finished difference Result 226 states and 247 transitions. [2024-11-10 15:23:09,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:23:09,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 20 [2024-11-10 15:23:09,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:09,188 INFO L225 Difference]: With dead ends: 226 [2024-11-10 15:23:09,188 INFO L226 Difference]: Without dead ends: 226 [2024-11-10 15:23:09,188 INFO L431 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-10 15:23:09,190 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 63 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:09,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 631 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:23:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-10 15:23:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-11-10 15:23:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 140 states have (on average 1.5785714285714285) internal successors, (221), 212 states have internal predecessors, (221), 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-10 15:23:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 247 transitions. [2024-11-10 15:23:09,196 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 247 transitions. Word has length 20 [2024-11-10 15:23:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:09,197 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 247 transitions. [2024-11-10 15:23:09,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:23:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 247 transitions. [2024-11-10 15:23:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:23:09,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:09,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:09,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:23:09,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:09,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1547617007, now seen corresponding path program 1 times [2024-11-10 15:23:09,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:09,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308557030] [2024-11-10 15:23:09,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:09,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:09,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 15:23:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:09,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:09,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308557030] [2024-11-10 15:23:09,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308557030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:09,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:09,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:23:09,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405917117] [2024-11-10 15:23:09,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:09,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:23:09,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:09,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:23:09,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:23:09,407 INFO L87 Difference]: Start difference. First operand 226 states and 247 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:23:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:09,654 INFO L93 Difference]: Finished difference Result 225 states and 246 transitions. [2024-11-10 15:23:09,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:23:09,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (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 20 [2024-11-10 15:23:09,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:09,655 INFO L225 Difference]: With dead ends: 225 [2024-11-10 15:23:09,655 INFO L226 Difference]: Without dead ends: 225 [2024-11-10 15:23:09,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10 15:23:09,656 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 113 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:09,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 385 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:23:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-10 15:23:09,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2024-11-10 15:23:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 140 states have (on average 1.5714285714285714) internal successors, (220), 211 states have internal predecessors, (220), 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-10 15:23:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 246 transitions. [2024-11-10 15:23:09,660 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 246 transitions. Word has length 20 [2024-11-10 15:23:09,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:09,660 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 246 transitions. [2024-11-10 15:23:09,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:23:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 246 transitions. [2024-11-10 15:23:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:23:09,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:09,661 INFO L215 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, 1, 1] [2024-11-10 15:23:09,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:23:09,661 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:09,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash -205352600, now seen corresponding path program 1 times [2024-11-10 15:23:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:09,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885865521] [2024-11-10 15:23:09,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:09,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:09,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 15:23:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 15:23:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:10,082 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-10 15:23:10,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:10,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885865521] [2024-11-10 15:23:10,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885865521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:10,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255938692] [2024-11-10 15:23:10,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:10,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:10,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:10,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:10,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:23:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:10,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 15:23:10,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:10,281 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-10 15:23:10,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2024-11-10 15:23:10,316 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| 1))) is different from true [2024-11-10 15:23:10,369 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-10 15:23:10,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2024-11-10 15:23:10,533 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1))) is different from true [2024-11-10 15:23:10,570 INFO L349 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2024-11-10 15:23:10,570 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 3 case distinctions, treesize of input 22 treesize of output 43 [2024-11-10 15:23:10,642 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-10 15:23:10,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:11,076 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-10 15:23:11,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255938692] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:23:11,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:23:11,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2024-11-10 15:23:11,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745846772] [2024-11-10 15:23:11,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:11,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 15:23:11,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:11,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 15:23:11,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=329, Unknown=2, NotChecked=78, Total=506 [2024-11-10 15:23:11,078 INFO L87 Difference]: Start difference. First operand 225 states and 246 transitions. Second operand has 23 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 21 states have internal predecessors, (93), 3 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:23:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:11,753 INFO L93 Difference]: Finished difference Result 224 states and 245 transitions. [2024-11-10 15:23:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:23:11,753 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 21 states have internal predecessors, (93), 3 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2024-11-10 15:23:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:11,755 INFO L225 Difference]: With dead ends: 224 [2024-11-10 15:23:11,755 INFO L226 Difference]: Without dead ends: 224 [2024-11-10 15:23:11,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=508, Unknown=2, NotChecked=98, Total=756 [2024-11-10 15:23:11,756 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 242 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 475 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:11,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 905 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 966 Invalid, 0 Unknown, 475 Unchecked, 0.5s Time] [2024-11-10 15:23:11,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-10 15:23:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-10 15:23:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 140 states have (on average 1.5642857142857143) internal successors, (219), 210 states have internal predecessors, (219), 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-10 15:23:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 245 transitions. [2024-11-10 15:23:11,762 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 245 transitions. Word has length 39 [2024-11-10 15:23:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:11,763 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 245 transitions. [2024-11-10 15:23:11,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 21 states have internal predecessors, (93), 3 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:23:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 245 transitions. [2024-11-10 15:23:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:23:11,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:11,765 INFO L215 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, 1, 1] [2024-11-10 15:23:11,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 15:23:11,965 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-10 15:23:11,966 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:11,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:11,966 INFO L85 PathProgramCache]: Analyzing trace with hash -205352599, now seen corresponding path program 1 times [2024-11-10 15:23:11,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:11,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809797479] [2024-11-10 15:23:11,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:11,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:12,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 15:23:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:12,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 15:23:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:12,474 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-10 15:23:12,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:12,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809797479] [2024-11-10 15:23:12,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809797479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:12,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:12,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:23:12,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194677674] [2024-11-10 15:23:12,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:12,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:23:12,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:12,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:23:12,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:23:12,477 INFO L87 Difference]: Start difference. First operand 224 states and 245 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:23:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:12,718 INFO L93 Difference]: Finished difference Result 223 states and 244 transitions. [2024-11-10 15:23:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:23:12,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2024-11-10 15:23:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:12,719 INFO L225 Difference]: With dead ends: 223 [2024-11-10 15:23:12,719 INFO L226 Difference]: Without dead ends: 223 [2024-11-10 15:23:12,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-10 15:23:12,720 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 119 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:12,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 370 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:23:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-10 15:23:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-11-10 15:23:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.5571428571428572) internal successors, (218), 209 states have internal predecessors, (218), 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-10 15:23:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 244 transitions. [2024-11-10 15:23:12,725 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 244 transitions. Word has length 39 [2024-11-10 15:23:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:12,726 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 244 transitions. [2024-11-10 15:23:12,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:23:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 244 transitions. [2024-11-10 15:23:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 15:23:12,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:12,727 INFO L215 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] [2024-11-10 15:23:12,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:23:12,727 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:12,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1528156039, now seen corresponding path program 1 times [2024-11-10 15:23:12,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:12,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655393504] [2024-11-10 15:23:12,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:12,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:12,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 15:23:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 15:23:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 15:23:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,115 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-10 15:23:13,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:13,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655393504] [2024-11-10 15:23:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655393504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:13,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:13,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:23:13,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697786873] [2024-11-10 15:23:13,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:13,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:23:13,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:13,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:23:13,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:23:13,118 INFO L87 Difference]: Start difference. First operand 223 states and 244 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-10 15:23:13,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:13,524 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2024-11-10 15:23:13,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:23:13,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 62 [2024-11-10 15:23:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:13,528 INFO L225 Difference]: With dead ends: 230 [2024-11-10 15:23:13,528 INFO L226 Difference]: Without dead ends: 230 [2024-11-10 15:23:13,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:23:13,528 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 238 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:13,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 449 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:23:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-10 15:23:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 216. [2024-11-10 15:23:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 140 states have (on average 1.5071428571428571) 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-10 15:23:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 237 transitions. [2024-11-10 15:23:13,534 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 237 transitions. Word has length 62 [2024-11-10 15:23:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:13,534 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 237 transitions. [2024-11-10 15:23:13,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-10 15:23:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 237 transitions. [2024-11-10 15:23:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 15:23:13,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:13,536 INFO L215 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] [2024-11-10 15:23:13,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:23:13,536 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:13,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1528156040, now seen corresponding path program 1 times [2024-11-10 15:23:13,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:13,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248836531] [2024-11-10 15:23:13,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:13,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 15:23:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 15:23:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 15:23:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,838 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-10 15:23:13,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:13,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248836531] [2024-11-10 15:23:13,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248836531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:13,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:13,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:23:13,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134773871] [2024-11-10 15:23:13,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:13,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:23:13,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:13,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:23:13,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:23:13,841 INFO L87 Difference]: Start difference. First operand 216 states and 237 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-10 15:23:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:14,322 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2024-11-10 15:23:14,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:23:14,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 62 [2024-11-10 15:23:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:14,324 INFO L225 Difference]: With dead ends: 334 [2024-11-10 15:23:14,325 INFO L226 Difference]: Without dead ends: 334 [2024-11-10 15:23:14,325 INFO L431 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-10 15:23:14,325 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 165 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:14,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 491 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:23:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-10 15:23:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 287. [2024-11-10 15:23:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 205 states have (on average 1.5317073170731708) internal successors, (314), 267 states have internal predecessors, (314), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 15:23:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2024-11-10 15:23:14,331 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 62 [2024-11-10 15:23:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:14,332 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2024-11-10 15:23:14,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-10 15:23:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2024-11-10 15:23:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 15:23:14,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:14,333 INFO L215 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] [2024-11-10 15:23:14,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:23:14,333 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:14,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash 128197173, now seen corresponding path program 1 times [2024-11-10 15:23:14,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:14,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505230390] [2024-11-10 15:23:14,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:14,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:14,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 15:23:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 15:23:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:14,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 15:23:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:14,728 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-10 15:23:14,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:14,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505230390] [2024-11-10 15:23:14,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505230390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:14,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:14,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:23:14,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209563263] [2024-11-10 15:23:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:14,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:23:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:14,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:23:14,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:23:14,731 INFO L87 Difference]: Start difference. First operand 287 states and 352 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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-10 15:23:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:15,147 INFO L93 Difference]: Finished difference Result 294 states and 354 transitions. [2024-11-10 15:23:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:23:15,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 63 [2024-11-10 15:23:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:15,148 INFO L225 Difference]: With dead ends: 294 [2024-11-10 15:23:15,149 INFO L226 Difference]: Without dead ends: 294 [2024-11-10 15:23:15,149 INFO L431 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-10 15:23:15,150 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 187 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:15,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 506 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:23:15,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-10 15:23:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 280. [2024-11-10 15:23:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 205 states have (on average 1.4682926829268292) internal successors, (301), 260 states have internal predecessors, (301), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 15:23:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 339 transitions. [2024-11-10 15:23:15,156 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 339 transitions. Word has length 63 [2024-11-10 15:23:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:15,156 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 339 transitions. [2024-11-10 15:23:15,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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-10 15:23:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 339 transitions. [2024-11-10 15:23:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 15:23:15,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:15,158 INFO L215 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] [2024-11-10 15:23:15,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:23:15,158 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:15,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 128197174, now seen corresponding path program 1 times [2024-11-10 15:23:15,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:15,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407397035] [2024-11-10 15:23:15,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:15,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:15,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 15:23:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:15,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 15:23:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:15,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 15:23:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:15,574 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-10 15:23:15,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:15,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407397035] [2024-11-10 15:23:15,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407397035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:15,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:15,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:23:15,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172420285] [2024-11-10 15:23:15,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:15,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:23:15,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:15,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:23:15,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:23:15,576 INFO L87 Difference]: Start difference. First operand 280 states and 339 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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-10 15:23:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:15,966 INFO L93 Difference]: Finished difference Result 277 states and 332 transitions. [2024-11-10 15:23:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:23:15,967 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 63 [2024-11-10 15:23:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:15,968 INFO L225 Difference]: With dead ends: 277 [2024-11-10 15:23:15,968 INFO L226 Difference]: Without dead ends: 277 [2024-11-10 15:23:15,968 INFO L431 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-10 15:23:15,970 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 226 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:15,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 286 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:23:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-10 15:23:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2024-11-10 15:23:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 205 states have (on average 1.4048780487804877) internal successors, (288), 253 states have internal predecessors, (288), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 15:23:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 326 transitions. [2024-11-10 15:23:15,975 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 326 transitions. Word has length 63 [2024-11-10 15:23:15,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:15,975 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 326 transitions. [2024-11-10 15:23:15,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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-10 15:23:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 326 transitions. [2024-11-10 15:23:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 15:23:15,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:15,979 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-10 15:23:15,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:23:15,980 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-10 15:23:15,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash -514502767, now seen corresponding path program 1 times [2024-11-10 15:23:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:15,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643259974] [2024-11-10 15:23:15,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:15,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:16,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 15:23:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:16,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 15:23:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:16,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 15:23:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:16,377 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-10 15:23:16,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:16,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643259974] [2024-11-10 15:23:16,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643259974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:16,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935189743] [2024-11-10 15:23:16,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:16,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:16,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:16,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:16,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:23:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:16,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 15:23:16,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:16,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:23:16,856 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:23:16,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:16,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:23:16,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:23:17,064 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:23:17,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:17,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:23:17,073 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-10 15:23:17,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:17,098 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-10 15:23:17,208 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-10 15:23:17,213 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-10 15:23:17,315 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-10 15:23:17,650 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-10 15:23:17,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935189743] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:23:17,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:23:17,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 32 [2024-11-10 15:23:17,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038130983] [2024-11-10 15:23:17,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:17,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 15:23:17,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:17,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 15:23:17,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2024-11-10 15:23:17,653 INFO L87 Difference]: Start difference. First operand 273 states and 326 transitions. Second operand has 32 states, 32 states have (on average 3.75) internal successors, (120), 30 states have internal predecessors, (120), 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-10 15:23:21,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:23:25,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:23:29,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:23:33,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:23:37,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:23:41,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:23:45,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:23:49,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:23:54,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:23:58,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:23:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:59,354 INFO L93 Difference]: Finished difference Result 321 states and 376 transitions. [2024-11-10 15:23:59,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 15:23:59,355 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.75) internal successors, (120), 30 states have internal predecessors, (120), 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 71 [2024-11-10 15:23:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:59,356 INFO L225 Difference]: With dead ends: 321 [2024-11-10 15:23:59,356 INFO L226 Difference]: Without dead ends: 321 [2024-11-10 15:23:59,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=2229, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 15:23:59,358 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 417 mSDsluCounter, 2427 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 45 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 2505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:59,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 2562 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2450 Invalid, 10 Unknown, 0 Unchecked, 41.2s Time] [2024-11-10 15:23:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-10 15:23:59,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 303. [2024-11-10 15:23:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 233 states have (on average 1.386266094420601) internal successors, (323), 281 states have internal predecessors, (323), 23 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 15:23:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 361 transitions. [2024-11-10 15:23:59,365 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 361 transitions. Word has length 71 [2024-11-10 15:23:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:59,365 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 361 transitions. [2024-11-10 15:23:59,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.75) internal successors, (120), 30 states have internal predecessors, (120), 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-10 15:23:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 361 transitions. [2024-11-10 15:23:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 15:23:59,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:59,366 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:59,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:23:59,567 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-10 15:23:59,567 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting check_seq_nextErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:23:59,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:59,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1028832652, now seen corresponding path program 1 times [2024-11-10 15:23:59,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:59,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230642264] [2024-11-10 15:23:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:59,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:00,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 15:24:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:00,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 15:24:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:00,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 15:24:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:00,429 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-10 15:24:00,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:00,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230642264] [2024-11-10 15:24:00,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230642264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:00,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25100942] [2024-11-10 15:24:00,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:00,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:00,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:00,432 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:24:00,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 15:24:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:00,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-10 15:24:00,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:24:00,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:24:00,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:24:00,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:24:00,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:24:01,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:01,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-10 15:24:01,016 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:01,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:01,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2024-11-10 15:24:01,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:24:01,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:24:01,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:24:01,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:24:01,163 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_9|) 0) 0)) (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|)))) is different from true [2024-11-10 15:24:01,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:24:01,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:24:01,218 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:24:01,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:24:01,338 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:01,338 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 17 treesize of output 9 [2024-11-10 15:24:01,341 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:01,341 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:01,345 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2024-11-10 15:24:01,345 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 22 treesize of output 13 [2024-11-10 15:24:01,378 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-10 15:24:01,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:24:01,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25100942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:01,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:24:01,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2024-11-10 15:24:01,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787622189] [2024-11-10 15:24:01,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:24:01,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 15:24:01,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:01,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 15:24:01,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1033, Unknown=1, NotChecked=64, Total=1190 [2024-11-10 15:24:01,638 INFO L87 Difference]: Start difference. First operand 303 states and 361 transitions. Second operand has 30 states, 29 states have (on average 3.793103448275862) internal successors, (110), 27 states have internal predecessors, (110), 5 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:24:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:03,813 INFO L93 Difference]: Finished difference Result 428 states and 474 transitions. [2024-11-10 15:24:03,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 15:24:03,814 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.793103448275862) internal successors, (110), 27 states have internal predecessors, (110), 5 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 72 [2024-11-10 15:24:03,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:03,815 INFO L225 Difference]: With dead ends: 428 [2024-11-10 15:24:03,815 INFO L226 Difference]: Without dead ends: 428 [2024-11-10 15:24:03,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=246, Invalid=2727, Unknown=1, NotChecked=106, Total=3080 [2024-11-10 15:24:03,816 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 486 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 2994 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:03,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1549 Invalid, 3506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2994 Invalid, 0 Unknown, 428 Unchecked, 1.4s Time] [2024-11-10 15:24:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-10 15:24:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 371. [2024-11-10 15:24:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 296 states have (on average 1.3783783783783783) internal successors, (408), 345 states have internal predecessors, (408), 24 states have call successors, (24), 10 states have call predecessors, (24), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 15:24:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 448 transitions. [2024-11-10 15:24:03,826 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 448 transitions. Word has length 72 [2024-11-10 15:24:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:03,826 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 448 transitions. [2024-11-10 15:24:03,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.793103448275862) internal successors, (110), 27 states have internal predecessors, (110), 5 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:24:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 448 transitions. [2024-11-10 15:24:03,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 15:24:03,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:03,828 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:03,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 15:24:04,029 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-10 15:24:04,029 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting check_seq_nextErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:24:04,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:04,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1028832651, now seen corresponding path program 1 times [2024-11-10 15:24:04,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:04,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836341532] [2024-11-10 15:24:04,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:04,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:04,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 15:24:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:04,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 15:24:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:04,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 15:24:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:04,694 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-10 15:24:04,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:04,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836341532] [2024-11-10 15:24:04,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836341532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:04,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776631052] [2024-11-10 15:24:04,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:04,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:04,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:04,697 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:24:04,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:24:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:04,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-10 15:24:04,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:24:05,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:24:05,209 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 26 treesize of output 14 [2024-11-10 15:24:05,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:24:05,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:24:05,383 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1))) is different from true [2024-11-10 15:24:05,399 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-10 15:24:05,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 15:24:05,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:24:05,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:24:05,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:05,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:05,513 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-10 15:24:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2024-11-10 15:24:05,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:24:05,787 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 32 treesize of output 28 [2024-11-10 15:24:05,810 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-10 15:24:05,927 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 6 treesize of output 4 [2024-11-10 15:24:06,004 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 32 treesize of output 28 [2024-11-10 15:24:06,014 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-10 15:24:06,062 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 6 treesize of output 4 [2024-11-10 15:24:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:24:06,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776631052] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:24:06,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:24:06,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 21] total 50 [2024-11-10 15:24:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489232417] [2024-11-10 15:24:06,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:24:06,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-10 15:24:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:06,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-10 15:24:06,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2276, Unknown=1, NotChecked=96, Total=2550 [2024-11-10 15:24:06,318 INFO L87 Difference]: Start difference. First operand 371 states and 448 transitions. Second operand has 51 states, 50 states have (on average 3.22) internal successors, (161), 48 states have internal predecessors, (161), 9 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 15:24:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:24:08,556 INFO L93 Difference]: Finished difference Result 388 states and 461 transitions. [2024-11-10 15:24:08,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 15:24:08,556 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.22) internal successors, (161), 48 states have internal predecessors, (161), 9 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 72 [2024-11-10 15:24:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:24:08,558 INFO L225 Difference]: With dead ends: 388 [2024-11-10 15:24:08,558 INFO L226 Difference]: Without dead ends: 388 [2024-11-10 15:24:08,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=435, Invalid=4124, Unknown=1, NotChecked=132, Total=4692 [2024-11-10 15:24:08,559 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 703 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 4727 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 5103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 4727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:24:08,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 2818 Invalid, 5103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 4727 Invalid, 0 Unknown, 261 Unchecked, 1.6s Time] [2024-11-10 15:24:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-10 15:24:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 371. [2024-11-10 15:24:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 296 states have (on average 1.3716216216216217) internal successors, (406), 345 states have internal predecessors, (406), 24 states have call successors, (24), 10 states have call predecessors, (24), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 15:24:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 446 transitions. [2024-11-10 15:24:08,565 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 446 transitions. Word has length 72 [2024-11-10 15:24:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:24:08,565 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 446 transitions. [2024-11-10 15:24:08,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.22) internal successors, (161), 48 states have internal predecessors, (161), 9 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 15:24:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 446 transitions. [2024-11-10 15:24:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 15:24:08,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:24:08,566 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:24:08,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 15:24:08,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 15:24:08,767 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-10 15:24:08,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:24:08,767 INFO L85 PathProgramCache]: Analyzing trace with hash 872355318, now seen corresponding path program 1 times [2024-11-10 15:24:08,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:24:08,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134665896] [2024-11-10 15:24:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:08,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:24:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:09,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 15:24:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:09,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 15:24:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:09,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 15:24:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:24:09,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:24:09,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134665896] [2024-11-10 15:24:09,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134665896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:24:09,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331162682] [2024-11-10 15:24:09,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:24:09,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:24:09,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:24:09,150 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:24:09,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:24:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:24:09,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 15:24:09,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:24:09,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:24:09,532 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:09,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:09,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:24:09,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:24:09,769 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:24:09,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:24:09,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:24:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:24:09,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:24:09,816 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-10 15:24:09,914 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-10 15:24:09,917 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-10 15:24:09,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-10 15:24:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:24:10,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331162682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:24:10,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:24:10,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 32 [2024-11-10 15:24:10,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462359199] [2024-11-10 15:24:10,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:24:10,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 15:24:10,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:24:10,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 15:24:10,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2024-11-10 15:24:10,162 INFO L87 Difference]: Start difference. First operand 371 states and 446 transitions. Second operand has 32 states, 31 states have (on average 3.806451612903226) internal successors, (118), 30 states have internal predecessors, (118), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-10 15:24:14,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:24:18,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:24:22,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:24:26,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:24:30,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:24:34,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:24:38,496 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]