./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 23:00:13,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 23:00:13,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 23:00:13,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 23:00:13,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 23:00:13,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 23:00:13,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 23:00:13,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 23:00:13,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 23:00:13,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 23:00:13,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 23:00:13,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 23:00:13,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 23:00:13,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 23:00:13,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 23:00:13,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 23:00:13,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 23:00:13,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 23:00:13,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 23:00:13,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 23:00:13,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 23:00:13,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 23:00:13,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 23:00:13,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 23:00:13,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 23:00:13,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 23:00:13,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 23:00:13,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 23:00:13,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 23:00:13,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 23:00:13,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 23:00:13,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 23:00:13,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 23:00:13,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 23:00:13,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 23:00:13,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 23:00:13,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 23:00:13,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 23:00:13,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 23:00:13,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 23:00:13,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 23:00:13,956 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-06 23:00:13,973 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 23:00:13,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 23:00:13,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 23:00:13,974 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 23:00:13,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 23:00:13,975 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 23:00:13,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 23:00:13,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 23:00:13,975 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 23:00:13,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 23:00:13,976 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 23:00:13,976 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 23:00:13,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 23:00:13,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 23:00:13,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 23:00:13,976 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 23:00:13,976 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 23:00:13,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 23:00:13,976 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 23:00:13,977 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 23:00:13,977 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 23:00:13,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 23:00:13,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 23:00:13,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 23:00:13,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:00:13,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 23:00:13,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 23:00:13,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 23:00:13,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 23:00:13,978 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 23:00:13,978 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_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/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_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa 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-memcleanup) ) 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 -> 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 [2021-12-06 23:00:14,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 23:00:14,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 23:00:14,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 23:00:14,178 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 23:00:14,179 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 23:00:14,180 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2021-12-06 23:00:14,228 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/data/c1c8bf065/88ecc00174e043afa1719c06b9d11ca8/FLAG191c7297a [2021-12-06 23:00:14,656 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 23:00:14,657 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2021-12-06 23:00:14,668 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/data/c1c8bf065/88ecc00174e043afa1719c06b9d11ca8/FLAG191c7297a [2021-12-06 23:00:14,678 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/data/c1c8bf065/88ecc00174e043afa1719c06b9d11ca8 [2021-12-06 23:00:14,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 23:00:14,681 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 23:00:14,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 23:00:14,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 23:00:14,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 23:00:14,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:00:14" (1/1) ... [2021-12-06 23:00:14,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c33317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:14, skipping insertion in model container [2021-12-06 23:00:14,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:00:14" (1/1) ... [2021-12-06 23:00:14,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 23:00:14,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 23:00:14,945 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_72783c26-c273-4355-ae25-5ce53bf953be/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2021-12-06 23:00:14,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:00:14,953 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 23:00:14,982 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_72783c26-c273-4355-ae25-5ce53bf953be/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2021-12-06 23:00:14,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:00:15,003 INFO L208 MainTranslator]: Completed translation [2021-12-06 23:00:15,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:15 WrapperNode [2021-12-06 23:00:15,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 23:00:15,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 23:00:15,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 23:00:15,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 23:00:15,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:15" (1/1) ... [2021-12-06 23:00:15,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:15" (1/1) ... [2021-12-06 23:00:15,040 INFO L137 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2021-12-06 23:00:15,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 23:00:15,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 23:00:15,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 23:00:15,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 23:00:15,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:15" (1/1) ... [2021-12-06 23:00:15,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:15" (1/1) ... [2021-12-06 23:00:15,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:15" (1/1) ... [2021-12-06 23:00:15,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:15" (1/1) ... [2021-12-06 23:00:15,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:15" (1/1) ... [2021-12-06 23:00:15,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:15" (1/1) ... [2021-12-06 23:00:15,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:15" (1/1) ... [2021-12-06 23:00:15,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 23:00:15,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 23:00:15,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 23:00:15,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 23:00:15,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:15" (1/1) ... [2021-12-06 23:00:15,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:00:15,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:00:15,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 23:00:15,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 23:00:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-06 23:00:15,130 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-06 23:00:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 23:00:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 23:00:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 23:00:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 23:00:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2021-12-06 23:00:15,131 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2021-12-06 23:00:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 23:00:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 23:00:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-06 23:00:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 23:00:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 23:00:15,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 23:00:15,203 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 23:00:15,204 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 23:00:15,221 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-06 23:00:15,453 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 23:00:15,459 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 23:00:15,459 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-06 23:00:15,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:00:15 BoogieIcfgContainer [2021-12-06 23:00:15,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 23:00:15,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 23:00:15,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 23:00:15,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 23:00:15,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 11:00:14" (1/3) ... [2021-12-06 23:00:15,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278e2a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:00:15, skipping insertion in model container [2021-12-06 23:00:15,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:00:15" (2/3) ... [2021-12-06 23:00:15,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278e2a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:00:15, skipping insertion in model container [2021-12-06 23:00:15,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:00:15" (3/3) ... [2021-12-06 23:00:15,466 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2021-12-06 23:00:15,470 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 23:00:15,470 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-12-06 23:00:15,502 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 23:00:15,507 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 23:00:15,508 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-12-06 23:00:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 116 states have internal predecessors, (141), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 23:00:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 23:00:15,526 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:15,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:15,527 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting sll_appendErr1REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash -46006015, now seen corresponding path program 1 times [2021-12-06 23:00:15,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:15,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772543921] [2021-12-06 23:00:15,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:15,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:15,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:15,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772543921] [2021-12-06 23:00:15,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772543921] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:00:15,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:00:15,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 23:00:15,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606405702] [2021-12-06 23:00:15,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:00:15,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:00:15,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:15,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:00:15,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 23:00:15,695 INFO L87 Difference]: Start difference. First operand has 121 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 116 states have internal predecessors, (141), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2021-12-06 23:00:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:15,733 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2021-12-06 23:00:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:00:15,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 [2021-12-06 23:00:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:15,740 INFO L225 Difference]: With dead ends: 128 [2021-12-06 23:00:15,740 INFO L226 Difference]: Without dead ends: 122 [2021-12-06 23:00:15,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 23:00:15,744 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:15,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 259 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:00:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-06 23:00:15,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2021-12-06 23:00:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 112 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 23:00:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2021-12-06 23:00:15,782 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 10 [2021-12-06 23:00:15,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:15,782 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2021-12-06 23:00:15,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2021-12-06 23:00:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2021-12-06 23:00:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 23:00:15,783 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:15,783 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:15,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 23:00:15,783 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting sll_appendErr1REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash 244152622, now seen corresponding path program 1 times [2021-12-06 23:00:15,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:15,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540465402] [2021-12-06 23:00:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:15,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:15,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:15,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540465402] [2021-12-06 23:00:15,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540465402] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:00:15,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:00:15,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 23:00:15,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73723874] [2021-12-06 23:00:15,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:00:15,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:00:15,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:15,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:00:15,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 23:00:15,838 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-12-06 23:00:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:15,919 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2021-12-06 23:00:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:00:15,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2021-12-06 23:00:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:15,922 INFO L225 Difference]: With dead ends: 151 [2021-12-06 23:00:15,922 INFO L226 Difference]: Without dead ends: 151 [2021-12-06 23:00:15,923 INFO L932 BasicCegarLoop]: 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 [2021-12-06 23:00:15,924 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 40 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:15,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 234 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:00:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-06 23:00:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2021-12-06 23:00:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 111 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 23:00:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2021-12-06 23:00:15,934 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 13 [2021-12-06 23:00:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:15,934 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2021-12-06 23:00:15,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-12-06 23:00:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2021-12-06 23:00:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 23:00:15,935 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:15,935 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:15,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 23:00:15,935 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting sll_appendErr0REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:15,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:15,936 INFO L85 PathProgramCache]: Analyzing trace with hash 244152621, now seen corresponding path program 1 times [2021-12-06 23:00:15,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:15,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348960786] [2021-12-06 23:00:15,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:15,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:15,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:15,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348960786] [2021-12-06 23:00:15,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348960786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:00:15,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:00:15,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 23:00:15,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829953870] [2021-12-06 23:00:15,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:00:15,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:00:15,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:15,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:00:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 23:00:15,971 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-12-06 23:00:16,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:16,038 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2021-12-06 23:00:16,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:00:16,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2021-12-06 23:00:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:16,040 INFO L225 Difference]: With dead ends: 150 [2021-12-06 23:00:16,040 INFO L226 Difference]: Without dead ends: 150 [2021-12-06 23:00:16,041 INFO L932 BasicCegarLoop]: 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 [2021-12-06 23:00:16,042 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:16,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 228 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:00:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-06 23:00:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 114. [2021-12-06 23:00:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 110 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 23:00:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2021-12-06 23:00:16,054 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 13 [2021-12-06 23:00:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:16,054 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2021-12-06 23:00:16,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-12-06 23:00:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2021-12-06 23:00:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-06 23:00:16,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:16,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:16,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 23:00:16,055 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:16,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253985, now seen corresponding path program 1 times [2021-12-06 23:00:16,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:16,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583627569] [2021-12-06 23:00:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:16,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:16,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:16,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583627569] [2021-12-06 23:00:16,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583627569] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:00:16,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:00:16,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:00:16,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661554267] [2021-12-06 23:00:16,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:00:16,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:00:16,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:16,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:00:16,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:00:16,117 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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) [2021-12-06 23:00:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:16,162 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2021-12-06 23:00:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:00:16,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 14 [2021-12-06 23:00:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:16,164 INFO L225 Difference]: With dead ends: 166 [2021-12-06 23:00:16,164 INFO L226 Difference]: Without dead ends: 166 [2021-12-06 23:00:16,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:00:16,165 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 98 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:16,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 707 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:00:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-06 23:00:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 146. [2021-12-06 23:00:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 101 states have (on average 1.7326732673267327) internal successors, (175), 140 states have internal predecessors, (175), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 23:00:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 181 transitions. [2021-12-06 23:00:16,173 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 181 transitions. Word has length 14 [2021-12-06 23:00:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:16,174 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 181 transitions. [2021-12-06 23:00:16,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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) [2021-12-06 23:00:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 181 transitions. [2021-12-06 23:00:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 23:00:16,174 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:16,175 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:16,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 23:00:16,175 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:16,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:16,175 INFO L85 PathProgramCache]: Analyzing trace with hash -790832605, now seen corresponding path program 1 times [2021-12-06 23:00:16,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:16,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695382778] [2021-12-06 23:00:16,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:16,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:16,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:16,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695382778] [2021-12-06 23:00:16,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695382778] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:00:16,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408813116] [2021-12-06 23:00:16,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:16,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:16,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:00:16,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:00:16,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 23:00:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:16,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 23:00:16,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:00:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:16,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:00:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:16,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408813116] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:00:16,399 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:00:16,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2021-12-06 23:00:16,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156821515] [2021-12-06 23:00:16,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:00:16,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 23:00:16,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:16,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 23:00:16,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:00:16,400 INFO L87 Difference]: Start difference. First operand 146 states and 181 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:16,521 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2021-12-06 23:00:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:00:16,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-06 23:00:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:16,523 INFO L225 Difference]: With dead ends: 243 [2021-12-06 23:00:16,523 INFO L226 Difference]: Without dead ends: 243 [2021-12-06 23:00:16,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-06 23:00:16,524 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 291 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:16,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 896 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:00:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-06 23:00:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 185. [2021-12-06 23:00:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 138 states have (on average 1.6956521739130435) internal successors, (234), 177 states have internal predecessors, (234), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 23:00:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 242 transitions. [2021-12-06 23:00:16,538 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 242 transitions. Word has length 16 [2021-12-06 23:00:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:16,538 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 242 transitions. [2021-12-06 23:00:16,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2021-12-06 23:00:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-06 23:00:16,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:16,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:16,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 23:00:16,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:16,741 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash -924446424, now seen corresponding path program 1 times [2021-12-06 23:00:16,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:16,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133153089] [2021-12-06 23:00:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:16,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:16,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:16,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133153089] [2021-12-06 23:00:16,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133153089] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:00:16,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459256442] [2021-12-06 23:00:16,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:16,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:16,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:00:16,893 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:00:16,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 23:00:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:16,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 23:00:16,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:00:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:16,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:00:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:17,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459256442] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:00:17,039 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:00:17,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2021-12-06 23:00:17,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724641832] [2021-12-06 23:00:17,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:00:17,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 23:00:17,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:17,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 23:00:17,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-06 23:00:17,042 INFO L87 Difference]: Start difference. First operand 185 states and 242 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:17,144 INFO L93 Difference]: Finished difference Result 278 states and 327 transitions. [2021-12-06 23:00:17,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:00:17,145 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-06 23:00:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:17,147 INFO L225 Difference]: With dead ends: 278 [2021-12-06 23:00:17,147 INFO L226 Difference]: Without dead ends: 278 [2021-12-06 23:00:17,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-12-06 23:00:17,148 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 304 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:17,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 1205 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:00:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-06 23:00:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 202. [2021-12-06 23:00:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 155 states have (on average 1.6193548387096774) internal successors, (251), 194 states have internal predecessors, (251), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 23:00:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 259 transitions. [2021-12-06 23:00:17,159 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 259 transitions. Word has length 18 [2021-12-06 23:00:17,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:17,160 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 259 transitions. [2021-12-06 23:00:17,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2021-12-06 23:00:17,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 23:00:17,166 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:17,166 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:17,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 23:00:17,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-06 23:00:17,367 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:17,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1087676230, now seen corresponding path program 2 times [2021-12-06 23:00:17,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:17,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431284970] [2021-12-06 23:00:17,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:17,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-06 23:00:17,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:17,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431284970] [2021-12-06 23:00:17,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431284970] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:00:17,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652017854] [2021-12-06 23:00:17,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 23:00:17,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:17,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:00:17,470 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:00:17,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 23:00:17,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 23:00:17,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 23:00:17,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-06 23:00:17,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:00:17,561 INFO L388 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 [2021-12-06 23:00:17,585 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 23:00:17,586 INFO L388 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 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-06 23:00:17,605 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 23:00:17,606 INFO L388 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 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-06 23:00:17,638 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 23:00:17,639 INFO L388 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 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 23:00:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 23:00:17,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:00:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 23:00:17,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652017854] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:00:17,741 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:00:17,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-06 23:00:17,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204434966] [2021-12-06 23:00:17,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:00:17,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:00:17,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:00:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:00:17,742 INFO L87 Difference]: Start difference. First operand 202 states and 259 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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) [2021-12-06 23:00:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:17,806 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2021-12-06 23:00:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 23:00:17,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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 26 [2021-12-06 23:00:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:17,808 INFO L225 Difference]: With dead ends: 200 [2021-12-06 23:00:17,808 INFO L226 Difference]: Without dead ends: 200 [2021-12-06 23:00:17,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:00:17,809 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 73 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:17,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 331 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2021-12-06 23:00:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-06 23:00:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-12-06 23:00:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 155 states have (on average 1.5806451612903225) internal successors, (245), 192 states have internal predecessors, (245), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 23:00:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 253 transitions. [2021-12-06 23:00:17,816 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 253 transitions. Word has length 26 [2021-12-06 23:00:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:17,817 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 253 transitions. [2021-12-06 23:00:17,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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) [2021-12-06 23:00:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 253 transitions. [2021-12-06 23:00:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 23:00:17,818 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:17,818 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:17,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 23:00:18,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:18,020 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting sll_appendErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:18,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1087676229, now seen corresponding path program 1 times [2021-12-06 23:00:18,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:18,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080394557] [2021-12-06 23:00:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:18,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 23:00:18,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:18,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080394557] [2021-12-06 23:00:18,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080394557] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:00:18,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010412157] [2021-12-06 23:00:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:18,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:18,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:00:18,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:00:18,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 23:00:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:18,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 23:00:18,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:00:18,289 INFO L388 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 [2021-12-06 23:00:18,292 INFO L388 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 [2021-12-06 23:00:18,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:18,329 INFO L388 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 [2021-12-06 23:00:18,341 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 23:00:18,341 INFO L388 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 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-06 23:00:18,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:18,420 INFO L388 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 12 treesize of output 14 [2021-12-06 23:00:18,437 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-06 23:00:18,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-06 23:00:18,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:18,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-06 23:00:18,595 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-12-06 23:00:18,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-12-06 23:00:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:18,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:00:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:19,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010412157] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:00:19,425 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:00:19,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2021-12-06 23:00:19,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173951798] [2021-12-06 23:00:19,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:00:19,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 23:00:19,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:19,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 23:00:19,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-12-06 23:00:19,426 INFO L87 Difference]: Start difference. First operand 200 states and 253 transitions. Second operand has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 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) [2021-12-06 23:00:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:19,524 INFO L93 Difference]: Finished difference Result 206 states and 258 transitions. [2021-12-06 23:00:19,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:00:19,524 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 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 26 [2021-12-06 23:00:19,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:19,526 INFO L225 Difference]: With dead ends: 206 [2021-12-06 23:00:19,526 INFO L226 Difference]: Without dead ends: 206 [2021-12-06 23:00:19,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2021-12-06 23:00:19,527 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 37 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:19,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 325 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 116 Unchecked, 0.0s Time] [2021-12-06 23:00:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-06 23:00:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 199. [2021-12-06 23:00:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 155 states have (on average 1.5612903225806452) internal successors, (242), 191 states have internal predecessors, (242), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 23:00:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2021-12-06 23:00:19,535 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 26 [2021-12-06 23:00:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:19,535 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2021-12-06 23:00:19,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 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) [2021-12-06 23:00:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2021-12-06 23:00:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-06 23:00:19,536 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:19,537 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:19,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 23:00:19,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:19,738 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting sll_appendErr5REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:19,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1579803684, now seen corresponding path program 1 times [2021-12-06 23:00:19,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:19,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196129904] [2021-12-06 23:00:19,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:19,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 23:00:19,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:19,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196129904] [2021-12-06 23:00:19,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196129904] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:00:19,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:00:19,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 23:00:19,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949649482] [2021-12-06 23:00:19,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:00:19,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 23:00:19,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:19,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 23:00:19,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 23:00:19,893 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2021-12-06 23:00:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:19,918 INFO L93 Difference]: Finished difference Result 198 states and 247 transitions. [2021-12-06 23:00:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:00:19,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 28 [2021-12-06 23:00:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:19,920 INFO L225 Difference]: With dead ends: 198 [2021-12-06 23:00:19,920 INFO L226 Difference]: Without dead ends: 198 [2021-12-06 23:00:19,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 23:00:19,921 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:19,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 188 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:00:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-06 23:00:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-06 23:00:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 155 states have (on average 1.5419354838709678) internal successors, (239), 190 states have internal predecessors, (239), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 23:00:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2021-12-06 23:00:19,927 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 28 [2021-12-06 23:00:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:19,928 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2021-12-06 23:00:19,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2021-12-06 23:00:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2021-12-06 23:00:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 23:00:19,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:19,929 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:19,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 23:00:19,929 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting sll_appendErr6REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:19,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash 320066679, now seen corresponding path program 1 times [2021-12-06 23:00:19,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:19,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219407527] [2021-12-06 23:00:19,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:19,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 23:00:19,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:19,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219407527] [2021-12-06 23:00:19,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219407527] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:00:19,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:00:19,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 23:00:19,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864189065] [2021-12-06 23:00:19,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:00:19,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:00:19,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:19,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:00:19,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:00:19,972 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-12-06 23:00:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:20,036 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2021-12-06 23:00:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 23:00:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 31 [2021-12-06 23:00:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:20,038 INFO L225 Difference]: With dead ends: 197 [2021-12-06 23:00:20,038 INFO L226 Difference]: Without dead ends: 197 [2021-12-06 23:00:20,038 INFO L932 BasicCegarLoop]: 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 [2021-12-06 23:00:20,038 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 83 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:20,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 288 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:00:20,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-06 23:00:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-12-06 23:00:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 155 states have (on average 1.5225806451612902) internal successors, (236), 189 states have internal predecessors, (236), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 23:00:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 244 transitions. [2021-12-06 23:00:20,044 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 244 transitions. Word has length 31 [2021-12-06 23:00:20,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:20,044 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 244 transitions. [2021-12-06 23:00:20,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-12-06 23:00:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2021-12-06 23:00:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 23:00:20,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:20,045 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:20,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 23:00:20,046 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting sll_appendErr7REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:20,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:20,046 INFO L85 PathProgramCache]: Analyzing trace with hash 320066680, now seen corresponding path program 1 times [2021-12-06 23:00:20,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:20,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542449771] [2021-12-06 23:00:20,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:20,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 23:00:20,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:20,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542449771] [2021-12-06 23:00:20,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542449771] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:00:20,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:00:20,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 23:00:20,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64220253] [2021-12-06 23:00:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:00:20,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:00:20,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:00:20,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:00:20,100 INFO L87 Difference]: Start difference. First operand 197 states and 244 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-12-06 23:00:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:20,165 INFO L93 Difference]: Finished difference Result 196 states and 241 transitions. [2021-12-06 23:00:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 23:00:20,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 31 [2021-12-06 23:00:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:20,167 INFO L225 Difference]: With dead ends: 196 [2021-12-06 23:00:20,167 INFO L226 Difference]: Without dead ends: 196 [2021-12-06 23:00:20,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:00:20,168 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:20,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 326 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:00:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-06 23:00:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-12-06 23:00:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 155 states have (on average 1.5032258064516129) internal successors, (233), 188 states have internal predecessors, (233), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 23:00:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 241 transitions. [2021-12-06 23:00:20,174 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 241 transitions. Word has length 31 [2021-12-06 23:00:20,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:20,175 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 241 transitions. [2021-12-06 23:00:20,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-12-06 23:00:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 241 transitions. [2021-12-06 23:00:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-06 23:00:20,176 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:20,176 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:20,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 23:00:20,176 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting sll_appendErr8REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132480, now seen corresponding path program 1 times [2021-12-06 23:00:20,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:20,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051705549] [2021-12-06 23:00:20,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:20,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 23:00:20,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:20,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051705549] [2021-12-06 23:00:20,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051705549] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:00:20,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170302359] [2021-12-06 23:00:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:20,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:20,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:00:20,270 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:00:20,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 23:00:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:20,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-06 23:00:20,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:00:20,341 INFO L388 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 [2021-12-06 23:00:20,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:20,370 INFO L388 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 [2021-12-06 23:00:20,391 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 23:00:20,391 INFO L388 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 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 23:00:20,417 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 23:00:20,417 INFO L388 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 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 23:00:20,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:20,441 INFO L388 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 [2021-12-06 23:00:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 23:00:20,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:00:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 23:00:20,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170302359] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:00:20,765 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:00:20,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2021-12-06 23:00:20,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186186366] [2021-12-06 23:00:20,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:00:20,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 23:00:20,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:20,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 23:00:20,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-06 23:00:20,767 INFO L87 Difference]: Start difference. First operand 196 states and 241 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:20,868 INFO L93 Difference]: Finished difference Result 292 states and 358 transitions. [2021-12-06 23:00:20,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:00:20,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-06 23:00:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:20,871 INFO L225 Difference]: With dead ends: 292 [2021-12-06 23:00:20,871 INFO L226 Difference]: Without dead ends: 292 [2021-12-06 23:00:20,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-06 23:00:20,872 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 79 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:20,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 463 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 143 Unchecked, 0.1s Time] [2021-12-06 23:00:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-12-06 23:00:20,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 283. [2021-12-06 23:00:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 273 states have internal predecessors, (342), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-06 23:00:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 356 transitions. [2021-12-06 23:00:20,883 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 356 transitions. Word has length 32 [2021-12-06 23:00:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:20,883 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 356 transitions. [2021-12-06 23:00:20,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 356 transitions. [2021-12-06 23:00:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-06 23:00:20,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:20,884 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:20,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 23:00:21,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-06 23:00:21,085 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting sll_appendErr9REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:21,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:21,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132481, now seen corresponding path program 1 times [2021-12-06 23:00:21,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:21,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385890291] [2021-12-06 23:00:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:21,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 23:00:21,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:21,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385890291] [2021-12-06 23:00:21,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385890291] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:00:21,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358573723] [2021-12-06 23:00:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:21,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:21,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:00:21,248 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:00:21,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 23:00:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:21,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-06 23:00:21,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:00:21,314 INFO L388 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 [2021-12-06 23:00:21,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:21,354 INFO L388 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 [2021-12-06 23:00:21,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:21,374 INFO L388 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 [2021-12-06 23:00:21,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:21,393 INFO L388 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 [2021-12-06 23:00:21,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:21,413 INFO L388 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 [2021-12-06 23:00:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 23:00:21,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:00:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 23:00:22,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358573723] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:00:22,189 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:00:22,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-12-06 23:00:22,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069133874] [2021-12-06 23:00:22,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:00:22,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 23:00:22,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:22,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 23:00:22,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-06 23:00:22,190 INFO L87 Difference]: Start difference. First operand 283 states and 356 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:22,320 INFO L93 Difference]: Finished difference Result 304 states and 371 transitions. [2021-12-06 23:00:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 23:00:22,321 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-06 23:00:22,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:22,323 INFO L225 Difference]: With dead ends: 304 [2021-12-06 23:00:22,323 INFO L226 Difference]: Without dead ends: 304 [2021-12-06 23:00:22,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-12-06 23:00:22,324 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 180 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:22,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 347 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 102 Unchecked, 0.1s Time] [2021-12-06 23:00:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-12-06 23:00:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 277. [2021-12-06 23:00:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 267 states have internal predecessors, (328), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-06 23:00:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 342 transitions. [2021-12-06 23:00:22,332 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 342 transitions. Word has length 32 [2021-12-06 23:00:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:22,332 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 342 transitions. [2021-12-06 23:00:22,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 342 transitions. [2021-12-06 23:00:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 23:00:22,333 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:22,333 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 23:00:22,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 23:00:22,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-06 23:00:22,534 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:22,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:22,534 INFO L85 PathProgramCache]: Analyzing trace with hash 60922559, now seen corresponding path program 1 times [2021-12-06 23:00:22,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:22,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39492015] [2021-12-06 23:00:22,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:22,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 23:00:22,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:22,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39492015] [2021-12-06 23:00:22,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39492015] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:00:22,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179665307] [2021-12-06 23:00:22,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:22,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:22,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:00:22,732 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:00:22,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 23:00:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:22,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-06 23:00:22,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:00:22,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:22,935 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:22,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:22,938 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:23,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:23,030 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:23,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:23,033 INFO L388 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 18 [2021-12-06 23:00:23,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:23,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:23,144 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 23:00:23,145 INFO L388 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 1 case distinctions, treesize of input 21 treesize of output 30 [2021-12-06 23:00:23,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:23,151 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:23,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:23,202 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:23,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:23,207 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:23,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:23,221 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:23,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:23,224 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:23,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:23,282 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:23,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:23,286 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:23,305 INFO L388 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 [2021-12-06 23:00:23,308 INFO L388 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 [2021-12-06 23:00:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:23,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:00:23,327 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_590 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-06 23:00:23,333 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_590 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-06 23:00:23,339 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_590 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-06 23:00:23,366 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-06 23:00:23,386 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|))) is different from false [2021-12-06 23:00:23,426 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|))) is different from false [2021-12-06 23:00:23,515 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) is different from false [2021-12-06 23:00:23,596 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) is different from false [2021-12-06 23:00:23,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) is different from false [2021-12-06 23:00:23,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_33| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_33|) (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) is different from false [2021-12-06 23:00:24,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_33| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_589) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_590) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_33|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) is different from false [2021-12-06 23:00:26,578 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_33| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_589) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_590) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_33|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) is different from false [2021-12-06 23:00:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2021-12-06 23:00:27,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179665307] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:00:27,164 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:00:27,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 38 [2021-12-06 23:00:27,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028341171] [2021-12-06 23:00:27,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:00:27,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-06 23:00:27,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:27,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-06 23:00:27,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=544, Unknown=12, NotChecked=708, Total=1406 [2021-12-06 23:00:27,166 INFO L87 Difference]: Start difference. First operand 277 states and 342 transitions. Second operand has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 35 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:29,172 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_33| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_589) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_590) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_33|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) is different from false [2021-12-06 23:00:29,179 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|))) (and (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0) (= |c_sll_append_#in~head#1.offset| 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (= (select .cse1 |c_sll_append_#in~head#1.offset|) 0) (= (select .cse1 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_33| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_589) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_579))) (store .cse2 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse2 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_590) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_33|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_18|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (= (select .cse0 0) 0) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|))) is different from false [2021-12-06 23:00:31,185 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_33| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_33|) (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_33| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-06 23:00:33,190 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_578) |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_579))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|)))) is different from false [2021-12-06 23:00:35,195 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-06 23:00:35,200 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_32| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_32|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_32|))) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-06 23:00:35,229 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_580) |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-06 23:00:35,233 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) 0) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-06 23:00:35,237 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int)) (or (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_583) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_590) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_31| v_ArrVal_584) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_589) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_31|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) 0) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-06 23:00:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:38,465 INFO L93 Difference]: Finished difference Result 317 states and 387 transitions. [2021-12-06 23:00:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 23:00:38,466 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 35 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-06 23:00:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:38,467 INFO L225 Difference]: With dead ends: 317 [2021-12-06 23:00:38,468 INFO L226 Difference]: Without dead ends: 317 [2021-12-06 23:00:38,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=217, Invalid=838, Unknown=21, NotChecked=1680, Total=2756 [2021-12-06 23:00:38,469 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 20 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:38,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 1555 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 232 Invalid, 0 Unknown, 377 Unchecked, 0.1s Time] [2021-12-06 23:00:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-12-06 23:00:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 308. [2021-12-06 23:00:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 267 states have (on average 1.344569288389513) internal successors, (359), 297 states have internal predecessors, (359), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-06 23:00:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 376 transitions. [2021-12-06 23:00:38,477 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 376 transitions. Word has length 35 [2021-12-06 23:00:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:38,477 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 376 transitions. [2021-12-06 23:00:38,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 35 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 376 transitions. [2021-12-06 23:00:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 23:00:38,478 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:38,478 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 23:00:38,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-06 23:00:38,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-06 23:00:38,679 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:38,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:38,679 INFO L85 PathProgramCache]: Analyzing trace with hash 762522433, now seen corresponding path program 1 times [2021-12-06 23:00:38,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:38,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710484380] [2021-12-06 23:00:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:38,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 23:00:38,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:38,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710484380] [2021-12-06 23:00:38,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710484380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:00:38,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:00:38,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 23:00:38,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835316982] [2021-12-06 23:00:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:00:38,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:00:38,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:38,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:00:38,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 23:00:38,696 INFO L87 Difference]: Start difference. First operand 308 states and 376 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2021-12-06 23:00:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:38,703 INFO L93 Difference]: Finished difference Result 278 states and 335 transitions. [2021-12-06 23:00:38,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:00:38,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 35 [2021-12-06 23:00:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:38,704 INFO L225 Difference]: With dead ends: 278 [2021-12-06 23:00:38,704 INFO L226 Difference]: Without dead ends: 278 [2021-12-06 23:00:38,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 23:00:38,705 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:38,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:00:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-06 23:00:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2021-12-06 23:00:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 239 states have (on average 1.3430962343096233) internal successors, (321), 268 states have internal predecessors, (321), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-06 23:00:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 335 transitions. [2021-12-06 23:00:38,711 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 335 transitions. Word has length 35 [2021-12-06 23:00:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:38,711 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 335 transitions. [2021-12-06 23:00:38,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2021-12-06 23:00:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 335 transitions. [2021-12-06 23:00:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 23:00:38,712 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:38,712 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 23:00:38,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 23:00:38,712 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting sll_appendErr8REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash 444674194, now seen corresponding path program 1 times [2021-12-06 23:00:38,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:38,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19853530] [2021-12-06 23:00:38,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:38,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-06 23:00:38,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:38,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19853530] [2021-12-06 23:00:38,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19853530] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:00:38,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941492118] [2021-12-06 23:00:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:38,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:38,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:00:38,755 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:00:38,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 23:00:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:38,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 23:00:38,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:00:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 23:00:38,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:00:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 23:00:38,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941492118] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:00:38,902 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:00:38,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2021-12-06 23:00:38,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324972] [2021-12-06 23:00:38,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:00:38,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 23:00:38,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:38,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 23:00:38,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-06 23:00:38,903 INFO L87 Difference]: Start difference. First operand 278 states and 335 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:38,956 INFO L93 Difference]: Finished difference Result 293 states and 343 transitions. [2021-12-06 23:00:38,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:00:38,956 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 23:00:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:38,958 INFO L225 Difference]: With dead ends: 293 [2021-12-06 23:00:38,958 INFO L226 Difference]: Without dead ends: 293 [2021-12-06 23:00:38,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-12-06 23:00:38,959 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 202 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:38,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 831 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:00:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-06 23:00:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 286. [2021-12-06 23:00:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 247 states have (on average 1.3319838056680162) internal successors, (329), 276 states have internal predecessors, (329), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-06 23:00:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 343 transitions. [2021-12-06 23:00:38,965 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 343 transitions. Word has length 36 [2021-12-06 23:00:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:38,966 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 343 transitions. [2021-12-06 23:00:38,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 343 transitions. [2021-12-06 23:00:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 23:00:38,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:38,967 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:38,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 23:00:39,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:39,167 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash -308582730, now seen corresponding path program 1 times [2021-12-06 23:00:39,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:39,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690679553] [2021-12-06 23:00:39,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:39,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:39,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:39,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690679553] [2021-12-06 23:00:39,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690679553] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:00:39,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726589730] [2021-12-06 23:00:39,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:39,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:39,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:00:39,227 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:00:39,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 23:00:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:39,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-06 23:00:39,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:00:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:39,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:00:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:00:39,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726589730] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:00:39,387 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:00:39,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 11 [2021-12-06 23:00:39,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140456031] [2021-12-06 23:00:39,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:00:39,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 23:00:39,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 23:00:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:00:39,389 INFO L87 Difference]: Start difference. First operand 286 states and 343 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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) [2021-12-06 23:00:39,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:39,474 INFO L93 Difference]: Finished difference Result 359 states and 416 transitions. [2021-12-06 23:00:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:00:39,474 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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 40 [2021-12-06 23:00:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:39,476 INFO L225 Difference]: With dead ends: 359 [2021-12-06 23:00:39,476 INFO L226 Difference]: Without dead ends: 359 [2021-12-06 23:00:39,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-12-06 23:00:39,477 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 160 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:39,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 996 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:00:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-12-06 23:00:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 313. [2021-12-06 23:00:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 274 states have (on average 1.3467153284671534) internal successors, (369), 303 states have internal predecessors, (369), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-06 23:00:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 383 transitions. [2021-12-06 23:00:39,484 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 383 transitions. Word has length 40 [2021-12-06 23:00:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:39,485 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 383 transitions. [2021-12-06 23:00:39,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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) [2021-12-06 23:00:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 383 transitions. [2021-12-06 23:00:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 23:00:39,485 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:39,485 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 23:00:39,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 23:00:39,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 23:00:39,686 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting sll_appendErr8REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:39,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:39,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785188, now seen corresponding path program 2 times [2021-12-06 23:00:39,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:39,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717819976] [2021-12-06 23:00:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:39,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 23:00:39,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:39,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717819976] [2021-12-06 23:00:39,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717819976] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:00:39,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541848185] [2021-12-06 23:00:39,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 23:00:39,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:39,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:00:39,779 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:00:39,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 23:00:39,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 23:00:39,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 23:00:39,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-06 23:00:39,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:00:39,866 INFO L388 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 [2021-12-06 23:00:39,924 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 23:00:39,925 INFO L388 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 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-06 23:00:39,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:39,946 INFO L388 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 [2021-12-06 23:00:39,963 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 23:00:39,963 INFO L388 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 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 23:00:40,007 INFO L354 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-12-06 23:00:40,008 INFO L388 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 [2021-12-06 23:00:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-06 23:00:40,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:00:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-06 23:00:40,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541848185] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:00:40,615 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:00:40,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2021-12-06 23:00:40,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349093850] [2021-12-06 23:00:40,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:00:40,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-06 23:00:40,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-06 23:00:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-12-06 23:00:40,616 INFO L87 Difference]: Start difference. First operand 313 states and 383 transitions. Second operand has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:00:40,816 INFO L93 Difference]: Finished difference Result 355 states and 428 transitions. [2021-12-06 23:00:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 23:00:40,816 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-06 23:00:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:00:40,818 INFO L225 Difference]: With dead ends: 355 [2021-12-06 23:00:40,818 INFO L226 Difference]: Without dead ends: 355 [2021-12-06 23:00:40,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-06 23:00:40,819 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 276 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:00:40,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 677 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 274 Invalid, 0 Unknown, 149 Unchecked, 0.1s Time] [2021-12-06 23:00:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-12-06 23:00:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 349. [2021-12-06 23:00:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 308 states have (on average 1.3376623376623376) internal successors, (412), 338 states have internal predecessors, (412), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-06 23:00:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 428 transitions. [2021-12-06 23:00:40,827 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 428 transitions. Word has length 44 [2021-12-06 23:00:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:00:40,827 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 428 transitions. [2021-12-06 23:00:40,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 428 transitions. [2021-12-06 23:00:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 23:00:40,828 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:00:40,828 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:00:40,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-06 23:00:41,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 23:00:41,028 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:00:41,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:00:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash 685803597, now seen corresponding path program 2 times [2021-12-06 23:00:41,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:00:41,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938546452] [2021-12-06 23:00:41,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:00:41,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:00:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:00:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 23:00:41,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:00:41,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938546452] [2021-12-06 23:00:41,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938546452] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:00:41,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247021781] [2021-12-06 23:00:41,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 23:00:41,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:00:41,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:00:41,231 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:00:41,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 23:00:41,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 23:00:41,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 23:00:41,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-06 23:00:41,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:00:41,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,479 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:41,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,482 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:41,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,573 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:41,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,575 INFO L388 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 18 [2021-12-06 23:00:41,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,675 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:41,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,685 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 23:00:41,685 INFO L388 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 1 case distinctions, treesize of input 21 treesize of output 30 [2021-12-06 23:00:41,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,751 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:41,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,754 INFO L388 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 18 [2021-12-06 23:00:41,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,835 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 23:00:41,835 INFO L388 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 1 case distinctions, treesize of input 21 treesize of output 30 [2021-12-06 23:00:41,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,852 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:41,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,882 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:41,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,887 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:41,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,935 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:41,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:00:41,938 INFO L388 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 14 treesize of output 16 [2021-12-06 23:00:41,956 INFO L388 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 [2021-12-06 23:00:41,957 INFO L388 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 [2021-12-06 23:00:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 23:00:41,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:00:41,973 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1009 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-06 23:00:41,986 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1009 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_#res#1.base| |v_sll_append_~new_last~0#1.base_13|))) is different from false [2021-12-06 23:00:42,003 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1009 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-06 23:00:42,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-06 23:00:42,117 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-06 23:00:42,202 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-06 23:00:42,271 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-06 23:00:42,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-06 23:00:42,560 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-06 23:00:42,862 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-06 23:00:43,161 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-06 23:00:43,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-06 23:00:43,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_995))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) is different from false [2021-12-06 23:00:44,049 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_995))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_50|))) is different from false [2021-12-06 23:00:44,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_995))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_50|))) is different from false [2021-12-06 23:00:45,198 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_995))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_50|))) is different from false [2021-12-06 23:00:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 28 not checked. [2021-12-06 23:00:48,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247021781] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:00:48,416 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:00:48,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 21] total 44 [2021-12-06 23:00:48,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018656130] [2021-12-06 23:00:48,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:00:48,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-06 23:00:48,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:00:48,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-06 23:00:48,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=632, Unknown=16, NotChecked=1072, Total=1892 [2021-12-06 23:00:48,418 INFO L87 Difference]: Start difference. First operand 349 states and 428 transitions. Second operand has 44 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 41 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:00:50,427 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_995))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_50|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) is different from false [2021-12-06 23:00:52,436 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|))) (and (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse1 (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_995))) (store .cse2 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse2 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_50|))) (= |c_sll_append_#in~head#1.offset| 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (= (select .cse3 |c_sll_append_#in~head#1.offset|) 0) (= (select .cse3 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (= (select .cse0 0) 0) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|))) is different from false [2021-12-06 23:00:54,441 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_995))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_50|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-06 23:00:56,448 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_994 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_994) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_995))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-06 23:00:58,455 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-06 23:01:00,463 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_49|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-06 23:01:02,470 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_996) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-06 23:01:04,476 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_48|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) 0) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-06 23:01:06,484 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1000))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_999) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) 0) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-06 23:01:08,488 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-06 23:01:10,493 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_47|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) is different from false [2021-12-06 23:01:20,526 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1002) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-06 23:02:24,618 WARN L227 SmtUtils]: Spent 44.06s on a formula simplification. DAG size of input: 47 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 23:03:34,724 WARN L227 SmtUtils]: Spent 48.06s on a formula simplification. DAG size of input: 47 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 23:04:46,844 WARN L227 SmtUtils]: Spent 32.04s on a formula simplification. DAG size of input: 46 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 23:04:52,911 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< (+ |c_sll_append_node_create_with_sublist_~new_node~0#1.base| 1) |c_sll_append_~head#1.base|) (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1007) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1006) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) is different from false [2021-12-06 23:04:56,949 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1009 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< (+ |c_sll_append_node_create_with_sublist_~new_node~0#1.base| 1) |c_sll_append_~head#1.base|)) is different from false [2021-12-06 23:04:58,979 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1009 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1009) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1008) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_#res#1.base| |v_sll_append_~new_last~0#1.base_13|))) (< (+ |c_sll_append_node_create_with_sublist_#res#1.base| 1) |c_sll_append_~head#1.base|)) is different from false [2021-12-06 23:05:07,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:05:07,140 INFO L93 Difference]: Finished difference Result 425 states and 515 transitions. [2021-12-06 23:05:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 23:05:07,140 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 41 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-06 23:05:07,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:05:07,142 INFO L225 Difference]: With dead ends: 425 [2021-12-06 23:05:07,142 INFO L226 Difference]: Without dead ends: 425 [2021-12-06 23:05:07,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 31 IntricatePredicates, 1 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 258.9s TimeCoverageRelationStatistics Valid=302, Invalid=1147, Unknown=81, NotChecked=3162, Total=4692 [2021-12-06 23:05:07,144 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 31 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 658 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:05:07,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 1864 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 357 Invalid, 0 Unknown, 658 Unchecked, 0.2s Time] [2021-12-06 23:05:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-12-06 23:05:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 396. [2021-12-06 23:05:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 352 states have (on average 1.3125) internal successors, (462), 384 states have internal predecessors, (462), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (12), 4 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-06 23:05:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 484 transitions. [2021-12-06 23:05:07,152 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 484 transitions. Word has length 44 [2021-12-06 23:05:07,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:05:07,152 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 484 transitions. [2021-12-06 23:05:07,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 41 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:05:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 484 transitions. [2021-12-06 23:05:07,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 23:05:07,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:05:07,153 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:05:07,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 23:05:07,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:05:07,354 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:05:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:05:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash -686003701, now seen corresponding path program 1 times [2021-12-06 23:05:07,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:05:07,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919527270] [2021-12-06 23:05:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:07,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:05:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-06 23:05:07,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:05:07,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919527270] [2021-12-06 23:05:07,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919527270] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:05:07,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:05:07,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 23:05:07,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369318719] [2021-12-06 23:05:07,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:05:07,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 23:05:07,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:05:07,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 23:05:07,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 23:05:07,414 INFO L87 Difference]: Start difference. First operand 396 states and 484 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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) [2021-12-06 23:05:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:05:07,427 INFO L93 Difference]: Finished difference Result 436 states and 531 transitions. [2021-12-06 23:05:07,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 23:05:07,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 44 [2021-12-06 23:05:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:05:07,429 INFO L225 Difference]: With dead ends: 436 [2021-12-06 23:05:07,429 INFO L226 Difference]: Without dead ends: 436 [2021-12-06 23:05:07,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:05:07,430 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 69 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:05:07,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 334 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:05:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-12-06 23:05:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 345. [2021-12-06 23:05:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 304 states have (on average 1.305921052631579) internal successors, (397), 334 states have internal predecessors, (397), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-06 23:05:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 413 transitions. [2021-12-06 23:05:07,437 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 413 transitions. Word has length 44 [2021-12-06 23:05:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:05:07,437 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 413 transitions. [2021-12-06 23:05:07,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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) [2021-12-06 23:05:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 413 transitions. [2021-12-06 23:05:07,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-06 23:05:07,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:05:07,438 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 23:05:07,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 23:05:07,438 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:05:07,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:05:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1834257435, now seen corresponding path program 1 times [2021-12-06 23:05:07,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:05:07,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038858017] [2021-12-06 23:05:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:07,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:05:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:07,629 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-06 23:05:07,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:05:07,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038858017] [2021-12-06 23:05:07,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038858017] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:05:07,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711764259] [2021-12-06 23:05:07,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:07,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:05:07,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:05:07,631 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:05:07,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 23:05:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:07,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-06 23:05:07,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:05:07,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:07,946 INFO L388 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 14 treesize of output 16 [2021-12-06 23:05:07,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:07,949 INFO L388 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 14 treesize of output 16 [2021-12-06 23:05:08,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:08,039 INFO L388 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 14 treesize of output 16 [2021-12-06 23:05:08,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:08,042 INFO L388 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 18 [2021-12-06 23:05:08,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:08,177 INFO L388 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 14 treesize of output 16 [2021-12-06 23:05:08,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:08,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:08,185 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-06 23:05:08,185 INFO L388 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 1 case distinctions, treesize of input 26 treesize of output 28 [2021-12-06 23:05:08,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:08,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:08,269 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 23:05:08,269 INFO L388 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 1 case distinctions, treesize of input 21 treesize of output 30 [2021-12-06 23:05:08,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:08,280 INFO L388 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 14 treesize of output 16 [2021-12-06 23:05:08,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:08,307 INFO L388 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 14 treesize of output 16 [2021-12-06 23:05:08,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:08,311 INFO L388 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 14 treesize of output 16 [2021-12-06 23:05:08,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:08,362 INFO L388 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 14 treesize of output 16 [2021-12-06 23:05:08,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:08,364 INFO L388 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 14 treesize of output 16 [2021-12-06 23:05:08,381 INFO L388 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 [2021-12-06 23:05:08,382 INFO L388 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 [2021-12-06 23:05:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 23:05:08,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:05:08,399 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1169 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-06 23:05:08,405 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1169 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-06 23:05:08,411 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1169 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-06 23:05:08,440 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-06 23:05:08,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))))) is different from false [2021-12-06 23:05:08,486 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (and (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|))) is different from false [2021-12-06 23:05:08,512 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-06 23:05:08,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) is different from false [2021-12-06 23:05:08,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) is different from false [2021-12-06 23:05:08,771 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1156 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1156))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1157) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) is different from false [2021-12-06 23:05:08,943 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_55|) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_1157) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1156 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_1156))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) is different from false [2021-12-06 23:05:09,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_23| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_55|) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1156 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_1156))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_23| v_ArrVal_1168) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_1157) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_23| v_ArrVal_1169) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_23|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) is different from false [2021-12-06 23:05:09,501 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_23| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_55|) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1156 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_1156))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_23| v_ArrVal_1168) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_1157) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_23| v_ArrVal_1169) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_23|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) is different from false [2021-12-06 23:05:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 15 not checked. [2021-12-06 23:05:11,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711764259] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:05:11,912 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:05:11,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 41 [2021-12-06 23:05:11,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637544931] [2021-12-06 23:05:11,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:05:11,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-06 23:05:11,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:05:11,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-06 23:05:11,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=632, Unknown=13, NotChecked=832, Total=1640 [2021-12-06 23:05:11,914 INFO L87 Difference]: Start difference. First operand 345 states and 413 transitions. Second operand has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 38 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:05:13,922 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_23| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_55|) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1156 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_1156))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_23| v_ArrVal_1168) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_1157) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_23| v_ArrVal_1169) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_23|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) is different from false [2021-12-06 23:05:13,946 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0) (= |c_sll_append_#in~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_23| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_55|) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1156 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_1156))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_23| v_ArrVal_1168) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_1157) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_23| v_ArrVal_1169) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_23|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|)) is different from false [2021-12-06 23:05:13,958 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_55|) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_1157) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1156 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_1156))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-06 23:05:13,976 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1156 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1156))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1157) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-06 23:05:15,982 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-06 23:05:17,986 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-06 23:05:19,997 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1159) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-12-06 23:05:22,009 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (and (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset|) 0)))) is different from false [2021-12-06 23:05:24,016 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_1168 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_53| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_53|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1168) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_1163) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1169) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~head~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-06 23:05:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:05:25,193 INFO L93 Difference]: Finished difference Result 362 states and 424 transitions. [2021-12-06 23:05:25,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 23:05:25,193 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 38 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-06 23:05:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:05:25,195 INFO L225 Difference]: With dead ends: 362 [2021-12-06 23:05:25,195 INFO L226 Difference]: Without dead ends: 362 [2021-12-06 23:05:25,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=243, Invalid=1083, Unknown=22, NotChecked=1958, Total=3306 [2021-12-06 23:05:25,196 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 33 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 883 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:05:25,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 2101 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 0 Unknown, 883 Unchecked, 0.2s Time] [2021-12-06 23:05:25,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-12-06 23:05:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 340. [2021-12-06 23:05:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 299 states have (on average 1.2842809364548495) internal successors, (384), 329 states have internal predecessors, (384), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-06 23:05:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 400 transitions. [2021-12-06 23:05:25,204 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 400 transitions. Word has length 47 [2021-12-06 23:05:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:05:25,204 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 400 transitions. [2021-12-06 23:05:25,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 38 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:05:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 400 transitions. [2021-12-06 23:05:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-06 23:05:25,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:05:25,205 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 23:05:25,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-06 23:05:25,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-06 23:05:25,405 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:05:25,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:05:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1659810607, now seen corresponding path program 1 times [2021-12-06 23:05:25,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:05:25,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735835396] [2021-12-06 23:05:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:25,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:05:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:25,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 23:05:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-06 23:05:25,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:05:25,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735835396] [2021-12-06 23:05:25,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735835396] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:05:25,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108292182] [2021-12-06 23:05:25,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:25,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:05:25,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:05:25,478 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:05:25,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 23:05:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:25,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 23:05:25,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:05:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 23:05:25,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:05:25,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108292182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:05:25,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:05:25,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-06 23:05:25,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752858950] [2021-12-06 23:05:25,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:05:25,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 23:05:25,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:05:25,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 23:05:25,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:05:25,657 INFO L87 Difference]: Start difference. First operand 340 states and 400 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) [2021-12-06 23:05:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:05:25,684 INFO L93 Difference]: Finished difference Result 396 states and 462 transitions. [2021-12-06 23:05:25,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 23:05:25,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 54 [2021-12-06 23:05:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:05:25,686 INFO L225 Difference]: With dead ends: 396 [2021-12-06 23:05:25,686 INFO L226 Difference]: Without dead ends: 396 [2021-12-06 23:05:25,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:05:25,687 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 192 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:05:25,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 239 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:05:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-12-06 23:05:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 340. [2021-12-06 23:05:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 299 states have (on average 1.2842809364548495) internal successors, (384), 329 states have internal predecessors, (384), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-06 23:05:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 400 transitions. [2021-12-06 23:05:25,694 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 400 transitions. Word has length 54 [2021-12-06 23:05:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:05:25,694 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 400 transitions. [2021-12-06 23:05:25,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) [2021-12-06 23:05:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 400 transitions. [2021-12-06 23:05:25,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-06 23:05:25,695 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:05:25,695 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 23:05:25,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 23:05:25,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:05:25,896 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:05:25,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:05:25,897 INFO L85 PathProgramCache]: Analyzing trace with hash -85479915, now seen corresponding path program 1 times [2021-12-06 23:05:25,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:05:25,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586853411] [2021-12-06 23:05:25,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:25,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:05:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:25,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 23:05:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 23:05:26,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:05:26,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586853411] [2021-12-06 23:05:26,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586853411] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:05:26,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:05:26,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 23:05:26,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174062516] [2021-12-06 23:05:26,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:05:26,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 23:05:26,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:05:26,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 23:05:26,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:05:26,042 INFO L87 Difference]: Start difference. First operand 340 states and 400 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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) [2021-12-06 23:05:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:05:26,274 INFO L93 Difference]: Finished difference Result 554 states and 667 transitions. [2021-12-06 23:05:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 23:05:26,274 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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 55 [2021-12-06 23:05:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:05:26,277 INFO L225 Difference]: With dead ends: 554 [2021-12-06 23:05:26,277 INFO L226 Difference]: Without dead ends: 554 [2021-12-06 23:05:26,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-12-06 23:05:26,278 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 284 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:05:26,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 695 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:05:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-12-06 23:05:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 355. [2021-12-06 23:05:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 314 states have (on average 1.2929936305732483) internal successors, (406), 343 states have internal predecessors, (406), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-06 23:05:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 423 transitions. [2021-12-06 23:05:26,289 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 423 transitions. Word has length 55 [2021-12-06 23:05:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:05:26,289 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 423 transitions. [2021-12-06 23:05:26,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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) [2021-12-06 23:05:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 423 transitions. [2021-12-06 23:05:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-06 23:05:26,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:05:26,290 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 23:05:26,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-06 23:05:26,291 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:05:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:05:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash -85479914, now seen corresponding path program 1 times [2021-12-06 23:05:26,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:05:26,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158624740] [2021-12-06 23:05:26,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:26,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:05:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:26,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 23:05:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 23:05:26,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:05:26,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158624740] [2021-12-06 23:05:26,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158624740] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:05:26,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:05:26,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 23:05:26,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222382805] [2021-12-06 23:05:26,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:05:26,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 23:05:26,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:05:26,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 23:05:26,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:05:26,450 INFO L87 Difference]: Start difference. First operand 355 states and 423 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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) [2021-12-06 23:05:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:05:26,743 INFO L93 Difference]: Finished difference Result 563 states and 693 transitions. [2021-12-06 23:05:26,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 23:05:26,744 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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 55 [2021-12-06 23:05:26,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:05:26,747 INFO L225 Difference]: With dead ends: 563 [2021-12-06 23:05:26,747 INFO L226 Difference]: Without dead ends: 563 [2021-12-06 23:05:26,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-12-06 23:05:26,748 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 254 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:05:26,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 717 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:05:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-12-06 23:05:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 391. [2021-12-06 23:05:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 350 states have (on average 1.3171428571428572) internal successors, (461), 379 states have internal predecessors, (461), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-06 23:05:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 478 transitions. [2021-12-06 23:05:26,760 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 478 transitions. Word has length 55 [2021-12-06 23:05:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:05:26,760 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 478 transitions. [2021-12-06 23:05:26,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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) [2021-12-06 23:05:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 478 transitions. [2021-12-06 23:05:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-06 23:05:26,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:05:26,762 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 23:05:26,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 23:05:26,762 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:05:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:05:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1645084350, now seen corresponding path program 1 times [2021-12-06 23:05:26,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:05:26,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841480345] [2021-12-06 23:05:26,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:26,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:05:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:26,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 23:05:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 23:05:26,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:05:26,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841480345] [2021-12-06 23:05:26,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841480345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:05:26,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:05:26,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:05:26,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002064449] [2021-12-06 23:05:26,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:05:26,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:05:26,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:05:26,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:05:26,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:05:26,841 INFO L87 Difference]: Start difference. First operand 391 states and 478 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 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) [2021-12-06 23:05:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:05:26,971 INFO L93 Difference]: Finished difference Result 446 states and 549 transitions. [2021-12-06 23:05:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:05:26,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 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 56 [2021-12-06 23:05:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:05:26,973 INFO L225 Difference]: With dead ends: 446 [2021-12-06 23:05:26,973 INFO L226 Difference]: Without dead ends: 446 [2021-12-06 23:05:26,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:05:26,974 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 48 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:05:26,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 607 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:05:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-12-06 23:05:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 426. [2021-12-06 23:05:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 385 states have (on average 1.3402597402597403) internal successors, (516), 414 states have internal predecessors, (516), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-06 23:05:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 533 transitions. [2021-12-06 23:05:26,982 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 533 transitions. Word has length 56 [2021-12-06 23:05:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:05:26,983 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 533 transitions. [2021-12-06 23:05:26,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 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) [2021-12-06 23:05:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 533 transitions. [2021-12-06 23:05:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 23:05:26,984 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:05:26,984 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 23:05:26,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-06 23:05:26,984 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:05:26,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:05:26,985 INFO L85 PathProgramCache]: Analyzing trace with hash -541993187, now seen corresponding path program 1 times [2021-12-06 23:05:26,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:05:26,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873070730] [2021-12-06 23:05:26,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:26,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:05:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 23:05:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 23:05:27,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:05:27,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873070730] [2021-12-06 23:05:27,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873070730] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:05:27,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:05:27,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 23:05:27,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981606930] [2021-12-06 23:05:27,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:05:27,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 23:05:27,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:05:27,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 23:05:27,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:05:27,093 INFO L87 Difference]: Start difference. First operand 426 states and 533 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 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) [2021-12-06 23:05:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:05:27,287 INFO L93 Difference]: Finished difference Result 567 states and 711 transitions. [2021-12-06 23:05:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 23:05:27,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 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 57 [2021-12-06 23:05:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:05:27,289 INFO L225 Difference]: With dead ends: 567 [2021-12-06 23:05:27,289 INFO L226 Difference]: Without dead ends: 567 [2021-12-06 23:05:27,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-12-06 23:05:27,290 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 182 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:05:27,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 769 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:05:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-12-06 23:05:27,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 426. [2021-12-06 23:05:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 385 states have (on average 1.3272727272727274) internal successors, (511), 414 states have internal predecessors, (511), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-06 23:05:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2021-12-06 23:05:27,298 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 57 [2021-12-06 23:05:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:05:27,299 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2021-12-06 23:05:27,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 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) [2021-12-06 23:05:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2021-12-06 23:05:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 23:05:27,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:05:27,299 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 23:05:27,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-06 23:05:27,300 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:05:27,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:05:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash 383583177, now seen corresponding path program 1 times [2021-12-06 23:05:27,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:05:27,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260762278] [2021-12-06 23:05:27,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:27,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:05:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:27,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 23:05:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-06 23:05:27,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:05:27,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260762278] [2021-12-06 23:05:27,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260762278] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:05:27,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:05:27,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-06 23:05:27,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944902965] [2021-12-06 23:05:27,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:05:27,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-06 23:05:27,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:05:27,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-06 23:05:27,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-12-06 23:05:27,650 INFO L87 Difference]: Start difference. First operand 426 states and 528 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 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) [2021-12-06 23:05:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:05:28,360 INFO L93 Difference]: Finished difference Result 710 states and 885 transitions. [2021-12-06 23:05:28,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-06 23:05:28,361 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 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 58 [2021-12-06 23:05:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:05:28,363 INFO L225 Difference]: With dead ends: 710 [2021-12-06 23:05:28,363 INFO L226 Difference]: Without dead ends: 710 [2021-12-06 23:05:28,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2021-12-06 23:05:28,364 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 599 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:05:28,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [599 Valid, 1086 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:05:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2021-12-06 23:05:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 463. [2021-12-06 23:05:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 422 states have (on average 1.3364928909952607) internal successors, (564), 450 states have internal predecessors, (564), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-06 23:05:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 581 transitions. [2021-12-06 23:05:28,373 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 581 transitions. Word has length 58 [2021-12-06 23:05:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:05:28,373 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 581 transitions. [2021-12-06 23:05:28,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 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) [2021-12-06 23:05:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 581 transitions. [2021-12-06 23:05:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 23:05:28,374 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:05:28,374 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 23:05:28,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-06 23:05:28,374 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:05:28,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:05:28,374 INFO L85 PathProgramCache]: Analyzing trace with hash 383583178, now seen corresponding path program 1 times [2021-12-06 23:05:28,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:05:28,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632251915] [2021-12-06 23:05:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:28,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:05:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:28,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 23:05:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-06 23:05:28,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:05:28,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632251915] [2021-12-06 23:05:28,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632251915] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:05:28,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:05:28,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-06 23:05:28,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502031556] [2021-12-06 23:05:28,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:05:28,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-06 23:05:28,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:05:28,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-06 23:05:28,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-12-06 23:05:28,765 INFO L87 Difference]: Start difference. First operand 463 states and 581 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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) [2021-12-06 23:05:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:05:29,607 INFO L93 Difference]: Finished difference Result 767 states and 944 transitions. [2021-12-06 23:05:29,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 23:05:29,607 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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 58 [2021-12-06 23:05:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:05:29,610 INFO L225 Difference]: With dead ends: 767 [2021-12-06 23:05:29,610 INFO L226 Difference]: Without dead ends: 767 [2021-12-06 23:05:29,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2021-12-06 23:05:29,611 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 633 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:05:29,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [633 Valid, 822 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:05:29,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2021-12-06 23:05:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 463. [2021-12-06 23:05:29,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 422 states have (on average 1.3317535545023698) internal successors, (562), 450 states have internal predecessors, (562), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-06 23:05:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 579 transitions. [2021-12-06 23:05:29,621 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 579 transitions. Word has length 58 [2021-12-06 23:05:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:05:29,621 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 579 transitions. [2021-12-06 23:05:29,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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) [2021-12-06 23:05:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 579 transitions. [2021-12-06 23:05:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-06 23:05:29,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:05:29,622 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:05:29,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 23:05:29,622 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-06 23:05:29,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:05:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1581411742, now seen corresponding path program 1 times [2021-12-06 23:05:29,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:05:29,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545123356] [2021-12-06 23:05:29,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:29,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:05:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 23:05:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 23:05:30,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:05:30,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545123356] [2021-12-06 23:05:30,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545123356] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:05:30,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698177346] [2021-12-06 23:05:30,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:05:30,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:05:30,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:05:30,413 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:05:30,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72783c26-c273-4355-ae25-5ce53bf953be/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 23:05:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:05:30,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 124 conjunts are in the unsatisfiable core [2021-12-06 23:05:30,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:05:30,524 INFO L388 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 [2021-12-06 23:05:30,639 INFO L388 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 23:05:30,736 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 23:05:30,737 INFO L388 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 12 treesize of output 14 [2021-12-06 23:05:30,797 INFO L388 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 [2021-12-06 23:05:30,804 INFO L388 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 [2021-12-06 23:05:31,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:31,030 INFO L388 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 31 treesize of output 26 [2021-12-06 23:05:31,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:31,035 INFO L388 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 27 treesize of output 26 [2021-12-06 23:05:31,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:31,136 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-06 23:05:31,137 INFO L388 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 52 [2021-12-06 23:05:31,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:31,147 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-12-06 23:05:31,147 INFO L388 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 2 case distinctions, treesize of input 34 treesize of output 46 [2021-12-06 23:05:31,443 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-06 23:05:31,443 INFO L388 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 2 case distinctions, treesize of input 38 treesize of output 48 [2021-12-06 23:05:31,452 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-06 23:05:31,452 INFO L388 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 59 [2021-12-06 23:05:31,908 INFO L354 Elim1Store]: treesize reduction 68, result has 50.7 percent of original size [2021-12-06 23:05:31,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 105 [2021-12-06 23:05:31,933 INFO L354 Elim1Store]: treesize reduction 96, result has 30.4 percent of original size [2021-12-06 23:05:31,933 INFO L388 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 41 treesize of output 58 [2021-12-06 23:05:32,329 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-06 23:05:32,329 INFO L388 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 [2021-12-06 23:05:33,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 23:05:33,968 INFO L354 Elim1Store]: treesize reduction 79, result has 16.0 percent of original size [2021-12-06 23:05:33,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 238 treesize of output 134 [2021-12-06 23:05:33,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:33,986 INFO L354 Elim1Store]: treesize reduction 74, result has 8.6 percent of original size [2021-12-06 23:05:33,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 78 treesize of output 42 [2021-12-06 23:05:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 23:05:34,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:05:35,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 23:05:35,768 INFO L354 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2021-12-06 23:05:35,768 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 2835 treesize of output 1 [2021-12-06 23:05:38,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 23:05:39,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 23:05:39,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 23:06:27,275 WARN L227 SmtUtils]: Spent 48.14s on a formula simplification. DAG size of input: 1546 DAG size of output: 912 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-06 23:06:27,278 INFO L354 Elim1Store]: treesize reduction 48527, result has 42.7 percent of original size [2021-12-06 23:06:27,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 31 select indices, 31 select index equivalence classes, 3 disjoint index pairs (out of 465 index pairs), introduced 38 new quantified variables, introduced 465 case distinctions, treesize of input 6986448940 treesize of output 6513174031