./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 18:10:36,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:10:36,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:10:36,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:10:36,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:10:36,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:10:36,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:10:36,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:10:36,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:10:36,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:10:36,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:10:36,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:10:36,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:10:36,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:10:36,798 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:10:36,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:10:36,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:10:36,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:10:36,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:10:36,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:10:36,801 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:10:36,801 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:10:36,801 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:10:36,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:10:36,801 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:10:36,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:10:36,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:10:36,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:10:36,802 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:10:36,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:10:36,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:10:36,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:10:36,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:10:36,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:10:36,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:10:36,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:10:36,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:10:36,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:10:36,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:10:36,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:10:36,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:10:36,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:10:36,805 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-clean/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-clean/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-10-11 18:10:37,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:10:37,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:10:37,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:10:37,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:10:37,068 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:10:37,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-10-11 18:10:38,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:10:38,693 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:10:38,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-10-11 18:10:38,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e5c6635de/d582967a0bd94fa9a37399005d7adbef/FLAG130f471c6 [2024-10-11 18:10:39,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e5c6635de/d582967a0bd94fa9a37399005d7adbef [2024-10-11 18:10:39,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:10:39,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:10:39,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:10:39,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:10:39,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:10:39,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44be046c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39, skipping insertion in model container [2024-10-11 18:10:39,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:10:39,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:10:39,477 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:10:39,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:10:39,547 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:10:39,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39 WrapperNode [2024-10-11 18:10:39,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:10:39,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:10:39,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:10:39,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:10:39,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,593 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2024-10-11 18:10:39,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:10:39,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:10:39,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:10:39,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:10:39,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,645 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 6, 18, 8, 8]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0, 0]. The 10 writes are split as follows [0, 1, 7, 1, 1]. [2024-10-11 18:10:39,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:10:39,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:10:39,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:10:39,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:10:39,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:10:39,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:39,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:10:39,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:10:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-11 18:10:39,786 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-11 18:10:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:10:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:10:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:10:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:10:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:10:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:10:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 18:10:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 18:10:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:10:39,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:10:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:10:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 18:10:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 18:10:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-10-11 18:10:39,790 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-10-11 18:10:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:10:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:10:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:10:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:10:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 18:10:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 18:10:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-10-11 18:10:39,791 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-10-11 18:10:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:10:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:10:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 18:10:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 18:10:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 18:10:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-10-11 18:10:39,791 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-10-11 18:10:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:10:39,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:10:39,959 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:10:39,961 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:10:40,429 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2024-10-11 18:10:40,429 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:10:40,490 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:10:40,493 INFO L314 CfgBuilder]: Removed 33 assume(true) statements. [2024-10-11 18:10:40,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:10:40 BoogieIcfgContainer [2024-10-11 18:10:40,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:10:40,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:10:40,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:10:40,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:10:40,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:10:39" (1/3) ... [2024-10-11 18:10:40,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd5b6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:10:40, skipping insertion in model container [2024-10-11 18:10:40,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (2/3) ... [2024-10-11 18:10:40,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd5b6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:10:40, skipping insertion in model container [2024-10-11 18:10:40,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:10:40" (3/3) ... [2024-10-11 18:10:40,501 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2024-10-11 18:10:40,516 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:10:40,517 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2024-10-11 18:10:40,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:10:40,570 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;@2869af0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:10:40,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2024-10-11 18:10:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 100 states have (on average 2.32) internal successors, (232), 188 states have internal predecessors, (232), 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-10-11 18:10:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:10:40,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:40,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:10:40,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:40,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash 549208, now seen corresponding path program 1 times [2024-10-11 18:10:40,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:40,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130100947] [2024-10-11 18:10:40,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:40,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:40,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:40,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130100947] [2024-10-11 18:10:40,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130100947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:40,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:40,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:10:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008787247] [2024-10-11 18:10:40,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:40,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 18:10:40,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:40,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 18:10:40,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 18:10:40,763 INFO L87 Difference]: Start difference. First operand has 202 states, 100 states have (on average 2.32) internal successors, (232), 188 states have internal predecessors, (232), 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 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-11 18:10:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:40,833 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2024-10-11 18:10:40,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 18:10:40,836 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-11 18:10:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:40,843 INFO L225 Difference]: With dead ends: 200 [2024-10-11 18:10:40,843 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 18:10:40,845 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-10-11 18:10:40,847 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:40,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:10:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 18:10:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-10-11 18:10:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 185 states have internal predecessors, (194), 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-10-11 18:10:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2024-10-11 18:10:40,892 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 3 [2024-10-11 18:10:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:40,893 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2024-10-11 18:10:40,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-11 18:10:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2024-10-11 18:10:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:10:40,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:40,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:10:40,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:10:40,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:40,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:40,894 INFO L85 PathProgramCache]: Analyzing trace with hash 536446700, now seen corresponding path program 1 times [2024-10-11 18:10:40,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:40,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847006565] [2024-10-11 18:10:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:40,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:41,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:41,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847006565] [2024-10-11 18:10:41,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847006565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:41,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:41,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:10:41,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87891138] [2024-10-11 18:10:41,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:41,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:10:41,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:41,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:10:41,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:41,025 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 18:10:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:41,233 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2024-10-11 18:10:41,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:10:41,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-11 18:10:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:41,235 INFO L225 Difference]: With dead ends: 197 [2024-10-11 18:10:41,235 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 18:10:41,235 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-10-11 18:10:41,236 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:41,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 328 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 18:10:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-10-11 18:10:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 2.0) internal successors, (192), 183 states have internal predecessors, (192), 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-10-11 18:10:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2024-10-11 18:10:41,248 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 5 [2024-10-11 18:10:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:41,248 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2024-10-11 18:10:41,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 18:10:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2024-10-11 18:10:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:10:41,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:41,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:10:41,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:10:41,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:41,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:41,251 INFO L85 PathProgramCache]: Analyzing trace with hash 536446701, now seen corresponding path program 1 times [2024-10-11 18:10:41,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:41,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027638935] [2024-10-11 18:10:41,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:41,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:41,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027638935] [2024-10-11 18:10:41,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027638935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:41,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:41,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:10:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670517166] [2024-10-11 18:10:41,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:10:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:41,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:10:41,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:41,368 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 18:10:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:41,503 INFO L93 Difference]: Finished difference Result 195 states and 216 transitions. [2024-10-11 18:10:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:10:41,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-11 18:10:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:41,505 INFO L225 Difference]: With dead ends: 195 [2024-10-11 18:10:41,505 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 18:10:41,506 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-10-11 18:10:41,507 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:41,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 332 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 18:10:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-10-11 18:10:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 96 states have (on average 1.9791666666666667) internal successors, (190), 181 states have internal predecessors, (190), 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-10-11 18:10:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2024-10-11 18:10:41,527 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 5 [2024-10-11 18:10:41,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:41,527 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2024-10-11 18:10:41,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 18:10:41,527 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2024-10-11 18:10:41,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:10:41,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:41,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:41,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:10:41,528 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-10-11 18:10:41,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash 129218263, now seen corresponding path program 1 times [2024-10-11 18:10:41,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:41,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533829268] [2024-10-11 18:10:41,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:41,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:41,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:41,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533829268] [2024-10-11 18:10:41,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533829268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:41,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:41,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:10:41,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866344170] [2024-10-11 18:10:41,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:41,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:10:41,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:41,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:10:41,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:41,704 INFO L87 Difference]: Start difference. First operand 195 states and 216 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 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-10-11 18:10:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:41,931 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2024-10-11 18:10:41,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:10:41,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 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-10-11 18:10:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:41,934 INFO L225 Difference]: With dead ends: 190 [2024-10-11 18:10:41,934 INFO L226 Difference]: Without dead ends: 190 [2024-10-11 18:10:41,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10-11 18:10:41,935 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 32 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:41,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 651 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-11 18:10:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-10-11 18:10:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 96 states have (on average 1.9270833333333333) internal successors, (185), 176 states have internal predecessors, (185), 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-10-11 18:10:41,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 211 transitions. [2024-10-11 18:10:41,953 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 211 transitions. Word has length 7 [2024-10-11 18:10:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:41,953 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 211 transitions. [2024-10-11 18:10:41,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 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-10-11 18:10:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 211 transitions. [2024-10-11 18:10:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:10:41,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:41,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:41,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:10:41,954 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-10-11 18:10:41,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash 129218264, now seen corresponding path program 1 times [2024-10-11 18:10:41,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:41,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197731852] [2024-10-11 18:10:41,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:41,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:42,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:42,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:42,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197731852] [2024-10-11 18:10:42,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197731852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:42,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:42,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:10:42,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72773879] [2024-10-11 18:10:42,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:42,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:42,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:42,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:42,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:42,160 INFO L87 Difference]: Start difference. First operand 190 states and 211 transitions. Second operand has 5 states, 3 states have (on average 2.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-10-11 18:10:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:42,406 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2024-10-11 18:10:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:10:42,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.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-10-11 18:10:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:42,408 INFO L225 Difference]: With dead ends: 185 [2024-10-11 18:10:42,408 INFO L226 Difference]: Without dead ends: 185 [2024-10-11 18:10:42,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-10-11 18:10:42,409 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 29 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:42,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 468 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-11 18:10:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-10-11 18:10:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 1.875) internal successors, (180), 171 states have internal predecessors, (180), 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-10-11 18:10:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 206 transitions. [2024-10-11 18:10:42,415 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 206 transitions. Word has length 7 [2024-10-11 18:10:42,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:42,415 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 206 transitions. [2024-10-11 18:10:42,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.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-10-11 18:10:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 206 transitions. [2024-10-11 18:10:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:10:42,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:42,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:42,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:10:42,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:42,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:42,417 INFO L85 PathProgramCache]: Analyzing trace with hash -289201154, now seen corresponding path program 1 times [2024-10-11 18:10:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:42,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172393853] [2024-10-11 18:10:42,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:42,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:42,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172393853] [2024-10-11 18:10:42,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172393853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:42,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:42,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:10:42,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617493571] [2024-10-11 18:10:42,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:42,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:10:42,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:42,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:10:42,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:10:42,465 INFO L87 Difference]: Start difference. First operand 185 states and 206 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:42,580 INFO L93 Difference]: Finished difference Result 184 states and 205 transitions. [2024-10-11 18:10:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:10:42,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:10:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:42,581 INFO L225 Difference]: With dead ends: 184 [2024-10-11 18:10:42,581 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 18:10:42,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:10:42,583 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 2 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:42,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 436 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 18:10:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-10-11 18:10:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 170 states have internal predecessors, (179), 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-10-11 18:10:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 205 transitions. [2024-10-11 18:10:42,594 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 205 transitions. Word has length 8 [2024-10-11 18:10:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:42,594 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 205 transitions. [2024-10-11 18:10:42,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 205 transitions. [2024-10-11 18:10:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:10:42,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:42,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:42,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:10:42,595 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:42,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:42,596 INFO L85 PathProgramCache]: Analyzing trace with hash -289201153, now seen corresponding path program 1 times [2024-10-11 18:10:42,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:42,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665417678] [2024-10-11 18:10:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:42,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665417678] [2024-10-11 18:10:42,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665417678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:42,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:42,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:10:42,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20589905] [2024-10-11 18:10:42,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:42,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:10:42,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:42,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:10:42,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:10:42,686 INFO L87 Difference]: Start difference. First operand 184 states and 205 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:42,775 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2024-10-11 18:10:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:10:42,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:10:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:42,776 INFO L225 Difference]: With dead ends: 183 [2024-10-11 18:10:42,776 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 18:10:42,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:10:42,777 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:42,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 494 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 18:10:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-10-11 18:10:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 96 states have (on average 1.8541666666666667) internal successors, (178), 169 states have internal predecessors, (178), 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-10-11 18:10:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 204 transitions. [2024-10-11 18:10:42,784 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 204 transitions. Word has length 8 [2024-10-11 18:10:42,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:42,784 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 204 transitions. [2024-10-11 18:10:42,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 204 transitions. [2024-10-11 18:10:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:10:42,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:42,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:42,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:10:42,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:42,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:42,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1489948223, now seen corresponding path program 1 times [2024-10-11 18:10:42,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:42,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973677951] [2024-10-11 18:10:42,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:42,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:42,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:10:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:43,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:43,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973677951] [2024-10-11 18:10:43,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973677951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:43,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:43,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:43,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008194658] [2024-10-11 18:10:43,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:43,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:10:43,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:43,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:10:43,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:10:43,082 INFO L87 Difference]: Start difference. First operand 183 states and 204 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:10:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:43,426 INFO L93 Difference]: Finished difference Result 182 states and 203 transitions. [2024-10-11 18:10:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:43,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 18:10:43,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:43,427 INFO L225 Difference]: With dead ends: 182 [2024-10-11 18:10:43,427 INFO L226 Difference]: Without dead ends: 182 [2024-10-11 18:10:43,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:10:43,428 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 91 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:43,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 416 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:10:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-11 18:10:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-10-11 18:10:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 96 states have (on average 1.84375) internal successors, (177), 168 states have internal predecessors, (177), 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-10-11 18:10:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 203 transitions. [2024-10-11 18:10:43,433 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 203 transitions. Word has length 14 [2024-10-11 18:10:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:43,438 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 203 transitions. [2024-10-11 18:10:43,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:10:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 203 transitions. [2024-10-11 18:10:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:10:43,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:43,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:43,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:10:43,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:43,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:43,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1489948224, now seen corresponding path program 1 times [2024-10-11 18:10:43,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:43,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090738543] [2024-10-11 18:10:43,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:43,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:43,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:10:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:43,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:43,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090738543] [2024-10-11 18:10:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090738543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:43,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:43,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:10:43,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243653904] [2024-10-11 18:10:43,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:43,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:10:43,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:43,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:10:43,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:43,738 INFO L87 Difference]: Start difference. First operand 182 states and 203 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:10:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:44,002 INFO L93 Difference]: Finished difference Result 181 states and 202 transitions. [2024-10-11 18:10:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:44,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 18:10:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:44,007 INFO L225 Difference]: With dead ends: 181 [2024-10-11 18:10:44,008 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 18:10:44,008 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-10-11 18:10:44,008 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 89 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:44,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 283 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:10:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 18:10:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-11 18:10:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.8333333333333333) internal successors, (176), 167 states have internal predecessors, (176), 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-10-11 18:10:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 202 transitions. [2024-10-11 18:10:44,016 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 202 transitions. Word has length 14 [2024-10-11 18:10:44,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:44,016 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 202 transitions. [2024-10-11 18:10:44,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:10:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 202 transitions. [2024-10-11 18:10:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:10:44,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:44,021 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:44,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:10:44,021 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:44,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:44,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1763510803, now seen corresponding path program 1 times [2024-10-11 18:10:44,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:44,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745263393] [2024-10-11 18:10:44,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:10:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:10:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:10:44,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:44,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745263393] [2024-10-11 18:10:44,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745263393] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436800739] [2024-10-11 18:10:44,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:44,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:44,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:44,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:10:44,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:10:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 18:10:44,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:10:44,695 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:10:44,696 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-10-11 18:10:44,721 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2024-10-11 18:10:44,722 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-10-11 18:10:44,803 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-10-11 18:10:44,843 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-11 18:10:44,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2024-10-11 18:10:45,232 INFO L349 Elim1Store]: treesize reduction 50, result has 71.6 percent of original size [2024-10-11 18:10:45,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 44 treesize of output 156 [2024-10-11 18:10:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:10:52,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:10:52,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436800739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:52,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:10:52,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2024-10-11 18:10:52,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126081844] [2024-10-11 18:10:52,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:52,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:10:52,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:10:52,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=188, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:10:52,724 INFO L87 Difference]: Start difference. First operand 181 states and 202 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-10-11 18:10:53,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:53,094 INFO L93 Difference]: Finished difference Result 181 states and 203 transitions. [2024-10-11 18:10:53,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:10:53,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 27 [2024-10-11 18:10:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:53,097 INFO L225 Difference]: With dead ends: 181 [2024-10-11 18:10:53,097 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 18:10:53,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=217, Unknown=1, NotChecked=30, Total=306 [2024-10-11 18:10:53,098 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 133 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:53,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 409 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 452 Invalid, 0 Unknown, 225 Unchecked, 0.3s Time] [2024-10-11 18:10:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 18:10:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2024-10-11 18:10:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 96 states have (on average 1.8229166666666667) internal successors, (175), 166 states have internal predecessors, (175), 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-10-11 18:10:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 201 transitions. [2024-10-11 18:10:53,107 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 201 transitions. Word has length 27 [2024-10-11 18:10:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:53,107 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 201 transitions. [2024-10-11 18:10:53,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-10-11 18:10:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 201 transitions. [2024-10-11 18:10:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:10:53,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:53,109 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:53,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:10:53,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 18:10:53,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:53,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:53,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1763510802, now seen corresponding path program 1 times [2024-10-11 18:10:53,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:53,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717798794] [2024-10-11 18:10:53,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:53,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:10:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:53,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:10:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:10:53,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:53,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717798794] [2024-10-11 18:10:53,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717798794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:53,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:53,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:10:53,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425245882] [2024-10-11 18:10:53,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:53,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:10:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:53,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:10:53,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:10:53,970 INFO L87 Difference]: Start difference. First operand 180 states and 201 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:10:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:54,368 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2024-10-11 18:10:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:10:54,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-10-11 18:10:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:54,369 INFO L225 Difference]: With dead ends: 192 [2024-10-11 18:10:54,370 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 18:10:54,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:10:54,370 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 94 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:54,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 394 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:10:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 18:10:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2024-10-11 18:10:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 104 states have (on average 1.7788461538461537) internal successors, (185), 174 states have internal predecessors, (185), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 18:10:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2024-10-11 18:10:54,375 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 27 [2024-10-11 18:10:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:54,375 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2024-10-11 18:10:54,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:10:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2024-10-11 18:10:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:10:54,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:54,377 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:54,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:10:54,377 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:54,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:54,377 INFO L85 PathProgramCache]: Analyzing trace with hash 135885334, now seen corresponding path program 1 times [2024-10-11 18:10:54,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:54,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750349160] [2024-10-11 18:10:54,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:54,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:55,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:10:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:55,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 18:10:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:55,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:10:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:10:55,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:55,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750349160] [2024-10-11 18:10:55,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750349160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:55,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377195907] [2024-10-11 18:10:55,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:55,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:55,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:55,470 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:10:55,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:10:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:55,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 18:10:55,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:10:55,684 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-10-11 18:10:55,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2024-10-11 18:10:55,724 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-11 18:10:55,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 10 [2024-10-11 18:10:55,747 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (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-10-11 18:10:55,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:10:55,804 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-10-11 18:10:55,805 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 5 case distinctions, treesize of input 24 treesize of output 33 [2024-10-11 18:10:55,868 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:10:55,868 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 11 [2024-10-11 18:10:55,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:10:55,917 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-10-11 18:10:55,918 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 2 case distinctions, treesize of input 23 treesize of output 25 [2024-10-11 18:10:55,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:10:56,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:10:56,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:10:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 18:10:56,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:10:56,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377195907] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:56,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:10:56,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 18 [2024-10-11 18:10:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473431283] [2024-10-11 18:10:56,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:10:56,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 18:10:56,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:56,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 18:10:56,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=341, Unknown=1, NotChecked=38, Total=462 [2024-10-11 18:10:56,139 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand has 20 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:10:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:57,427 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2024-10-11 18:10:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:10:57,428 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2024-10-11 18:10:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:57,429 INFO L225 Difference]: With dead ends: 194 [2024-10-11 18:10:57,429 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 18:10:57,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=616, Unknown=1, NotChecked=52, Total=812 [2024-10-11 18:10:57,430 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 79 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:57,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 790 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1374 Invalid, 0 Unknown, 193 Unchecked, 1.0s Time] [2024-10-11 18:10:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 18:10:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 179. [2024-10-11 18:10:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 96 states have (on average 1.8125) internal successors, (174), 165 states have internal predecessors, (174), 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-10-11 18:10:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 200 transitions. [2024-10-11 18:10:57,435 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 200 transitions. Word has length 38 [2024-10-11 18:10:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:57,435 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 200 transitions. [2024-10-11 18:10:57,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:10:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 200 transitions. [2024-10-11 18:10:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 18:10:57,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:57,436 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:57,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 18:10:57,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:57,637 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:57,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:57,637 INFO L85 PathProgramCache]: Analyzing trace with hash -302757214, now seen corresponding path program 1 times [2024-10-11 18:10:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:57,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18697293] [2024-10-11 18:10:57,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:57,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:10:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:57,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:10:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:57,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 18:10:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 18:10:58,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:58,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18697293] [2024-10-11 18:10:58,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18697293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:58,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:58,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:10:58,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631995668] [2024-10-11 18:10:58,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:58,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:10:58,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:10:58,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:10:58,070 INFO L87 Difference]: Start difference. First operand 179 states and 200 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-10-11 18:10:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:58,404 INFO L93 Difference]: Finished difference Result 183 states and 205 transitions. [2024-10-11 18:10:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:10:58,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 41 [2024-10-11 18:10:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:58,405 INFO L225 Difference]: With dead ends: 183 [2024-10-11 18:10:58,405 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 18:10:58,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-10-11 18:10:58,406 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 203 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:58,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 252 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:10:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 18:10:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2024-10-11 18:10:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 96 states have (on average 1.7395833333333333) internal successors, (167), 158 states have internal predecessors, (167), 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-10-11 18:10:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2024-10-11 18:10:58,410 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 41 [2024-10-11 18:10:58,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:58,410 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2024-10-11 18:10:58,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-10-11 18:10:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2024-10-11 18:10:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 18:10:58,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:58,411 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:58,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:10:58,411 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:58,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:58,412 INFO L85 PathProgramCache]: Analyzing trace with hash -302757213, now seen corresponding path program 1 times [2024-10-11 18:10:58,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:58,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468368412] [2024-10-11 18:10:58,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:58,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:58,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:10:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:58,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:10:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:58,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 18:10:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 18:10:58,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:58,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468368412] [2024-10-11 18:10:58,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468368412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:58,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:58,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:10:58,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072013426] [2024-10-11 18:10:58,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:58,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:10:58,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:58,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:10:58,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:10:58,802 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-10-11 18:10:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:59,210 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2024-10-11 18:10:59,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:10:59,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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 41 [2024-10-11 18:10:59,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:59,211 INFO L225 Difference]: With dead ends: 180 [2024-10-11 18:10:59,211 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 18:10:59,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-10-11 18:10:59,216 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 211 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:59,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 283 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:10:59,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 18:10:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2024-10-11 18:10:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 101 states have (on average 1.6534653465346534) internal successors, (167), 157 states have internal predecessors, (167), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:10:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 195 transitions. [2024-10-11 18:10:59,221 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 195 transitions. Word has length 41 [2024-10-11 18:10:59,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:59,221 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 195 transitions. [2024-10-11 18:10:59,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-10-11 18:10:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2024-10-11 18:10:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 18:10:59,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:59,222 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:59,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:10:59,222 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:59,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:59,222 INFO L85 PathProgramCache]: Analyzing trace with hash -795538813, now seen corresponding path program 1 times [2024-10-11 18:10:59,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:59,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632999272] [2024-10-11 18:10:59,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:59,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:59,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:10:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:59,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:10:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:59,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 18:10:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 18:10:59,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:59,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632999272] [2024-10-11 18:10:59,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632999272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:59,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:59,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:10:59,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34093278] [2024-10-11 18:10:59,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:59,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:10:59,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:59,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:10:59,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:10:59,597 INFO L87 Difference]: Start difference. First operand 172 states and 195 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-10-11 18:10:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:59,925 INFO L93 Difference]: Finished difference Result 176 states and 200 transitions. [2024-10-11 18:10:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:10:59,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 42 [2024-10-11 18:10:59,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:59,927 INFO L225 Difference]: With dead ends: 176 [2024-10-11 18:10:59,927 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 18:10:59,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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-10-11 18:10:59,929 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 188 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:59,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 275 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:10:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 18:10:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2024-10-11 18:10:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 150 states have internal predecessors, (160), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:10:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2024-10-11 18:10:59,936 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 42 [2024-10-11 18:10:59,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:59,936 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2024-10-11 18:10:59,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-10-11 18:10:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2024-10-11 18:10:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 18:10:59,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:59,940 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:59,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:10:59,940 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:10:59,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:59,941 INFO L85 PathProgramCache]: Analyzing trace with hash -795538812, now seen corresponding path program 1 times [2024-10-11 18:10:59,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:59,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044415982] [2024-10-11 18:10:59,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:59,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:00,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:11:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:00,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:11:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:00,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 18:11:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 18:11:00,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:00,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044415982] [2024-10-11 18:11:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044415982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:00,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:11:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629113770] [2024-10-11 18:11:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:00,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:11:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:00,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:11:00,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:11:00,379 INFO L87 Difference]: Start difference. First operand 165 states and 188 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-10-11 18:11:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:00,701 INFO L93 Difference]: Finished difference Result 158 states and 181 transitions. [2024-10-11 18:11:00,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:11:00,701 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 42 [2024-10-11 18:11:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:00,702 INFO L225 Difference]: With dead ends: 158 [2024-10-11 18:11:00,702 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 18:11:00,703 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-10-11 18:11:00,703 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 240 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:00,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 241 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:11:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 18:11:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-10-11 18:11:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 101 states have (on average 1.5148514851485149) internal successors, (153), 143 states have internal predecessors, (153), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:11:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2024-10-11 18:11:00,709 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 42 [2024-10-11 18:11:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:00,710 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2024-10-11 18:11:00,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-10-11 18:11:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2024-10-11 18:11:00,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 18:11:00,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:00,712 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:11:00,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:11:00,712 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-10-11 18:11:00,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:00,713 INFO L85 PathProgramCache]: Analyzing trace with hash 98734322, now seen corresponding path program 1 times [2024-10-11 18:11:00,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:00,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866840505] [2024-10-11 18:11:00,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:00,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:00,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:11:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:00,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:11:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:01,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 18:11:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 18:11:01,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866840505] [2024-10-11 18:11:01,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866840505] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645787418] [2024-10-11 18:11:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:01,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:01,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:01,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:01,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:11:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:01,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-11 18:11:01,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:01,359 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-10-11 18:11:01,424 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-10-11 18:11:01,446 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-10-11 18:11:01,528 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-10-11 18:11:01,561 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-10-11 18:11:01,566 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:11:01,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:01,726 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-10-11 18:11:01,867 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-10-11 18:11:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:11:01,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645787418] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:01,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:01,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 15] total 29 [2024-10-11 18:11:01,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445718495] [2024-10-11 18:11:01,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:01,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 18:11:01,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:01,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 18:11:01,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2024-10-11 18:11:01,972 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand has 29 states, 25 states have (on average 3.0) internal successors, (75), 26 states have internal predecessors, (75), 8 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-11 18:11:05,990 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-10-11 18:11:10,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-10-11 18:11:14,030 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-10-11 18:11:18,054 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-10-11 18:11:22,063 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-10-11 18:11:26,074 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-10-11 18:11:30,081 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-10-11 18:11:34,126 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-10-11 18:11:38,134 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-10-11 18:11:42,166 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-10-11 18:11:46,173 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-10-11 18:11:50,249 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-10-11 18:11:54,256 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-10-11 18:11:58,279 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-10-11 18:12:02,302 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-10-11 18:12:06,307 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-10-11 18:12:10,315 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]