./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:51:19,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:51:19,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:51:19,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:51:19,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:51:19,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:51:19,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:51:19,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:51:19,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:51:19,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:51:19,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:51:19,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:51:19,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:51:19,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:51:19,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:51:19,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:51:19,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:51:19,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:51:19,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:51:19,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:51:19,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:51:19,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:51:19,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:51:19,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:51:19,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:51:19,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:51:19,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:51:19,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:51:19,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:51:19,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:51:19,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:51:19,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:51:19,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:51:19,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:51:19,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:51:19,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:51:19,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:51:19,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:51:19,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:51:19,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:51:19,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:51:19,924 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:51:19,946 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:51:19,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:51:19,947 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:51:19,947 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:51:19,948 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:51:19,948 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:51:19,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:51:19,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:51:19,949 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:51:19,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:51:19,950 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:51:19,950 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:51:19,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:51:19,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:51:19,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:51:19,951 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:51:19,951 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:51:19,951 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:51:19,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:51:19,952 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:51:19,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:51:19,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:51:19,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:51:19,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:51:19,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:51:19,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:19,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:51:19,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:51:19,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:51:19,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:51:19,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-11-02 20:51:20,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:51:20,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:51:20,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:51:20,298 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:51:20,298 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:51:20,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2022-11-02 20:51:20,383 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/data/523537050/4a3c1103980943a5b7a4b9922fb45fbc/FLAG7c53f3904 [2022-11-02 20:51:21,007 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:51:21,008 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2022-11-02 20:51:21,030 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/data/523537050/4a3c1103980943a5b7a4b9922fb45fbc/FLAG7c53f3904 [2022-11-02 20:51:21,297 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/data/523537050/4a3c1103980943a5b7a4b9922fb45fbc [2022-11-02 20:51:21,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:51:21,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:51:21,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:21,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:51:21,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:51:21,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:21,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b46ab41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21, skipping insertion in model container [2022-11-02 20:51:21,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:21,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:51:21,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:51:21,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2022-11-02 20:51:21,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:21,756 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:51:21,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2022-11-02 20:51:21,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:21,879 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:51:21,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21 WrapperNode [2022-11-02 20:51:21,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:21,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:21,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:51:21,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:51:21,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:21,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:21,966 INFO L138 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2022-11-02 20:51:21,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:21,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:51:21,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:51:21,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:51:21,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:21,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:21,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:21,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:22,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:22,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:22,032 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:22,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:22,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:51:22,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:51:22,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:51:22,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:51:22,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21" (1/1) ... [2022-11-02 20:51:22,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:22,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:22,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:22,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:51:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-11-02 20:51:22,138 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-11-02 20:51:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:51:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:51:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:51:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:51:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:51:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2022-11-02 20:51:22,140 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2022-11-02 20:51:22,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:51:22,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:51:22,141 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2022-11-02 20:51:22,141 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2022-11-02 20:51:22,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:51:22,141 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2022-11-02 20:51:22,142 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2022-11-02 20:51:22,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:51:22,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:51:22,289 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:51:22,291 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:51:23,006 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:51:23,021 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:51:23,021 INFO L300 CfgBuilder]: Removed 33 assume(true) statements. [2022-11-02 20:51:23,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:23 BoogieIcfgContainer [2022-11-02 20:51:23,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:51:23,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:51:23,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:51:23,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:51:23,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:51:21" (1/3) ... [2022-11-02 20:51:23,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8def6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:23, skipping insertion in model container [2022-11-02 20:51:23,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:21" (2/3) ... [2022-11-02 20:51:23,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8def6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:23, skipping insertion in model container [2022-11-02 20:51:23,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:23" (3/3) ... [2022-11-02 20:51:23,039 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2022-11-02 20:51:23,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:51:23,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2022-11-02 20:51:23,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:23,115 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@173b6749, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:23,115 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2022-11-02 20:51:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 223 states, 121 states have (on average 2.090909090909091) internal successors, (253), 209 states have internal predecessors, (253), 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) [2022-11-02 20:51:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-02 20:51:23,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:23,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-02 20:51:23,129 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:23,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:23,135 INFO L85 PathProgramCache]: Analyzing trace with hash 6220774, now seen corresponding path program 1 times [2022-11-02 20:51:23,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:23,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988441689] [2022-11-02 20:51:23,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:23,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:23,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:23,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988441689] [2022-11-02 20:51:23,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988441689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:23,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:23,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:23,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690506938] [2022-11-02 20:51:23,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:23,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:51:23,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:23,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:51:23,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:51:23,436 INFO L87 Difference]: Start difference. First operand has 223 states, 121 states have (on average 2.090909090909091) internal successors, (253), 209 states have internal predecessors, (253), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:23,489 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2022-11-02 20:51:23,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:51:23,491 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-02 20:51:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:23,510 INFO L225 Difference]: With dead ends: 221 [2022-11-02 20:51:23,510 INFO L226 Difference]: Without dead ends: 219 [2022-11-02 20:51:23,512 INFO L412 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 [2022-11-02 20:51:23,520 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:23,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:51:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-02 20:51:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-11-02 20:51:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 116 states have (on average 1.8448275862068966) internal successors, (214), 205 states have internal predecessors, (214), 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) [2022-11-02 20:51:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 240 transitions. [2022-11-02 20:51:23,607 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 240 transitions. Word has length 4 [2022-11-02 20:51:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:23,608 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 240 transitions. [2022-11-02 20:51:23,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2022-11-02 20:51:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:51:23,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:23,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:51:23,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:51:23,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:23,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1692154958, now seen corresponding path program 1 times [2022-11-02 20:51:23,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:23,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751635735] [2022-11-02 20:51:23,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:23,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:23,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:23,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751635735] [2022-11-02 20:51:23,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751635735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:23,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:23,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:23,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107214708] [2022-11-02 20:51:23,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:23,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:23,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:23,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:23,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:23,758 INFO L87 Difference]: Start difference. First operand 219 states and 240 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:23,925 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2022-11-02 20:51:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:23,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 20:51:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:23,942 INFO L225 Difference]: With dead ends: 217 [2022-11-02 20:51:23,943 INFO L226 Difference]: Without dead ends: 217 [2022-11-02 20:51:23,943 INFO L412 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 [2022-11-02 20:51:23,944 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 17 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:23,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 367 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:51:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-02 20:51:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-11-02 20:51:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 116 states have (on average 1.8275862068965518) internal successors, (212), 203 states have internal predecessors, (212), 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) [2022-11-02 20:51:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2022-11-02 20:51:23,959 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 6 [2022-11-02 20:51:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:23,959 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2022-11-02 20:51:23,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2022-11-02 20:51:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:51:23,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:23,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:51:23,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:51:23,961 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:23,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:23,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1692154959, now seen corresponding path program 1 times [2022-11-02 20:51:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:23,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877567491] [2022-11-02 20:51:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:24,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877567491] [2022-11-02 20:51:24,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877567491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:24,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:24,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:24,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875031866] [2022-11-02 20:51:24,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:24,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:24,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:24,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:24,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:24,118 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:24,313 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2022-11-02 20:51:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:24,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 20:51:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:24,316 INFO L225 Difference]: With dead ends: 215 [2022-11-02 20:51:24,316 INFO L226 Difference]: Without dead ends: 215 [2022-11-02 20:51:24,317 INFO L412 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 [2022-11-02 20:51:24,318 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 15 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:24,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 372 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:51:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-02 20:51:24,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-11-02 20:51:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 116 states have (on average 1.8103448275862069) internal successors, (210), 201 states have internal predecessors, (210), 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) [2022-11-02 20:51:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 236 transitions. [2022-11-02 20:51:24,330 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 236 transitions. Word has length 6 [2022-11-02 20:51:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:24,331 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 236 transitions. [2022-11-02 20:51:24,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,331 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 236 transitions. [2022-11-02 20:51:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:51:24,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:24,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:24,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:51:24,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:24,334 INFO L85 PathProgramCache]: Analyzing trace with hash -387700622, now seen corresponding path program 1 times [2022-11-02 20:51:24,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:24,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059979035] [2022-11-02 20:51:24,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:24,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059979035] [2022-11-02 20:51:24,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059979035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:24,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:24,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357331687] [2022-11-02 20:51:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:24,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:24,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:24,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:24,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:24,653 INFO L87 Difference]: Start difference. First operand 215 states and 236 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:25,012 INFO L93 Difference]: Finished difference Result 210 states and 231 transitions. [2022-11-02 20:51:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:51:25,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:51:25,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:25,014 INFO L225 Difference]: With dead ends: 210 [2022-11-02 20:51:25,014 INFO L226 Difference]: Without dead ends: 210 [2022-11-02 20:51:25,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:25,016 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 60 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:25,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 606 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:51:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-02 20:51:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-11-02 20:51:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 116 states have (on average 1.7672413793103448) internal successors, (205), 196 states have internal predecessors, (205), 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) [2022-11-02 20:51:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2022-11-02 20:51:25,024 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 10 [2022-11-02 20:51:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:25,025 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2022-11-02 20:51:25,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2022-11-02 20:51:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:51:25,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:25,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:25,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:51:25,027 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:25,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash -387700621, now seen corresponding path program 1 times [2022-11-02 20:51:25,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:25,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340668901] [2022-11-02 20:51:25,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:25,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:25,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:25,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340668901] [2022-11-02 20:51:25,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340668901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:25,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:25,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:51:25,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569731445] [2022-11-02 20:51:25,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:25,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:51:25,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:25,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:51:25,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:51:25,359 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:25,706 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2022-11-02 20:51:25,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:51:25,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:51:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:25,708 INFO L225 Difference]: With dead ends: 205 [2022-11-02 20:51:25,708 INFO L226 Difference]: Without dead ends: 205 [2022-11-02 20:51:25,712 INFO L412 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 [2022-11-02 20:51:25,714 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 39 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:25,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 544 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:51:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-02 20:51:25,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-11-02 20:51:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 116 states have (on average 1.7241379310344827) internal successors, (200), 191 states have internal predecessors, (200), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-02 20:51:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 226 transitions. [2022-11-02 20:51:25,734 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 226 transitions. Word has length 10 [2022-11-02 20:51:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:25,734 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 226 transitions. [2022-11-02 20:51:25,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 226 transitions. [2022-11-02 20:51:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:51:25,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:25,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:25,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:51:25,736 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:25,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash 866182740, now seen corresponding path program 1 times [2022-11-02 20:51:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:25,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591336280] [2022-11-02 20:51:25,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:25,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:25,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:25,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591336280] [2022-11-02 20:51:25,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591336280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:25,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:25,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:51:25,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038041577] [2022-11-02 20:51:25,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:25,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:51:25,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:25,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:51:25,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:51:25,873 INFO L87 Difference]: Start difference. First operand 205 states and 226 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:26,077 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2022-11-02 20:51:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:51:26,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-02 20:51:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:26,080 INFO L225 Difference]: With dead ends: 204 [2022-11-02 20:51:26,080 INFO L226 Difference]: Without dead ends: 204 [2022-11-02 20:51:26,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:26,083 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 21 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:26,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 630 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:51:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-02 20:51:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-11-02 20:51:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 116 states have (on average 1.7155172413793103) internal successors, (199), 190 states have internal predecessors, (199), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-02 20:51:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2022-11-02 20:51:26,106 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 11 [2022-11-02 20:51:26,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:26,107 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2022-11-02 20:51:26,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2022-11-02 20:51:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:51:26,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:26,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:26,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:51:26,110 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:26,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:26,111 INFO L85 PathProgramCache]: Analyzing trace with hash 866182741, now seen corresponding path program 1 times [2022-11-02 20:51:26,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:26,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953417711] [2022-11-02 20:51:26,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:26,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:26,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953417711] [2022-11-02 20:51:26,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953417711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:26,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:26,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:26,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826833706] [2022-11-02 20:51:26,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:26,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:26,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:26,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:26,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:26,261 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:26,542 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2022-11-02 20:51:26,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:51:26,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-02 20:51:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:26,544 INFO L225 Difference]: With dead ends: 203 [2022-11-02 20:51:26,544 INFO L226 Difference]: Without dead ends: 203 [2022-11-02 20:51:26,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:51:26,545 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 20 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:26,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 858 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:51:26,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-02 20:51:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-11-02 20:51:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 116 states have (on average 1.706896551724138) internal successors, (198), 189 states have internal predecessors, (198), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-02 20:51:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2022-11-02 20:51:26,559 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 11 [2022-11-02 20:51:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:26,559 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2022-11-02 20:51:26,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2022-11-02 20:51:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:51:26,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:26,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:26,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:51:26,562 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:26,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:26,563 INFO L85 PathProgramCache]: Analyzing trace with hash -610249734, now seen corresponding path program 1 times [2022-11-02 20:51:26,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:26,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315381156] [2022-11-02 20:51:26,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:26,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:26,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:26,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:26,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315381156] [2022-11-02 20:51:26,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315381156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:26,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:26,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:51:26,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676214608] [2022-11-02 20:51:26,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:26,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:51:26,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:26,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:51:26,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:26,984 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:51:27,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:27,596 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2022-11-02 20:51:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:51:27,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-02 20:51:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:27,598 INFO L225 Difference]: With dead ends: 202 [2022-11-02 20:51:27,598 INFO L226 Difference]: Without dead ends: 202 [2022-11-02 20:51:27,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:27,599 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 72 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:27,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 562 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:51:27,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-02 20:51:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-11-02 20:51:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 116 states have (on average 1.6982758620689655) internal successors, (197), 188 states have internal predecessors, (197), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-02 20:51:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2022-11-02 20:51:27,612 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 19 [2022-11-02 20:51:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:27,618 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2022-11-02 20:51:27,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:51:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2022-11-02 20:51:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:51:27,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:27,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:27,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:51:27,620 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:27,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash -610249733, now seen corresponding path program 1 times [2022-11-02 20:51:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:27,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928833672] [2022-11-02 20:51:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:27,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:28,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:28,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:28,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928833672] [2022-11-02 20:51:28,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928833672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:28,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:28,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:51:28,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198116894] [2022-11-02 20:51:28,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:28,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:51:28,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:28,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:51:28,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:28,314 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:51:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:28,824 INFO L93 Difference]: Finished difference Result 210 states and 235 transitions. [2022-11-02 20:51:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:28,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-02 20:51:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:28,828 INFO L225 Difference]: With dead ends: 210 [2022-11-02 20:51:28,828 INFO L226 Difference]: Without dead ends: 210 [2022-11-02 20:51:28,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:28,831 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 56 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:28,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 521 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:51:28,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-02 20:51:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2022-11-02 20:51:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 120 states have (on average 1.6833333333333333) internal successors, (202), 192 states have internal predecessors, (202), 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) [2022-11-02 20:51:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2022-11-02 20:51:28,842 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 19 [2022-11-02 20:51:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:28,842 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2022-11-02 20:51:28,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:51:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2022-11-02 20:51:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:51:28,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:28,844 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:28,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:51:28,845 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:28,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash 450998278, now seen corresponding path program 1 times [2022-11-02 20:51:28,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:28,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263742958] [2022-11-02 20:51:28,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:28,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:29,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:29,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:51:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:51:29,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:29,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263742958] [2022-11-02 20:51:29,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263742958] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:29,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148034914] [2022-11-02 20:51:29,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:29,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:29,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:29,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:29,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:51:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:29,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:51:29,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:29,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:29,959 INFO L356 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-11-02 20:51:29,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 23 [2022-11-02 20:51:30,029 INFO L356 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2022-11-02 20:51:30,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 111 treesize of output 117 [2022-11-02 20:51:30,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:51:30,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:51:30,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:30,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2022-11-02 20:51:30,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:30,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:51:30,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:51:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:30,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:30,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148034914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:30,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:51:30,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 12 [2022-11-02 20:51:30,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934881843] [2022-11-02 20:51:30,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:30,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:51:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:51:30,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:51:30,767 INFO L87 Difference]: Start difference. First operand 207 states and 230 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:51:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:31,216 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2022-11-02 20:51:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:51:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 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 34 [2022-11-02 20:51:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:31,218 INFO L225 Difference]: With dead ends: 207 [2022-11-02 20:51:31,219 INFO L226 Difference]: Without dead ends: 207 [2022-11-02 20:51:31,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:51:31,220 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 92 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:31,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 717 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 435 Invalid, 0 Unknown, 206 Unchecked, 0.4s Time] [2022-11-02 20:51:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-02 20:51:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2022-11-02 20:51:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 116 states have (on average 1.6896551724137931) internal successors, (196), 187 states have internal predecessors, (196), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-02 20:51:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 222 transitions. [2022-11-02 20:51:31,228 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 222 transitions. Word has length 34 [2022-11-02 20:51:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:31,230 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 222 transitions. [2022-11-02 20:51:31,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:51:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 222 transitions. [2022-11-02 20:51:31,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:51:31,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:31,235 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:31,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:31,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:51:31,461 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:31,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash 50383991, now seen corresponding path program 1 times [2022-11-02 20:51:31,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:31,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927107512] [2022-11-02 20:51:31,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:31,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:31,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:31,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:51:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:51:32,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:32,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927107512] [2022-11-02 20:51:32,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927107512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:32,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225054029] [2022-11-02 20:51:32,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:32,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:32,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:32,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:32,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:51:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:32,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:51:32,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:32,287 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-02 20:51:32,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-11-02 20:51:32,436 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-02 20:51:32,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 46 [2022-11-02 20:51:32,878 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-02 20:51:32,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-02 20:51:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:51:32,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:33,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225054029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:33,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:51:33,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2022-11-02 20:51:33,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276749712] [2022-11-02 20:51:33,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:33,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:51:33,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:33,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:51:33,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:51:33,500 INFO L87 Difference]: Start difference. First operand 201 states and 222 transitions. Second operand has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:51:34,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:34,296 INFO L93 Difference]: Finished difference Result 203 states and 226 transitions. [2022-11-02 20:51:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:51:34,296 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-11-02 20:51:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:34,298 INFO L225 Difference]: With dead ends: 203 [2022-11-02 20:51:34,298 INFO L226 Difference]: Without dead ends: 203 [2022-11-02 20:51:34,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:51:34,299 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 226 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:34,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 930 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 568 Invalid, 0 Unknown, 417 Unchecked, 0.5s Time] [2022-11-02 20:51:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-02 20:51:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2022-11-02 20:51:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 116 states have (on average 1.6810344827586208) internal successors, (195), 186 states have internal predecessors, (195), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-02 20:51:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2022-11-02 20:51:34,306 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 37 [2022-11-02 20:51:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:34,306 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2022-11-02 20:51:34,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:51:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-11-02 20:51:34,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:51:34,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:34,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:34,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:34,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:51:34,529 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:34,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:34,531 INFO L85 PathProgramCache]: Analyzing trace with hash 50383992, now seen corresponding path program 1 times [2022-11-02 20:51:34,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:34,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786203918] [2022-11-02 20:51:34,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:34,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:35,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:35,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:51:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:35,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:51:35,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:35,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786203918] [2022-11-02 20:51:35,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786203918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:35,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291810784] [2022-11-02 20:51:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:35,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:35,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:35,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:35,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:51:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:35,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:51:35,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:35,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:35,534 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 20:51:35,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 20:51:35,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-11-02 20:51:35,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:51:35,746 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (<= 0 |c_ULTIMATE.start_create_sll_~#list~0#1.offset|) (or (exists ((|v_old(#length)_AFTER_CALL_5| (Array Int Int))) (let ((.cse0 (@diff |v_old(#length)_AFTER_CALL_5| |c_#length|))) (and (= (store |v_old(#length)_AFTER_CALL_5| .cse0 (select |c_#length| .cse0)) |c_#length|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (<= 4 (select |v_old(#length)_AFTER_CALL_5| |c_ULTIMATE.start_create_sll_~pp1#1.base|))))) (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|) (<= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)))) is different from false [2022-11-02 20:51:35,748 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (<= 0 |c_ULTIMATE.start_create_sll_~#list~0#1.offset|) (or (exists ((|v_old(#length)_AFTER_CALL_5| (Array Int Int))) (let ((.cse0 (@diff |v_old(#length)_AFTER_CALL_5| |c_#length|))) (and (= (store |v_old(#length)_AFTER_CALL_5| .cse0 (select |c_#length| .cse0)) |c_#length|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (<= 4 (select |v_old(#length)_AFTER_CALL_5| |c_ULTIMATE.start_create_sll_~pp1#1.base|))))) (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|) (<= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)))) is different from true [2022-11-02 20:51:35,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:51:36,002 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (or (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|) (<= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (exists ((|v_#length_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_8| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_8| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (<= (+ 2 .cse0) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= (store |v_#length_BEFORE_CALL_8| .cse0 (select |c_#length| .cse0)) |c_#length|))))) (<= 0 |c_ULTIMATE.start_create_sll_~#list~0#1.offset|)) is different from false [2022-11-02 20:51:36,005 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (or (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|) (<= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (exists ((|v_#length_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_8| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_8| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (<= (+ 2 .cse0) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= (store |v_#length_BEFORE_CALL_8| .cse0 (select |c_#length| .cse0)) |c_#length|))))) (<= 0 |c_ULTIMATE.start_create_sll_~#list~0#1.offset|)) is different from true [2022-11-02 20:51:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:51:36,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:51:36,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291810784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:36,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:51:36,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2022-11-02 20:51:36,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798729576] [2022-11-02 20:51:36,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:36,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:51:36,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:36,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:51:36,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=123, Unknown=4, NotChecked=46, Total=210 [2022-11-02 20:51:36,074 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:51:36,153 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse0 (<= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (<= 0 |c_ULTIMATE.start_create_sll_~#list~0#1.offset|) .cse0 (or (exists ((|v_old(#length)_AFTER_CALL_5| (Array Int Int))) (let ((.cse1 (@diff |v_old(#length)_AFTER_CALL_5| |c_#length|))) (and (= (store |v_old(#length)_AFTER_CALL_5| .cse1 (select |c_#length| .cse1)) |c_#length|) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (<= 4 (select |v_old(#length)_AFTER_CALL_5| |c_ULTIMATE.start_create_sll_~pp1#1.base|))))) .cse2 .cse0) (or .cse2 .cse0))) is different from false [2022-11-02 20:51:36,156 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse0 (<= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (<= 0 |c_ULTIMATE.start_create_sll_~#list~0#1.offset|) .cse0 (or (exists ((|v_old(#length)_AFTER_CALL_5| (Array Int Int))) (let ((.cse1 (@diff |v_old(#length)_AFTER_CALL_5| |c_#length|))) (and (= (store |v_old(#length)_AFTER_CALL_5| .cse1 (select |c_#length| .cse1)) |c_#length|) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (<= 4 (select |v_old(#length)_AFTER_CALL_5| |c_ULTIMATE.start_create_sll_~pp1#1.base|))))) .cse2 .cse0) (or .cse2 .cse0))) is different from true [2022-11-02 20:51:36,183 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse2 (<= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (<= 0 |c_ULTIMATE.start_create_sll_~#list~0#1.offset|) (or (exists ((|v_old(#length)_AFTER_CALL_5| (Array Int Int))) (let ((.cse0 (@diff |v_old(#length)_AFTER_CALL_5| |c_#length|))) (and (= (store |v_old(#length)_AFTER_CALL_5| .cse0 (select |c_#length| .cse0)) |c_#length|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (<= 4 (select |v_old(#length)_AFTER_CALL_5| |c_ULTIMATE.start_create_sll_~pp1#1.base|))))) .cse1 .cse2) (or .cse1 .cse2))) is different from false [2022-11-02 20:51:36,186 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse2 (<= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (<= 0 |c_ULTIMATE.start_create_sll_~#list~0#1.offset|) (or (exists ((|v_old(#length)_AFTER_CALL_5| (Array Int Int))) (let ((.cse0 (@diff |v_old(#length)_AFTER_CALL_5| |c_#length|))) (and (= (store |v_old(#length)_AFTER_CALL_5| .cse0 (select |c_#length| .cse0)) |c_#length|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (<= 4 (select |v_old(#length)_AFTER_CALL_5| |c_ULTIMATE.start_create_sll_~pp1#1.base|))))) .cse1 .cse2) (or .cse1 .cse2))) is different from true [2022-11-02 20:51:36,196 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse1 (<= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (or .cse0 .cse1 (exists ((|v_#length_BEFORE_CALL_8| (Array Int Int))) (let ((.cse2 (@diff |v_#length_BEFORE_CALL_8| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_8| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (<= (+ 2 .cse2) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= (store |v_#length_BEFORE_CALL_8| .cse2 (select |c_#length| .cse2)) |c_#length|))))) (<= 0 |c_ULTIMATE.start_create_sll_~#list~0#1.offset|) .cse1 (or .cse0 .cse1))) is different from false [2022-11-02 20:51:36,199 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse1 (<= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (or .cse0 .cse1 (exists ((|v_#length_BEFORE_CALL_8| (Array Int Int))) (let ((.cse2 (@diff |v_#length_BEFORE_CALL_8| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_8| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (<= (+ 2 .cse2) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= (store |v_#length_BEFORE_CALL_8| .cse2 (select |c_#length| .cse2)) |c_#length|))))) (<= 0 |c_ULTIMATE.start_create_sll_~#list~0#1.offset|) .cse1 (or .cse0 .cse1))) is different from true [2022-11-02 20:51:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:36,682 INFO L93 Difference]: Finished difference Result 210 states and 236 transitions. [2022-11-02 20:51:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:51:36,682 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-11-02 20:51:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:36,684 INFO L225 Difference]: With dead ends: 210 [2022-11-02 20:51:36,684 INFO L226 Difference]: Without dead ends: 210 [2022-11-02 20:51:36,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=164, Unknown=10, NotChecked=150, Total=380 [2022-11-02 20:51:36,685 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 56 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 462 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:36,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 636 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 547 Invalid, 0 Unknown, 462 Unchecked, 0.5s Time] [2022-11-02 20:51:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-02 20:51:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 205. [2022-11-02 20:51:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 120 states have (on average 1.6666666666666667) internal successors, (200), 190 states have internal predecessors, (200), 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) [2022-11-02 20:51:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 228 transitions. [2022-11-02 20:51:36,695 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 228 transitions. Word has length 37 [2022-11-02 20:51:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:36,698 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 228 transitions. [2022-11-02 20:51:36,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:51:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 228 transitions. [2022-11-02 20:51:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:51:36,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:36,706 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:36,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:36,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:51:36,931 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1313795277, now seen corresponding path program 1 times [2022-11-02 20:51:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:36,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957242641] [2022-11-02 20:51:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:51:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:51:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:51:38,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:38,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957242641] [2022-11-02 20:51:38,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957242641] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:38,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832848966] [2022-11-02 20:51:38,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:38,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:38,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:38,699 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:38,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:51:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:38,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 20:51:38,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:38,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:38,976 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-02 20:51:38,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-02 20:51:38,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-11-02 20:51:39,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:51:39,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:39,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-02 20:51:39,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:51:39,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:39,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-02 20:51:39,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:51:39,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:39,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-02 20:51:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:51:39,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:40,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832848966] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:40,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:51:40,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2022-11-02 20:51:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241223578] [2022-11-02 20:51:40,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:40,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:51:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:51:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:51:40,019 INFO L87 Difference]: Start difference. First operand 205 states and 228 transitions. Second operand has 18 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:51:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:41,858 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2022-11-02 20:51:41,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:51:41,859 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 52 [2022-11-02 20:51:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:41,861 INFO L225 Difference]: With dead ends: 216 [2022-11-02 20:51:41,861 INFO L226 Difference]: Without dead ends: 216 [2022-11-02 20:51:41,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:51:41,862 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 422 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:41,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 629 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1566 Invalid, 0 Unknown, 98 Unchecked, 1.6s Time] [2022-11-02 20:51:41,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-02 20:51:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2022-11-02 20:51:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 116 states have (on average 1.6724137931034482) 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) [2022-11-02 20:51:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2022-11-02 20:51:41,870 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 52 [2022-11-02 20:51:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:41,871 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2022-11-02 20:51:41,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:51:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2022-11-02 20:51:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:51:41,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:41,872 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:41,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:42,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:42,097 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:42,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash 819452048, now seen corresponding path program 1 times [2022-11-02 20:51:42,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:42,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162326682] [2022-11-02 20:51:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:42,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:51:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:51:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:51:42,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:42,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162326682] [2022-11-02 20:51:42,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162326682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:42,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:42,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:51:42,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316431986] [2022-11-02 20:51:42,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:42,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:51:42,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:42,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:51:42,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:51:42,692 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:51:43,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:43,142 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2022-11-02 20:51:43,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:43,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-11-02 20:51:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:43,144 INFO L225 Difference]: With dead ends: 204 [2022-11-02 20:51:43,144 INFO L226 Difference]: Without dead ends: 204 [2022-11-02 20:51:43,144 INFO L412 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 [2022-11-02 20:51:43,145 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 240 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:43,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 343 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:51:43,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-02 20:51:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2022-11-02 20:51:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 116 states have (on average 1.6120689655172413) internal successors, (187), 178 states have internal predecessors, (187), 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) [2022-11-02 20:51:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2022-11-02 20:51:43,150 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 58 [2022-11-02 20:51:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:43,151 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2022-11-02 20:51:43,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:51:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2022-11-02 20:51:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:51:43,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:43,153 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:43,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:51:43,153 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash 819452049, now seen corresponding path program 1 times [2022-11-02 20:51:43,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:43,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082781538] [2022-11-02 20:51:43,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:43,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:43,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:43,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:51:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:43,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:51:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:51:43,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:43,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082781538] [2022-11-02 20:51:43,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082781538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:43,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:43,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:51:43,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038252101] [2022-11-02 20:51:43,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:43,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:51:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:43,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:51:43,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:51:43,632 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:51:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:44,235 INFO L93 Difference]: Finished difference Result 215 states and 244 transitions. [2022-11-02 20:51:44,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:51:44,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-11-02 20:51:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:44,238 INFO L225 Difference]: With dead ends: 215 [2022-11-02 20:51:44,238 INFO L226 Difference]: Without dead ends: 215 [2022-11-02 20:51:44,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:51:44,238 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 352 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:44,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 280 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:51:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-02 20:51:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 194. [2022-11-02 20:51:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 123 states have (on average 1.5365853658536586) internal successors, (189), 179 states have internal predecessors, (189), 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) [2022-11-02 20:51:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2022-11-02 20:51:44,245 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 58 [2022-11-02 20:51:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:44,246 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2022-11-02 20:51:44,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:51:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2022-11-02 20:51:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:51:44,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:44,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:44,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:51:44,248 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash -366790067, now seen corresponding path program 1 times [2022-11-02 20:51:44,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:44,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783596106] [2022-11-02 20:51:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:51:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:51:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:51:44,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:44,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783596106] [2022-11-02 20:51:44,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783596106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:44,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:44,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:51:44,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797228548] [2022-11-02 20:51:44,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:44,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:51:44,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:44,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:51:44,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:51:44,892 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:51:45,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:45,465 INFO L93 Difference]: Finished difference Result 199 states and 223 transitions. [2022-11-02 20:51:45,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:45,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2022-11-02 20:51:45,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:45,466 INFO L225 Difference]: With dead ends: 199 [2022-11-02 20:51:45,467 INFO L226 Difference]: Without dead ends: 199 [2022-11-02 20:51:45,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:51:45,468 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 183 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:45,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 370 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:51:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-02 20:51:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2022-11-02 20:51:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 172 states have internal predecessors, (182), 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) [2022-11-02 20:51:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 210 transitions. [2022-11-02 20:51:45,474 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 210 transitions. Word has length 59 [2022-11-02 20:51:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:45,474 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 210 transitions. [2022-11-02 20:51:45,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:51:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 210 transitions. [2022-11-02 20:51:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:51:45,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:45,476 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:45,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:51:45,476 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:45,477 INFO L85 PathProgramCache]: Analyzing trace with hash -366790066, now seen corresponding path program 1 times [2022-11-02 20:51:45,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:45,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079597614] [2022-11-02 20:51:45,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:45,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:45,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:51:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:51:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:51:46,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:46,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079597614] [2022-11-02 20:51:46,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079597614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:46,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:46,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:51:46,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994289764] [2022-11-02 20:51:46,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:46,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:51:46,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:46,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:51:46,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:51:46,136 INFO L87 Difference]: Start difference. First operand 187 states and 210 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:51:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:46,781 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2022-11-02 20:51:46,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:46,781 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2022-11-02 20:51:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:46,782 INFO L225 Difference]: With dead ends: 194 [2022-11-02 20:51:46,782 INFO L226 Difference]: Without dead ends: 194 [2022-11-02 20:51:46,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:51:46,783 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 376 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:46,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 295 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:51:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-02 20:51:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 180. [2022-11-02 20:51:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 165 states have internal predecessors, (175), 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) [2022-11-02 20:51:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 203 transitions. [2022-11-02 20:51:46,789 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 203 transitions. Word has length 59 [2022-11-02 20:51:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:46,790 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 203 transitions. [2022-11-02 20:51:46,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:51:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 203 transitions. [2022-11-02 20:51:46,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 20:51:46,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:46,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:46,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:51:46,792 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:46,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1983741876, now seen corresponding path program 1 times [2022-11-02 20:51:46,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:46,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508790747] [2022-11-02 20:51:46,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:51:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:51:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:51:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:48,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508790747] [2022-11-02 20:51:48,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508790747] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:48,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665574809] [2022-11-02 20:51:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:48,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:48,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:48,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:48,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:51:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:49,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-02 20:51:49,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:49,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:51:49,489 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:51:49,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-11-02 20:51:49,949 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2094 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_2095 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2094) |c_chain_node_#in~ppnode#1.base| v_ArrVal_2095)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-11-02 20:51:49,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:50,001 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-02 20:51:50,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2022-11-02 20:51:50,011 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:51:50,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-02 20:51:50,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-11-02 20:51:50,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:51:50,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:51:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-02 20:51:50,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:50,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-11-02 20:51:50,400 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_main_~#p1~0#1.base| |c_ULTIMATE.start_create_sll_~#list~0#1.base|) (forall ((v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2104 (Array Int Int)) (|v_chain_node_~node~0#1.base_21| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_21| v_ArrVal_2105) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_2104) |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|) 0)) (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_21|) 0))))) is different from false [2022-11-02 20:51:50,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665574809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:50,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:51:50,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 35 [2022-11-02 20:51:50,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71905324] [2022-11-02 20:51:50,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:50,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-02 20:51:50,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-02 20:51:50,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1095, Unknown=4, NotChecked=134, Total=1332 [2022-11-02 20:51:50,405 INFO L87 Difference]: Start difference. First operand 180 states and 203 transitions. Second operand has 35 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 32 states have internal predecessors, (87), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:51:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:52,983 INFO L93 Difference]: Finished difference Result 208 states and 236 transitions. [2022-11-02 20:51:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:51:52,984 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 32 states have internal predecessors, (87), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 64 [2022-11-02 20:51:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:52,985 INFO L225 Difference]: With dead ends: 208 [2022-11-02 20:51:52,985 INFO L226 Difference]: Without dead ends: 208 [2022-11-02 20:51:52,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=222, Invalid=2225, Unknown=11, NotChecked=194, Total=2652 [2022-11-02 20:51:52,987 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 113 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 1853 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 576 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:52,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 2271 Invalid, 2466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1853 Invalid, 0 Unknown, 576 Unchecked, 1.5s Time] [2022-11-02 20:51:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-02 20:51:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 196. [2022-11-02 20:51:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 180 states have internal predecessors, (196), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-02 20:51:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 226 transitions. [2022-11-02 20:51:52,995 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 226 transitions. Word has length 64 [2022-11-02 20:51:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:52,996 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 226 transitions. [2022-11-02 20:51:52,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 32 states have internal predecessors, (87), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:51:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 226 transitions. [2022-11-02 20:51:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:51:52,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:52,997 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:53,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:53,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:51:53,214 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:51:53,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash 578612374, now seen corresponding path program 1 times [2022-11-02 20:51:53,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:53,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27198049] [2022-11-02 20:51:53,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:54,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:54,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:51:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:51:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:51:55,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:55,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27198049] [2022-11-02 20:51:55,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27198049] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:55,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877609740] [2022-11-02 20:51:55,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:55,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:55,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:55,975 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:55,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:51:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-02 20:51:56,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:56,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-11-02 20:51:56,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:51:56,643 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:51:56,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-11-02 20:51:56,735 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:56,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 8 [2022-11-02 20:51:57,066 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (and (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2393) |c_chain_node_#in~ppnode#1.base| v_ArrVal_2394) |c_#memory_$Pointer$.base|) (<= (+ |chain_node_~node~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2022-11-02 20:51:57,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:57,121 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-02 20:51:57,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2022-11-02 20:51:57,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-11-02 20:51:57,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-02 20:51:57,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-11-02 20:52:01,830 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_4 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (store (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_~ptr~0#1.base| v_DerPreprocessor_4) |chain_node_~node~0#1.base| v_ArrVal_2398) |c_chain_node_#in~ppnode#1.base| v_ArrVal_2399) |c_#memory_$Pointer$.base|) (<= |chain_node_~node~0#1.base| |chain_node_alloc_node_~ptr~0#1.base|))) is different from true [2022-11-02 20:52:01,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:01,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:01,897 INFO L356 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2022-11-02 20:52:01,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 46 [2022-11-02 20:52:01,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:52:02,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:52:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 21 refuted. 2 times theorem prover too weak. 5 trivial. 6 not checked. [2022-11-02 20:52:02,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:02,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-11-02 20:52:02,292 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_main_~#p2~0#1.base| |c_ULTIMATE.start_create_sll_~#list~0#1.base|) (forall ((|v_chain_node_alloc_node_~ptr~0#1.base_31| Int) (|v_chain_node_~node~0#1.base_24| Int) (v_ArrVal_2410 (Array Int Int)) (v_ArrVal_2409 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_31| v_ArrVal_2410) |v_chain_node_~node~0#1.base_24| v_ArrVal_2409) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_2408) |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|) 0)) (< |v_chain_node_alloc_node_~ptr~0#1.base_31| |v_chain_node_~node~0#1.base_24|) (not (< |v_chain_node_alloc_node_~ptr~0#1.base_31| |c_#StackHeapBarrier|))))) is different from false [2022-11-02 20:52:02,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877609740] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:02,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:02,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 41 [2022-11-02 20:52:02,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150570132] [2022-11-02 20:52:02,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:02,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-02 20:52:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:02,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-02 20:52:02,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1398, Unknown=26, NotChecked=234, Total=1806 [2022-11-02 20:52:02,299 INFO L87 Difference]: Start difference. First operand 196 states and 226 transitions. Second operand has 41 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 states have internal predecessors, (82), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:52:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:08,743 INFO L93 Difference]: Finished difference Result 250 states and 288 transitions. [2022-11-02 20:52:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:52:08,744 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 states have internal predecessors, (82), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2022-11-02 20:52:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:08,745 INFO L225 Difference]: With dead ends: 250 [2022-11-02 20:52:08,745 INFO L226 Difference]: Without dead ends: 250 [2022-11-02 20:52:08,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=293, Invalid=2654, Unknown=35, NotChecked=324, Total=3306 [2022-11-02 20:52:08,747 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 210 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 948 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:08,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 2526 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1950 Invalid, 0 Unknown, 948 Unchecked, 1.4s Time] [2022-11-02 20:52:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-02 20:52:08,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2022-11-02 20:52:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 174 states have (on average 1.3850574712643677) internal successors, (241), 218 states have internal predecessors, (241), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-02 20:52:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 277 transitions. [2022-11-02 20:52:08,770 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 277 transitions. Word has length 66 [2022-11-02 20:52:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:08,773 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 277 transitions. [2022-11-02 20:52:08,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 states have internal predecessors, (82), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:52:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 277 transitions. [2022-11-02 20:52:08,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:52:08,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:08,777 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:08,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:08,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:08,997 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:52:08,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash 578601438, now seen corresponding path program 1 times [2022-11-02 20:52:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:08,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263062850] [2022-11-02 20:52:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:09,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:09,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:52:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:10,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:52:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:52:11,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:11,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263062850] [2022-11-02 20:52:11,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263062850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:11,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702294911] [2022-11-02 20:52:11,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:11,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:11,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:11,345 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:11,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:52:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:11,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-02 20:52:11,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:12,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:52:12,296 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:52:12,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:52:12,497 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:52:12,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-11-02 20:52:12,579 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:52:12,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2022-11-02 20:52:14,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:14,236 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-02 20:52:14,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2022-11-02 20:52:14,252 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-02 20:52:14,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:52:14,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 15 [2022-11-02 20:52:14,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-11-02 20:52:14,503 INFO L356 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2022-11-02 20:52:14,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 51 [2022-11-02 20:52:15,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:52:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:23,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:23,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702294911] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:23,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:23,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 47 [2022-11-02 20:52:23,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587910493] [2022-11-02 20:52:23,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:23,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-02 20:52:23,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:23,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-02 20:52:23,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2362, Unknown=30, NotChecked=0, Total=2550 [2022-11-02 20:52:23,767 INFO L87 Difference]: Start difference. First operand 238 states and 277 transitions. Second operand has 48 states, 46 states have (on average 2.5434782608695654) internal successors, (117), 43 states have internal predecessors, (117), 7 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:52:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:34,760 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2022-11-02 20:52:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:52:34,761 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 2.5434782608695654) internal successors, (117), 43 states have internal predecessors, (117), 7 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 66 [2022-11-02 20:52:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:34,763 INFO L225 Difference]: With dead ends: 246 [2022-11-02 20:52:34,763 INFO L226 Difference]: Without dead ends: 246 [2022-11-02 20:52:34,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=345, Invalid=4167, Unknown=44, NotChecked=0, Total=4556 [2022-11-02 20:52:34,765 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 78 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 787 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:34,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 2626 Invalid, 3142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2308 Invalid, 0 Unknown, 787 Unchecked, 1.7s Time] [2022-11-02 20:52:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-02 20:52:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 238. [2022-11-02 20:52:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 218 states have internal predecessors, (240), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-02 20:52:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 276 transitions. [2022-11-02 20:52:34,773 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 276 transitions. Word has length 66 [2022-11-02 20:52:34,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:34,774 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 276 transitions. [2022-11-02 20:52:34,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 2.5434782608695654) internal successors, (117), 43 states have internal predecessors, (117), 7 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:52:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 276 transitions. [2022-11-02 20:52:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:52:34,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:34,775 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:34,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:34,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:34,993 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:52:34,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:34,994 INFO L85 PathProgramCache]: Analyzing trace with hash 578601439, now seen corresponding path program 1 times [2022-11-02 20:52:34,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:34,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46255117] [2022-11-02 20:52:34,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:34,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:52:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:36,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:52:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:52:40,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:40,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46255117] [2022-11-02 20:52:40,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46255117] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:40,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372612717] [2022-11-02 20:52:40,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:40,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:40,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:40,941 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:40,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:52:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:41,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-02 20:52:41,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:41,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:52:41,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:52:42,113 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:52:42,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-11-02 20:52:42,139 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:52:42,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-11-02 20:52:42,266 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:52:42,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:52:42,274 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:52:42,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2022-11-02 20:52:42,914 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3003 (Array Int Int)) (v_ArrVal_3004 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_3005 (Array Int Int)) (v_ArrVal_3006 (Array Int Int))) (and (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_3003) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3006)) (= |c_#length| (store |c_old(#length)| |chain_node_~node~0#1.base| (select |c_#length| |chain_node_~node~0#1.base|))) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_3004) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3005)) (<= (+ |chain_node_~node~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-11-02 20:52:42,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:43,000 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-02 20:52:43,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 44 [2022-11-02 20:52:43,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:52:43,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:43,071 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-02 20:52:43,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 53 [2022-11-02 20:52:43,090 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-11-02 20:52:43,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 13 [2022-11-02 20:52:43,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 11 [2022-11-02 20:52:43,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 5 [2022-11-02 20:52:43,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-11-02 20:52:43,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:52:43,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:52:43,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-02 20:52:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-02 20:52:43,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:44,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-11-02 20:52:45,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372612717] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:45,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:45,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2022-11-02 20:52:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510171723] [2022-11-02 20:52:45,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:45,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-02 20:52:45,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-02 20:52:45,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2105, Unknown=1, NotChecked=92, Total=2352 [2022-11-02 20:52:45,879 INFO L87 Difference]: Start difference. First operand 238 states and 276 transitions. Second operand has 43 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 39 states have internal predecessors, (104), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:52:52,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:52,395 INFO L93 Difference]: Finished difference Result 263 states and 296 transitions. [2022-11-02 20:52:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:52:52,396 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 39 states have internal predecessors, (104), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 66 [2022-11-02 20:52:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:52,398 INFO L225 Difference]: With dead ends: 263 [2022-11-02 20:52:52,398 INFO L226 Difference]: Without dead ends: 263 [2022-11-02 20:52:52,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=386, Invalid=4038, Unknown=2, NotChecked=130, Total=4556 [2022-11-02 20:52:52,400 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 210 mSDsluCounter, 2249 mSDsCounter, 0 mSdLazyCounter, 3449 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 4069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 553 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:52,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 2410 Invalid, 4069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3449 Invalid, 0 Unknown, 553 Unchecked, 3.4s Time] [2022-11-02 20:52:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-02 20:52:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 251. [2022-11-02 20:52:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 185 states have (on average 1.345945945945946) internal successors, (249), 230 states have internal predecessors, (249), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-02 20:52:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2022-11-02 20:52:52,417 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 66 [2022-11-02 20:52:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:52,417 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2022-11-02 20:52:52,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 39 states have internal predecessors, (104), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:52:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2022-11-02 20:52:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 20:52:52,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:52,419 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:52,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:52,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:52,621 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:52:52,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:52,622 INFO L85 PathProgramCache]: Analyzing trace with hash -574790864, now seen corresponding path program 1 times [2022-11-02 20:52:52,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:52,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756720417] [2022-11-02 20:52:52,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:52,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:54,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:54,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:52:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:52:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:52:57,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:57,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756720417] [2022-11-02 20:52:57,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756720417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:57,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724793469] [2022-11-02 20:52:57,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:57,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:57,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:57,337 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:57,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:52:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:57,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-02 20:52:57,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:57,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:52:57,971 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:52:57,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-02 20:52:57,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:52:58,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-11-02 20:52:58,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:52:58,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:58,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:58,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2022-11-02 20:52:58,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-02 20:52:58,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:52:59,312 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-02 20:52:59,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 41 [2022-11-02 20:52:59,349 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:52:59,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-11-02 20:52:59,530 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-02 20:52:59,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 23 [2022-11-02 20:52:59,541 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:52:59,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:52:59,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:53:00,242 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3330 (Array Int Int)) (v_ArrVal_3331 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3329 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_3329) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3331)) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_3328) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3330)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-11-02 20:53:00,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:00,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:00,308 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-02 20:53:00,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 40 [2022-11-02 20:53:00,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:53:00,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:00,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:00,376 INFO L356 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2022-11-02 20:53:00,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 76 [2022-11-02 20:53:00,394 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-11-02 20:53:00,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 13 [2022-11-02 20:53:00,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 23 [2022-11-02 20:53:00,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:53:01,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-02 20:53:01,300 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 20:53:01,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-11-02 20:53:01,660 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:53:01,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2022-11-02 20:53:01,667 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:53:01,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:02,055 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:53:02,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 15 [2022-11-02 20:53:02,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724793469] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:02,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:02,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 60 [2022-11-02 20:53:02,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991006895] [2022-11-02 20:53:02,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:02,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-02 20:53:02,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:02,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-02 20:53:02,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4083, Unknown=7, NotChecked=128, Total=4422 [2022-11-02 20:53:02,647 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 60 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:53:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:06,858 INFO L93 Difference]: Finished difference Result 279 states and 318 transitions. [2022-11-02 20:53:06,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:53:06,861 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 71 [2022-11-02 20:53:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:06,863 INFO L225 Difference]: With dead ends: 279 [2022-11-02 20:53:06,863 INFO L226 Difference]: Without dead ends: 279 [2022-11-02 20:53:06,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1673 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=334, Invalid=5971, Unknown=19, NotChecked=156, Total=6480 [2022-11-02 20:53:06,865 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 227 mSDsluCounter, 2716 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 3682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1113 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:06,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 2876 Invalid, 3682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2473 Invalid, 0 Unknown, 1113 Unchecked, 2.0s Time] [2022-11-02 20:53:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-02 20:53:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 253. [2022-11-02 20:53:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 187 states have (on average 1.3475935828877006) internal successors, (252), 232 states have internal predecessors, (252), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-02 20:53:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 290 transitions. [2022-11-02 20:53:06,874 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 290 transitions. Word has length 71 [2022-11-02 20:53:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:06,874 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 290 transitions. [2022-11-02 20:53:06,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:53:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 290 transitions. [2022-11-02 20:53:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 20:53:06,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:06,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:06,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:07,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:53:07,081 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting check_seq_nextErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-02 20:53:07,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:07,081 INFO L85 PathProgramCache]: Analyzing trace with hash -574800934, now seen corresponding path program 1 times [2022-11-02 20:53:07,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:07,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664971287] [2022-11-02 20:53:07,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:07,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:09,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:53:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:53:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:15,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:15,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664971287] [2022-11-02 20:53:15,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664971287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:15,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505564245] [2022-11-02 20:53:15,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:15,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:15,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:15,309 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:15,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e0b025-2720-4485-99ec-2c262d4a1302/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:53:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 200 conjunts are in the unsatisfiable core [2022-11-02 20:53:15,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:15,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-11-02 20:53:16,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:53:16,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:53:16,606 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:53:16,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-11-02 20:53:16,629 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:53:16,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:53:16,856 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:53:16,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2022-11-02 20:53:16,865 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:53:16,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:53:16,873 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:53:16,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:53:20,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:20,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:20,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:20,219 INFO L356 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2022-11-02 20:53:20,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 36 [2022-11-02 20:53:20,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:20,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:20,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:20,256 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-02 20:53:20,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2022-11-02 20:53:20,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-02 20:53:20,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:53:20,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-02 20:53:20,309 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 20:53:20,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:53:20,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-02 20:53:20,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2022-11-02 20:53:21,077 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-02 20:53:21,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 123 treesize of output 108 [2022-11-02 20:53:21,112 INFO L356 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-02 20:53:21,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 81 [2022-11-02 20:53:21,558 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-02 20:53:21,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 81 [2022-11-02 20:53:21,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 52 [2022-11-02 20:53:21,596 INFO L356 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2022-11-02 20:53:21,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 57 [2022-11-02 20:53:22,567 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3662 (Array Int Int)) (v_ArrVal_3663 (Array Int Int)) (v_ArrVal_3664 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_3665 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_3662) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3664) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_3663) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3665)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-11-02 20:53:22,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:22,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:22,729 INFO L356 Elim1Store]: treesize reduction 84, result has 36.8 percent of original size [2022-11-02 20:53:22,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 131 treesize of output 148 [2022-11-02 20:53:22,750 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-11-02 20:53:22,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 92 treesize of output 84 [2022-11-02 20:53:22,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:22,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:22,836 INFO L356 Elim1Store]: treesize reduction 80, result has 38.9 percent of original size [2022-11-02 20:53:22,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 109 treesize of output 139 [2022-11-02 20:53:22,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:53:22,885 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-02 20:53:22,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:53:22,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:53:23,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-11-02 20:53:23,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 31 [2022-11-02 20:53:23,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 12 [2022-11-02 20:53:23,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:53:26,519 INFO L356 Elim1Store]: treesize reduction 56, result has 65.2 percent of original size [2022-11-02 20:53:26,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 182 treesize of output 242 [2022-11-02 20:53:26,660 INFO L356 Elim1Store]: treesize reduction 52, result has 63.1 percent of original size [2022-11-02 20:53:26,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 190 treesize of output 221