./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 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-3289d67-m [2024-11-17 00:40:48,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:40:48,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:40:48,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:40:48,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:40:48,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:40:48,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:40:48,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:40:48,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:40:48,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:40:48,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:40:48,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:40:48,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:40:48,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:40:48,939 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:40:48,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:40:48,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:40:48,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:40:48,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:40:48,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:40:48,940 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:40:48,940 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:40:48,942 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:40:48,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:40:48,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:40:48,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:40:48,943 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:40:48,943 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:40:48,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:40:48,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:40:48,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:40:48,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:40:48,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:40:48,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:40:48,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:40:48,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:40:48,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:40:48,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:40:48,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:40:48,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:40:48,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:40:48,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:40:48,946 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-17 00:40:49,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:40:49,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:40:49,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:40:49,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:40:49,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:40:49,146 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-17 00:40:50,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:40:50,553 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:40:50,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-11-17 00:40:50,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/157a1ff8b/cfee023a768049f68056f19a5c908ada/FLAG5aac2ade0 [2024-11-17 00:40:50,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/157a1ff8b/cfee023a768049f68056f19a5c908ada [2024-11-17 00:40:50,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:40:50,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:40:50,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:40:50,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:40:50,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:40:50,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:50,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660bd233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50, skipping insertion in model container [2024-11-17 00:40:50,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:50,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:40:50,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:40:50,903 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:40:50,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:40:50,979 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:40:50,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50 WrapperNode [2024-11-17 00:40:50,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:40:50,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:40:50,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:40:50,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:40:50,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:50,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:51,018 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-11-17 00:40:51,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:40:51,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:40:51,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:40:51,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:40:51,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:51,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:51,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:51,069 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 18, 8, 6, 8]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 1, 0]. The 10 writes are split as follows [0, 7, 1, 1, 1]. [2024-11-17 00:40:51,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:51,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:51,076 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:51,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:51,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:51,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:51,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:40:51,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:40:51,086 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:40:51,086 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:40:51,087 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (1/1) ... [2024-11-17 00:40:51,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:40:51,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:40:51,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:40:51,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:40:51,145 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-17 00:40:51,145 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-17 00:40:51,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:40:51,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:40:51,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:40:51,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:40:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:40:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:40:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-17 00:40:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-17 00:40:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:40:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:40:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:40:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-17 00:40:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-17 00:40:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-11-17 00:40:51,146 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-11-17 00:40:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:40:51,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 00:40:51,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 00:40:51,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-17 00:40:51,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-17 00:40:51,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-17 00:40:51,148 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-11-17 00:40:51,148 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-11-17 00:40:51,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:40:51,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:40:51,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:40:51,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-17 00:40:51,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-17 00:40:51,148 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-11-17 00:40:51,149 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-11-17 00:40:51,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:40:51,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:40:51,272 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:40:51,274 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:40:51,629 INFO L1250 $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-17 00:40:51,629 INFO L1250 $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-17 00:40:51,658 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2024-11-17 00:40:51,658 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:40:51,677 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:40:51,678 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:40:51,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:40:51 BoogieIcfgContainer [2024-11-17 00:40:51,678 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:40:51,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:40:51,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:40:51,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:40:51,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:40:50" (1/3) ... [2024-11-17 00:40:51,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd1aafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:40:51, skipping insertion in model container [2024-11-17 00:40:51,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:50" (2/3) ... [2024-11-17 00:40:51,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd1aafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:40:51, skipping insertion in model container [2024-11-17 00:40:51,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:40:51" (3/3) ... [2024-11-17 00:40:51,686 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2024-11-17 00:40:51,699 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:40:51,699 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2024-11-17 00:40:51,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:40:51,745 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;@5d6a0098, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:40:51,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2024-11-17 00:40:51,748 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-17 00:40:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 00:40:51,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:51,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 00:40:51,753 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-17 00:40:51,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash 10157689, now seen corresponding path program 1 times [2024-11-17 00:40:51,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:51,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132104688] [2024-11-17 00:40:51,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:51,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:51,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-17 00:40:51,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:51,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132104688] [2024-11-17 00:40:51,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132104688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:40:51,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:40:51,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:40:51,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727044224] [2024-11-17 00:40:51,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:40:51,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:40:51,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:51,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:40:51,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:40:51,915 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-17 00:40:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:51,938 INFO L93 Difference]: Finished difference Result 246 states and 267 transitions. [2024-11-17 00:40:51,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:40:51,939 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-17 00:40:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:51,945 INFO L225 Difference]: With dead ends: 246 [2024-11-17 00:40:51,946 INFO L226 Difference]: Without dead ends: 243 [2024-11-17 00:40:51,947 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-17 00:40:51,949 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-17 00:40:51,949 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-17 00:40:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-17 00:40:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2024-11-17 00:40:51,982 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-17 00:40:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 264 transitions. [2024-11-17 00:40:51,988 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 264 transitions. Word has length 4 [2024-11-17 00:40:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:51,989 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 264 transitions. [2024-11-17 00:40:51,989 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-17 00:40:51,989 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 264 transitions. [2024-11-17 00:40:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:40:51,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:51,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:40:51,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:40:51,990 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-17 00:40:51,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1960380589, now seen corresponding path program 1 times [2024-11-17 00:40:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:51,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058157333] [2024-11-17 00:40:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:51,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:40:52,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:52,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058157333] [2024-11-17 00:40:52,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058157333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:40:52,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:40:52,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:40:52,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905605765] [2024-11-17 00:40:52,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:40:52,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:40:52,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:52,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:40:52,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:40:52,129 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-17 00:40:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:52,284 INFO L93 Difference]: Finished difference Result 241 states and 262 transitions. [2024-11-17 00:40:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:40:52,285 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-17 00:40:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:52,286 INFO L225 Difference]: With dead ends: 241 [2024-11-17 00:40:52,286 INFO L226 Difference]: Without dead ends: 241 [2024-11-17 00:40:52,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:40:52,287 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.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:40:52,287 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.1s Time] [2024-11-17 00:40:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-17 00:40:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-11-17 00:40:52,296 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-17 00:40:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 262 transitions. [2024-11-17 00:40:52,298 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 262 transitions. Word has length 7 [2024-11-17 00:40:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:52,299 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 262 transitions. [2024-11-17 00:40:52,299 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-17 00:40:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 262 transitions. [2024-11-17 00:40:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 00:40:52,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:52,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:40:52,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:40:52,300 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-17 00:40:52,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:52,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1960380590, now seen corresponding path program 1 times [2024-11-17 00:40:52,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:52,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552724341] [2024-11-17 00:40:52,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:52,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:40:52,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:52,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552724341] [2024-11-17 00:40:52,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552724341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:40:52,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:40:52,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:40:52,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942376082] [2024-11-17 00:40:52,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:40:52,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:40:52,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:40:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:40:52,398 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-17 00:40:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:52,495 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2024-11-17 00:40:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:40:52,495 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-17 00:40:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:52,496 INFO L225 Difference]: With dead ends: 239 [2024-11-17 00:40:52,496 INFO L226 Difference]: Without dead ends: 239 [2024-11-17 00:40:52,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:40:52,497 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-17 00:40:52,498 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-17 00:40:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-17 00:40:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-11-17 00:40:52,511 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-17 00:40:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 260 transitions. [2024-11-17 00:40:52,512 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 260 transitions. Word has length 7 [2024-11-17 00:40:52,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:52,512 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 260 transitions. [2024-11-17 00:40:52,512 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-17 00:40:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 260 transitions. [2024-11-17 00:40:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:40:52,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:52,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:40:52,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:40:52,517 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-17 00:40:52,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:52,517 INFO L85 PathProgramCache]: Analyzing trace with hash -627906103, now seen corresponding path program 1 times [2024-11-17 00:40:52,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:52,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436806541] [2024-11-17 00:40:52,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:52,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:40:52,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:52,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436806541] [2024-11-17 00:40:52,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436806541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:40:52,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:40:52,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:40:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501355692] [2024-11-17 00:40:52,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:40:52,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:40:52,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:52,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:40:52,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:40:52,686 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-17 00:40:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:52,885 INFO L93 Difference]: Finished difference Result 234 states and 255 transitions. [2024-11-17 00:40:52,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:40:52,886 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-17 00:40:52,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:52,887 INFO L225 Difference]: With dead ends: 234 [2024-11-17 00:40:52,887 INFO L226 Difference]: Without dead ends: 234 [2024-11-17 00:40:52,887 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-17 00:40:52,889 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-17 00:40:52,889 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-17 00:40:52,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-17 00:40:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-17 00:40:52,898 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-17 00:40:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 255 transitions. [2024-11-17 00:40:52,899 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 255 transitions. Word has length 11 [2024-11-17 00:40:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:52,900 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 255 transitions. [2024-11-17 00:40:52,900 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-17 00:40:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 255 transitions. [2024-11-17 00:40:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:40:52,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:52,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:40:52,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:40:52,901 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-17 00:40:52,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:52,901 INFO L85 PathProgramCache]: Analyzing trace with hash -627906102, now seen corresponding path program 1 times [2024-11-17 00:40:52,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:52,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805205026] [2024-11-17 00:40:52,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:52,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:40:53,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:53,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805205026] [2024-11-17 00:40:53,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805205026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:40:53,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:40:53,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:40:53,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912444848] [2024-11-17 00:40:53,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:40:53,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:40:53,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:40:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:40:53,074 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-17 00:40:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:53,278 INFO L93 Difference]: Finished difference Result 229 states and 250 transitions. [2024-11-17 00:40:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:40:53,278 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-17 00:40:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:53,279 INFO L225 Difference]: With dead ends: 229 [2024-11-17 00:40:53,280 INFO L226 Difference]: Without dead ends: 229 [2024-11-17 00:40:53,281 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-17 00:40:53,282 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-17 00:40:53,285 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-17 00:40:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-17 00:40:53,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-17 00:40:53,292 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-17 00:40:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 250 transitions. [2024-11-17 00:40:53,293 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 250 transitions. Word has length 11 [2024-11-17 00:40:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:53,293 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 250 transitions. [2024-11-17 00:40:53,293 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-17 00:40:53,293 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 250 transitions. [2024-11-17 00:40:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:40:53,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:53,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:40:53,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:40:53,294 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-17 00:40:53,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2009747261, now seen corresponding path program 1 times [2024-11-17 00:40:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:53,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805281151] [2024-11-17 00:40:53,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:53,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:40:53,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:53,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805281151] [2024-11-17 00:40:53,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805281151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:40:53,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:40:53,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:40:53,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502453301] [2024-11-17 00:40:53,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:40:53,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:40:53,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:53,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:40:53,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:40:53,346 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-17 00:40:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:53,494 INFO L93 Difference]: Finished difference Result 228 states and 249 transitions. [2024-11-17 00:40:53,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:40:53,494 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-17 00:40:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:53,495 INFO L225 Difference]: With dead ends: 228 [2024-11-17 00:40:53,496 INFO L226 Difference]: Without dead ends: 228 [2024-11-17 00:40:53,496 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-17 00:40:53,497 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-17 00:40:53,498 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-17 00:40:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-17 00:40:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-17 00:40:53,503 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-17 00:40:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 249 transitions. [2024-11-17 00:40:53,504 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 249 transitions. Word has length 12 [2024-11-17 00:40:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:53,505 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 249 transitions. [2024-11-17 00:40:53,505 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-17 00:40:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 249 transitions. [2024-11-17 00:40:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:40:53,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:53,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:40:53,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:40:53,506 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-17 00:40:53,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2009747262, now seen corresponding path program 1 times [2024-11-17 00:40:53,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:53,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465403715] [2024-11-17 00:40:53,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:53,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:40:53,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:53,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465403715] [2024-11-17 00:40:53,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465403715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:40:53,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:40:53,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:40:53,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34478748] [2024-11-17 00:40:53,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:40:53,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:40:53,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:53,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:40:53,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:40:53,614 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-17 00:40:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:53,761 INFO L93 Difference]: Finished difference Result 227 states and 248 transitions. [2024-11-17 00:40:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:40:53,761 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-17 00:40:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:53,762 INFO L225 Difference]: With dead ends: 227 [2024-11-17 00:40:53,762 INFO L226 Difference]: Without dead ends: 227 [2024-11-17 00:40:53,762 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-17 00:40:53,763 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-17 00:40:53,763 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-17 00:40:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-17 00:40:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-17 00:40:53,770 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-17 00:40:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 248 transitions. [2024-11-17 00:40:53,771 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 248 transitions. Word has length 12 [2024-11-17 00:40:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:53,771 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 248 transitions. [2024-11-17 00:40:53,772 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-17 00:40:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 248 transitions. [2024-11-17 00:40:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:40:53,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:53,773 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-17 00:40:53,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:40:53,773 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-17 00:40:53,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1547617006, now seen corresponding path program 1 times [2024-11-17 00:40:53,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:53,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075957356] [2024-11-17 00:40:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:53,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:53,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 00:40:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:40:54,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:54,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075957356] [2024-11-17 00:40:54,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075957356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:40:54,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:40:54,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:40:54,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391253997] [2024-11-17 00:40:54,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:40:54,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:40:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:54,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:40:54,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:40:54,025 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-17 00:40:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:54,431 INFO L93 Difference]: Finished difference Result 226 states and 247 transitions. [2024-11-17 00:40:54,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:40:54,431 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-17 00:40:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:54,432 INFO L225 Difference]: With dead ends: 226 [2024-11-17 00:40:54,432 INFO L226 Difference]: Without dead ends: 226 [2024-11-17 00:40:54,432 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-17 00:40:54,433 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-17 00:40:54,433 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-17 00:40:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-17 00:40:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-11-17 00:40:54,436 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-17 00:40:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 247 transitions. [2024-11-17 00:40:54,437 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 247 transitions. Word has length 20 [2024-11-17 00:40:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:54,438 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 247 transitions. [2024-11-17 00:40:54,438 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-17 00:40:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 247 transitions. [2024-11-17 00:40:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:40:54,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:54,439 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-17 00:40:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:40:54,439 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-17 00:40:54,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1547617007, now seen corresponding path program 1 times [2024-11-17 00:40:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569480019] [2024-11-17 00:40:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:54,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 00:40:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:40:54,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:54,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569480019] [2024-11-17 00:40:54,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569480019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:40:54,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:40:54,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:40:54,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797269790] [2024-11-17 00:40:54,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:40:54,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:40:54,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:54,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:40:54,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:40:54,675 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-17 00:40:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:54,944 INFO L93 Difference]: Finished difference Result 225 states and 246 transitions. [2024-11-17 00:40:54,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:40:54,944 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-17 00:40:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:54,945 INFO L225 Difference]: With dead ends: 225 [2024-11-17 00:40:54,945 INFO L226 Difference]: Without dead ends: 225 [2024-11-17 00:40:54,946 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-17 00:40:54,946 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.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:40:54,946 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.3s Time] [2024-11-17 00:40:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-17 00:40:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2024-11-17 00:40:54,950 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-17 00:40:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 246 transitions. [2024-11-17 00:40:54,951 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 246 transitions. Word has length 20 [2024-11-17 00:40:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:54,952 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 246 transitions. [2024-11-17 00:40:54,952 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-17 00:40:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 246 transitions. [2024-11-17 00:40:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 00:40:54,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:54,953 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-17 00:40:54,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:40:54,953 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-17 00:40:54,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:54,954 INFO L85 PathProgramCache]: Analyzing trace with hash -205352600, now seen corresponding path program 1 times [2024-11-17 00:40:54,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:54,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784006900] [2024-11-17 00:40:54,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:54,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:55,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 00:40:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:55,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-17 00:40:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:55,302 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-17 00:40:55,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:55,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784006900] [2024-11-17 00:40:55,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784006900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:40:55,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549952409] [2024-11-17 00:40:55,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:55,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:40:55,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:40:55,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:40:55,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:40:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:55,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-17 00:40:55,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:40:55,500 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2024-11-17 00:40:55,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 12 [2024-11-17 00:40:55,520 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:40:55,520 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 1 case distinctions, treesize of input 11 treesize of output 9 [2024-11-17 00:40:55,568 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#valid| |chain_node_alloc_node_~ptr~0#1.base|))))) is different from true [2024-11-17 00:40:55,656 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-17 00:40:55,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 31 [2024-11-17 00:40:55,810 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-17 00:40:55,848 INFO L349 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2024-11-17 00:40:55,848 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-17 00:40:55,930 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-17 00:40:55,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:40:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549952409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:40:56,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:40:56,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2024-11-17 00:40:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313744790] [2024-11-17 00:40:56,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:40:56,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 00:40:56,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:56,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 00:40:56,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=441, Unknown=2, NotChecked=90, Total=650 [2024-11-17 00:40:56,330 INFO L87 Difference]: Start difference. First operand 225 states and 246 transitions. Second operand has 18 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:40:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:57,107 INFO L93 Difference]: Finished difference Result 224 states and 245 transitions. [2024-11-17 00:40:57,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:40:57,107 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2024-11-17 00:40:57,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:57,108 INFO L225 Difference]: With dead ends: 224 [2024-11-17 00:40:57,108 INFO L226 Difference]: Without dead ends: 224 [2024-11-17 00:40:57,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=696, Unknown=2, NotChecked=114, Total=992 [2024-11-17 00:40:57,109 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 189 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 475 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:40:57,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1089 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1242 Invalid, 0 Unknown, 475 Unchecked, 0.6s Time] [2024-11-17 00:40:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-17 00:40:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-17 00:40:57,112 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-17 00:40:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 245 transitions. [2024-11-17 00:40:57,113 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 245 transitions. Word has length 39 [2024-11-17 00:40:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:57,113 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 245 transitions. [2024-11-17 00:40:57,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:40:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 245 transitions. [2024-11-17 00:40:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 00:40:57,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:57,118 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-17 00:40:57,132 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-17 00:40:57,318 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-17 00:40:57,319 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-17 00:40:57,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash -205352599, now seen corresponding path program 1 times [2024-11-17 00:40:57,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:57,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490584869] [2024-11-17 00:40:57,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:57,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:57,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 00:40:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:57,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-17 00:40:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:57,778 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-17 00:40:57,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:57,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490584869] [2024-11-17 00:40:57,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490584869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:40:57,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:40:57,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:40:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863317549] [2024-11-17 00:40:57,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:40:57,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:40:57,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:57,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:40:57,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:40:57,780 INFO L87 Difference]: Start difference. First operand 224 states and 245 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:40:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:58,209 INFO L93 Difference]: Finished difference Result 227 states and 250 transitions. [2024-11-17 00:40:58,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:40:58,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-11-17 00:40:58,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:58,212 INFO L225 Difference]: With dead ends: 227 [2024-11-17 00:40:58,212 INFO L226 Difference]: Without dead ends: 227 [2024-11-17 00:40:58,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:40:58,212 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 70 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:40:58,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 510 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:40:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-17 00:40:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2024-11-17 00:40:58,216 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-17 00:40:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 244 transitions. [2024-11-17 00:40:58,217 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 244 transitions. Word has length 39 [2024-11-17 00:40:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:58,217 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 244 transitions. [2024-11-17 00:40:58,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:40:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 244 transitions. [2024-11-17 00:40:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-17 00:40:58,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:58,218 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-17 00:40:58,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:40:58,219 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-17 00:40:58,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1528156039, now seen corresponding path program 1 times [2024-11-17 00:40:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:58,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942784940] [2024-11-17 00:40:58,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:58,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 00:40:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:58,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-17 00:40:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:58,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-17 00:40:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:58,545 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-17 00:40:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:58,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942784940] [2024-11-17 00:40:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942784940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:40:58,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:40:58,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:40:58,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347212624] [2024-11-17 00:40:58,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:40:58,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:40:58,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:58,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:40:58,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:40:58,548 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-17 00:40:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:58,978 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2024-11-17 00:40:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:40:58,979 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-17 00:40:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:58,980 INFO L225 Difference]: With dead ends: 230 [2024-11-17 00:40:58,980 INFO L226 Difference]: Without dead ends: 230 [2024-11-17 00:40:58,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:40:58,980 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-17 00:40:58,980 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-17 00:40:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-17 00:40:58,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 216. [2024-11-17 00:40:58,985 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-17 00:40:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 237 transitions. [2024-11-17 00:40:58,986 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 237 transitions. Word has length 62 [2024-11-17 00:40:58,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:58,987 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 237 transitions. [2024-11-17 00:40:58,988 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-17 00:40:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 237 transitions. [2024-11-17 00:40:58,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-17 00:40:58,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:58,988 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-17 00:40:58,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:40:58,989 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-17 00:40:58,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:58,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1528156040, now seen corresponding path program 1 times [2024-11-17 00:40:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:58,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961789090] [2024-11-17 00:40:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:58,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:59,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 00:40:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:59,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-17 00:40:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:59,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-17 00:40:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:40:59,289 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-17 00:40:59,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:40:59,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961789090] [2024-11-17 00:40:59,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961789090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:40:59,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:40:59,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:40:59,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933028962] [2024-11-17 00:40:59,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:40:59,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:40:59,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:40:59,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:40:59,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:40:59,291 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-17 00:40:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:40:59,906 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2024-11-17 00:40:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:40:59,906 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-17 00:40:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:40:59,907 INFO L225 Difference]: With dead ends: 334 [2024-11-17 00:40:59,907 INFO L226 Difference]: Without dead ends: 334 [2024-11-17 00:40:59,907 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-17 00:40:59,908 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 165 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:40:59,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 565 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:40:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-17 00:40:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 287. [2024-11-17 00:40:59,916 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-17 00:40:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2024-11-17 00:40:59,917 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 62 [2024-11-17 00:40:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:40:59,918 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2024-11-17 00:40:59,918 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-17 00:40:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2024-11-17 00:40:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-17 00:40:59,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:40:59,920 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-17 00:40:59,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:40:59,921 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-17 00:40:59,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:40:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash 128197173, now seen corresponding path program 1 times [2024-11-17 00:40:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:40:59,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314014003] [2024-11-17 00:40:59,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:40:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:40:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:00,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 00:41:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:00,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-17 00:41:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:00,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-17 00:41:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:00,293 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-17 00:41:00,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:00,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314014003] [2024-11-17 00:41:00,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314014003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:00,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:00,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:41:00,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296227923] [2024-11-17 00:41:00,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:00,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:41:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:00,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:41:00,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:41:00,296 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-17 00:41:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:00,748 INFO L93 Difference]: Finished difference Result 294 states and 354 transitions. [2024-11-17 00:41:00,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:41:00,748 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-17 00:41:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:00,749 INFO L225 Difference]: With dead ends: 294 [2024-11-17 00:41:00,750 INFO L226 Difference]: Without dead ends: 294 [2024-11-17 00:41:00,750 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-17 00:41:00,750 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 180 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:00,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 510 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:41:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-17 00:41:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 280. [2024-11-17 00:41:00,754 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-17 00:41:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 339 transitions. [2024-11-17 00:41:00,755 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 339 transitions. Word has length 63 [2024-11-17 00:41:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:00,755 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 339 transitions. [2024-11-17 00:41:00,756 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-17 00:41:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 339 transitions. [2024-11-17 00:41:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-17 00:41:00,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:00,756 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-17 00:41:00,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:41:00,757 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-17 00:41:00,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash 128197174, now seen corresponding path program 1 times [2024-11-17 00:41:00,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:00,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141904849] [2024-11-17 00:41:00,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:00,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:01,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 00:41:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:01,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-17 00:41:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:01,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-17 00:41:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:01,140 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-17 00:41:01,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141904849] [2024-11-17 00:41:01,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141904849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:41:01,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:41:01,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:41:01,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235541948] [2024-11-17 00:41:01,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:41:01,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:41:01,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:01,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:41:01,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:41:01,143 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-17 00:41:01,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:01,510 INFO L93 Difference]: Finished difference Result 277 states and 332 transitions. [2024-11-17 00:41:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:41:01,510 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-17 00:41:01,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:01,511 INFO L225 Difference]: With dead ends: 277 [2024-11-17 00:41:01,511 INFO L226 Difference]: Without dead ends: 277 [2024-11-17 00:41:01,511 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-17 00:41:01,512 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 402 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:01,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 345 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:41:01,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-17 00:41:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2024-11-17 00:41:01,516 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-17 00:41:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 326 transitions. [2024-11-17 00:41:01,517 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 326 transitions. Word has length 63 [2024-11-17 00:41:01,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:01,517 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 326 transitions. [2024-11-17 00:41:01,517 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-17 00:41:01,518 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 326 transitions. [2024-11-17 00:41:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-17 00:41:01,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:01,518 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-17 00:41:01,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:41:01,519 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-17 00:41:01,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash -514502767, now seen corresponding path program 1 times [2024-11-17 00:41:01,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:01,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54820904] [2024-11-17 00:41:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:01,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:01,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 00:41:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-17 00:41:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:01,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-17 00:41:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:01,887 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-17 00:41:01,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54820904] [2024-11-17 00:41:01,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54820904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:41:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856119250] [2024-11-17 00:41:01,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:01,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:41:01,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:41:01,891 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:41:01,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:41:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:02,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-17 00:41:02,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:41:02,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:41:02,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-17 00:41:02,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:41:02,487 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:02,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:41:02,489 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-17 00:41:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:41:02,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:41:02,523 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-17 00:41:02,646 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-17 00:41:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:41:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856119250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:41:02,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:41:02,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 27 [2024-11-17 00:41:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574346466] [2024-11-17 00:41:02,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:41:02,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-17 00:41:02,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:02,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-17 00:41:02,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2024-11-17 00:41:02,805 INFO L87 Difference]: Start difference. First operand 273 states and 326 transitions. Second operand has 27 states, 27 states have (on average 4.333333333333333) internal successors, (117), 25 states have internal predecessors, (117), 9 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-17 00:41:06,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:41:10,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:41:14,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:41:18,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:41:22,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:41:27,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:41:31,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:41:35,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:41:39,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:41:43,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:41:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:44,148 INFO L93 Difference]: Finished difference Result 321 states and 376 transitions. [2024-11-17 00:41:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-17 00:41:44,149 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.333333333333333) internal successors, (117), 25 states have internal predecessors, (117), 9 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 71 [2024-11-17 00:41:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:44,150 INFO L225 Difference]: With dead ends: 321 [2024-11-17 00:41:44,150 INFO L226 Difference]: Without dead ends: 321 [2024-11-17 00:41:44,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=2013, Unknown=0, NotChecked=0, Total=2256 [2024-11-17 00:41:44,151 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 345 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 43 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:44,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 2183 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2088 Invalid, 10 Unknown, 0 Unchecked, 41.0s Time] [2024-11-17 00:41:44,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-17 00:41:44,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 303. [2024-11-17 00:41:44,155 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-17 00:41:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 361 transitions. [2024-11-17 00:41:44,156 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 361 transitions. Word has length 71 [2024-11-17 00:41:44,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:44,157 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 361 transitions. [2024-11-17 00:41:44,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.333333333333333) internal successors, (117), 25 states have internal predecessors, (117), 9 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-17 00:41:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 361 transitions. [2024-11-17 00:41:44,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 00:41:44,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:41:44,172 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-17 00:41:44,358 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-17 00:41:44,359 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-17 00:41:44,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1028832652, now seen corresponding path program 1 times [2024-11-17 00:41:44,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:44,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878111156] [2024-11-17 00:41:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:44,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:44,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 00:41:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-17 00:41:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:45,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-17 00:41:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:45,165 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-17 00:41:45,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878111156] [2024-11-17 00:41:45,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878111156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:41:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790703271] [2024-11-17 00:41:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:45,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:41:45,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:41:45,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:41:45,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:41:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:45,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-17 00:41:45,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:41:45,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:41:45,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:41:45,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:45,724 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-17 00:41:45,730 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:45,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:41:45,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2024-11-17 00:41:45,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:41:45,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:41:45,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 00:41:45,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-17 00:41:45,899 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$#2.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-17 00:41:45,973 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:41:45,973 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-17 00:41:45,981 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-17 00:41:46,118 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:46,119 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-17 00:41:46,122 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:46,123 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:46,127 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2024-11-17 00:41:46,127 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-17 00:41:46,205 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-17 00:41:46,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:41:46,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790703271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:41:46,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:41:46,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2024-11-17 00:41:46,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022627598] [2024-11-17 00:41:46,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:41:46,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-17 00:41:46,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:46,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-17 00:41:46,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1303, Unknown=1, NotChecked=72, Total=1482 [2024-11-17 00:41:46,442 INFO L87 Difference]: Start difference. First operand 303 states and 361 transitions. Second operand has 34 states, 33 states have (on average 3.606060606060606) internal successors, (119), 30 states have internal predecessors, (119), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:41:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:49,298 INFO L93 Difference]: Finished difference Result 428 states and 474 transitions. [2024-11-17 00:41:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-17 00:41:49,298 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.606060606060606) internal successors, (119), 30 states have internal predecessors, (119), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 72 [2024-11-17 00:41:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:49,300 INFO L225 Difference]: With dead ends: 428 [2024-11-17 00:41:49,300 INFO L226 Difference]: Without dead ends: 428 [2024-11-17 00:41:49,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=3389, Unknown=1, NotChecked=118, Total=3782 [2024-11-17 00:41:49,301 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 560 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 3841 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 4360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:49,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 2159 Invalid, 4360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3841 Invalid, 0 Unknown, 428 Unchecked, 2.0s Time] [2024-11-17 00:41:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-17 00:41:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 371. [2024-11-17 00:41:49,310 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-17 00:41:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 448 transitions. [2024-11-17 00:41:49,311 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 448 transitions. Word has length 72 [2024-11-17 00:41:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:49,312 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 448 transitions. [2024-11-17 00:41:49,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.606060606060606) internal successors, (119), 30 states have internal predecessors, (119), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:41:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 448 transitions. [2024-11-17 00:41:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 00:41:49,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:49,313 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-17 00:41:49,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 00:41:49,513 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-17 00:41:49,514 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-17 00:41:49,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:49,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1028832651, now seen corresponding path program 1 times [2024-11-17 00:41:49,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:49,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750477310] [2024-11-17 00:41:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:49,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:49,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 00:41:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:49,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-17 00:41:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:50,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-17 00:41:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:50,148 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-17 00:41:50,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750477310] [2024-11-17 00:41:50,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750477310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:41:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452338845] [2024-11-17 00:41:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:50,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:41:50,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:41:50,150 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:41:50,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:41:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:50,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-17 00:41:50,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:41:50,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:41:50,675 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-17 00:41:50,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-11-17 00:41:50,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-17 00:41:50,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:41:50,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:41:50,837 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#valid| |chain_node_alloc_node_~ptr~0#1.base|))))) is different from true [2024-11-17 00:41:50,879 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-17 00:41:50,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-17 00:41:50,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-17 00:41:50,972 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:50,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:41:50,974 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-17 00:41:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2024-11-17 00:41:50,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:41:51,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452338845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:41:51,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:41:51,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2024-11-17 00:41:51,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041893482] [2024-11-17 00:41:51,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:41:51,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-17 00:41:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:51,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-17 00:41:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=959, Unknown=1, NotChecked=62, Total=1122 [2024-11-17 00:41:51,068 INFO L87 Difference]: Start difference. First operand 371 states and 448 transitions. Second operand has 33 states, 32 states have (on average 3.75) internal successors, (120), 30 states have internal predecessors, (120), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:41:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:41:52,402 INFO L93 Difference]: Finished difference Result 378 states and 451 transitions. [2024-11-17 00:41:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:41:52,402 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.75) internal successors, (120), 30 states have internal predecessors, (120), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 72 [2024-11-17 00:41:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:41:52,404 INFO L225 Difference]: With dead ends: 378 [2024-11-17 00:41:52,404 INFO L226 Difference]: Without dead ends: 378 [2024-11-17 00:41:52,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=1714, Unknown=1, NotChecked=84, Total=1980 [2024-11-17 00:41:52,405 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 376 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 2698 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:41:52,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1525 Invalid, 2992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2698 Invalid, 0 Unknown, 240 Unchecked, 1.0s Time] [2024-11-17 00:41:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-17 00:41:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 371. [2024-11-17 00:41:52,413 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-17 00:41:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 446 transitions. [2024-11-17 00:41:52,414 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 446 transitions. Word has length 72 [2024-11-17 00:41:52,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:41:52,414 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 446 transitions. [2024-11-17 00:41:52,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.75) internal successors, (120), 30 states have internal predecessors, (120), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:41:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 446 transitions. [2024-11-17 00:41:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-17 00:41:52,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:41:52,415 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-17 00:41:52,430 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-17 00:41:52,615 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-17 00:41:52,616 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-17 00:41:52,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:41:52,616 INFO L85 PathProgramCache]: Analyzing trace with hash 872355318, now seen corresponding path program 1 times [2024-11-17 00:41:52,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:41:52,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57707197] [2024-11-17 00:41:52,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:52,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:41:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:52,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 00:41:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-17 00:41:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:52,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-17 00:41:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:52,965 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-17 00:41:52,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:41:52,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57707197] [2024-11-17 00:41:52,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57707197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:41:52,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45885107] [2024-11-17 00:41:52,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:41:52,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:41:52,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:41:52,967 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:41:52,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:41:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:41:53,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-17 00:41:53,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:41:53,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:41:53,287 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 11 [2024-11-17 00:41:53,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-17 00:41:53,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-17 00:41:53,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:53,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:41:53,584 INFO L349 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2024-11-17 00:41:53,584 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 24 treesize of output 23 [2024-11-17 00:41:53,591 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-17 00:41:53,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:41:53,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-17 00:41:53,879 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-17 00:41:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:41:53,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45885107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:41:53,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:41:53,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 32 [2024-11-17 00:41:53,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917059033] [2024-11-17 00:41:53,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:41:53,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-17 00:41:53,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:41:53,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-17 00:41:53,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2024-11-17 00:41:53,991 INFO L87 Difference]: Start difference. First operand 371 states and 446 transitions. Second operand has 32 states, 31 states have (on average 4.258064516129032) internal successors, (132), 30 states have internal predecessors, (132), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-17 00:41:58,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:42:02,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:42:06,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:42:10,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:42:14,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:42:18,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:42:22,089 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, 1] [2024-11-17 00:42:26,100 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, 1]