./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 23:38:35,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 23:38:35,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 23:38:35,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 23:38:35,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 23:38:35,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 23:38:35,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 23:38:35,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 23:38:35,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 23:38:35,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 23:38:35,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 23:38:35,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 23:38:35,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 23:38:35,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 23:38:35,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 23:38:35,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 23:38:35,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 23:38:35,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 23:38:35,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 23:38:35,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 23:38:35,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 23:38:35,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 23:38:35,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 23:38:35,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 23:38:35,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 23:38:35,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 23:38:35,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 23:38:35,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 23:38:35,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 23:38:35,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 23:38:35,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 23:38:35,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 23:38:35,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 23:38:35,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 23:38:35,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 23:38:35,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 23:38:35,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 23:38:35,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 23:38:35,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 23:38:35,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 23:38:35,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 23:38:35,980 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-20 23:38:36,011 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 23:38:36,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 23:38:36,012 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 23:38:36,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 23:38:36,013 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 23:38:36,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 23:38:36,013 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 23:38:36,013 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 23:38:36,013 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 23:38:36,013 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-20 23:38:36,014 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 23:38:36,014 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 23:38:36,014 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-20 23:38:36,014 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-20 23:38:36,014 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 23:38:36,015 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-20 23:38:36,015 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-20 23:38:36,015 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-20 23:38:36,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 23:38:36,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 23:38:36,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 23:38:36,016 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 23:38:36,016 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 23:38:36,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 23:38:36,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 23:38:36,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 23:38:36,017 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 23:38:36,017 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 23:38:36,018 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 23:38:36,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 23:38:36,023 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 23:38:36,023 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 23:38:36,023 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 23:38:36,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 23:38:36,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 23:38:36,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:38:36,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 23:38:36,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 23:38:36,025 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-20 23:38:36,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 23:38:36,025 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 23:38:36,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 23:38:36,026 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/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_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2021-11-20 23:38:36,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 23:38:36,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 23:38:36,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 23:38:36,364 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 23:38:36,365 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 23:38:36,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2021-11-20 23:38:36,444 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/data/d38a3c160/8d4b6df2d019434ca71805829dcea275/FLAG28102df0a [2021-11-20 23:38:37,009 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 23:38:37,010 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2021-11-20 23:38:37,023 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/data/d38a3c160/8d4b6df2d019434ca71805829dcea275/FLAG28102df0a [2021-11-20 23:38:37,296 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/data/d38a3c160/8d4b6df2d019434ca71805829dcea275 [2021-11-20 23:38:37,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 23:38:37,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 23:38:37,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 23:38:37,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 23:38:37,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 23:38:37,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:38:37" (1/1) ... [2021-11-20 23:38:37,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1105088f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37, skipping insertion in model container [2021-11-20 23:38:37,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:38:37" (1/1) ... [2021-11-20 23:38:37,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 23:38:37,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 23:38:37,689 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_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2021-11-20 23:38:37,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:38:37,712 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 23:38:37,774 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_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2021-11-20 23:38:37,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:38:37,805 INFO L208 MainTranslator]: Completed translation [2021-11-20 23:38:37,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37 WrapperNode [2021-11-20 23:38:37,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 23:38:37,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 23:38:37,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 23:38:37,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 23:38:37,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37" (1/1) ... [2021-11-20 23:38:37,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37" (1/1) ... [2021-11-20 23:38:37,873 INFO L137 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2021-11-20 23:38:37,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 23:38:37,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 23:38:37,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 23:38:37,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 23:38:37,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37" (1/1) ... [2021-11-20 23:38:37,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37" (1/1) ... [2021-11-20 23:38:37,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37" (1/1) ... [2021-11-20 23:38:37,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37" (1/1) ... [2021-11-20 23:38:37,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37" (1/1) ... [2021-11-20 23:38:37,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37" (1/1) ... [2021-11-20 23:38:37,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37" (1/1) ... [2021-11-20 23:38:37,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 23:38:37,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 23:38:37,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 23:38:37,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 23:38:37,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37" (1/1) ... [2021-11-20 23:38:37,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:38:37,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:38:38,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 23:38:38,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 23:38:38,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 23:38:38,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 23:38:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-20 23:38:38,045 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-20 23:38:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 23:38:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 23:38:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 23:38:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 23:38:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 23:38:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 23:38:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 23:38:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 23:38:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 23:38:38,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 23:38:38,152 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 23:38:38,154 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 23:38:38,607 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 23:38:38,651 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 23:38:38,651 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-20 23:38:38,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:38:38 BoogieIcfgContainer [2021-11-20 23:38:38,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 23:38:38,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 23:38:38,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 23:38:38,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 23:38:38,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:38:37" (1/3) ... [2021-11-20 23:38:38,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6faa90f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:38:38, skipping insertion in model container [2021-11-20 23:38:38,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:37" (2/3) ... [2021-11-20 23:38:38,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6faa90f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:38:38, skipping insertion in model container [2021-11-20 23:38:38,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:38:38" (3/3) ... [2021-11-20 23:38:38,663 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2021-11-20 23:38:38,667 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 23:38:38,667 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-11-20 23:38:38,711 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 23:38:38,720 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-11-20 23:38:38,720 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-11-20 23:38:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 47 states have (on average 2.3404255319148937) internal successors, (110), 99 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:38:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-20 23:38:38,762 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:38:38,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-20 23:38:38,763 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:38:38,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:38:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash 220058362, now seen corresponding path program 1 times [2021-11-20 23:38:38,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:38:38,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164761094] [2021-11-20 23:38:38,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:38,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:38:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:38:39,023 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:38:39,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164761094] [2021-11-20 23:38:39,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164761094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:38:39,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:38:39,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 23:38:39,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795573577] [2021-11-20 23:38:39,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:38:39,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 23:38:39,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:38:39,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 23:38:39,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:38:39,071 INFO L87 Difference]: Start difference. First operand has 104 states, 47 states have (on average 2.3404255319148937) internal successors, (110), 99 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:38:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:38:39,197 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2021-11-20 23:38:39,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:38:39,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-20 23:38:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:38:39,209 INFO L225 Difference]: With dead ends: 102 [2021-11-20 23:38:39,209 INFO L226 Difference]: Without dead ends: 100 [2021-11-20 23:38:39,211 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-11-20 23:38:39,214 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:38:39,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 141 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:38:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-20 23:38:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-11-20 23:38:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 46 states have (on average 2.217391304347826) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:38:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2021-11-20 23:38:39,260 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 5 [2021-11-20 23:38:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:38:39,260 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2021-11-20 23:38:39,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:38:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2021-11-20 23:38:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-20 23:38:39,261 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:38:39,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-20 23:38:39,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 23:38:39,262 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:38:39,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:38:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash 220058363, now seen corresponding path program 1 times [2021-11-20 23:38:39,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:38:39,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826229732] [2021-11-20 23:38:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:39,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:38:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:38:39,316 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:38:39,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826229732] [2021-11-20 23:38:39,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826229732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:38:39,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:38:39,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 23:38:39,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550468631] [2021-11-20 23:38:39,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:38:39,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 23:38:39,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:38:39,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 23:38:39,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:38:39,321 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:38:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:38:39,414 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2021-11-20 23:38:39,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:38:39,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-20 23:38:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:38:39,417 INFO L225 Difference]: With dead ends: 98 [2021-11-20 23:38:39,417 INFO L226 Difference]: Without dead ends: 98 [2021-11-20 23:38:39,418 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-11-20 23:38:39,419 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:38:39,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:38:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-20 23:38:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-11-20 23:38:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:38:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-11-20 23:38:39,431 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 5 [2021-11-20 23:38:39,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:38:39,432 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-11-20 23:38:39,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:38:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-11-20 23:38:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-20 23:38:39,433 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:38:39,433 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:38:39,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 23:38:39,434 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:38:39,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:38:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1428630120, now seen corresponding path program 1 times [2021-11-20 23:38:39,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:38:39,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419116164] [2021-11-20 23:38:39,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:39,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:38:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:38:39,479 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:38:39,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419116164] [2021-11-20 23:38:39,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419116164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:38:39,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:38:39,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 23:38:39,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049066492] [2021-11-20 23:38:39,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:38:39,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 23:38:39,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:38:39,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 23:38:39,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:38:39,483 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-20 23:38:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:38:39,519 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2021-11-20 23:38:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:38:39,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2021-11-20 23:38:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:38:39,521 INFO L225 Difference]: With dead ends: 104 [2021-11-20 23:38:39,521 INFO L226 Difference]: Without dead ends: 104 [2021-11-20 23:38:39,522 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-11-20 23:38:39,524 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:38:39,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 181 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 23:38:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-20 23:38:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2021-11-20 23:38:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 47 states have (on average 2.148936170212766) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:38:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2021-11-20 23:38:39,536 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 10 [2021-11-20 23:38:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:38:39,536 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2021-11-20 23:38:39,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-20 23:38:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2021-11-20 23:38:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-20 23:38:39,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:38:39,538 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:38:39,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 23:38:39,538 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:38:39,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:38:39,555 INFO L85 PathProgramCache]: Analyzing trace with hash -707108059, now seen corresponding path program 1 times [2021-11-20 23:38:39,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:38:39,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159621196] [2021-11-20 23:38:39,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:39,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:38:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:38:39,636 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:38:39,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159621196] [2021-11-20 23:38:39,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159621196] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:38:39,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:38:39,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 23:38:39,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927500397] [2021-11-20 23:38:39,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:38:39,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:38:39,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:38:39,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:38:39,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:38:39,642 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:38:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:38:39,874 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2021-11-20 23:38:39,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:38:39,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-20 23:38:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:38:39,882 INFO L225 Difference]: With dead ends: 99 [2021-11-20 23:38:39,882 INFO L226 Difference]: Without dead ends: 99 [2021-11-20 23:38:39,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 23:38:39,893 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:38:39,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 279 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:38:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-20 23:38:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-11-20 23:38:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 47 states have (on average 2.127659574468085) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:38:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-11-20 23:38:39,910 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 17 [2021-11-20 23:38:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:38:39,910 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-11-20 23:38:39,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:38:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-11-20 23:38:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-20 23:38:39,912 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:38:39,912 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:38:39,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 23:38:39,913 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:38:39,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:38:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash -707108058, now seen corresponding path program 1 times [2021-11-20 23:38:39,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:38:39,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916620314] [2021-11-20 23:38:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:39,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:38:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:38:40,094 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:38:40,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916620314] [2021-11-20 23:38:40,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916620314] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:38:40,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:38:40,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 23:38:40,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26770942] [2021-11-20 23:38:40,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:38:40,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:38:40,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:38:40,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:38:40,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:38:40,098 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:38:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:38:40,299 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2021-11-20 23:38:40,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:38:40,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-20 23:38:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:38:40,302 INFO L225 Difference]: With dead ends: 98 [2021-11-20 23:38:40,303 INFO L226 Difference]: Without dead ends: 98 [2021-11-20 23:38:40,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 23:38:40,308 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 7 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:38:40,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 303 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:38:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-20 23:38:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2021-11-20 23:38:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 47 states have (on average 2.106382978723404) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:38:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-11-20 23:38:40,329 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 17 [2021-11-20 23:38:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:38:40,329 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-11-20 23:38:40,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:38:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-11-20 23:38:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-20 23:38:40,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:38:40,331 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:38:40,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 23:38:40,332 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:38:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:38:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash -925822776, now seen corresponding path program 1 times [2021-11-20 23:38:40,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:38:40,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466178414] [2021-11-20 23:38:40,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:40,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:38:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:38:40,544 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:38:40,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466178414] [2021-11-20 23:38:40,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466178414] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:38:40,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305118484] [2021-11-20 23:38:40,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:40,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:38:40,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:38:40,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:38:40,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 23:38:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:40,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-20 23:38:40,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:38:40,700 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-11-20 23:38:40,895 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-11-20 23:38:40,895 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 14 treesize of output 9 [2021-11-20 23:38:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:38:40,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 23:38:40,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305118484] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:38:40,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 23:38:40,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2021-11-20 23:38:40,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410341165] [2021-11-20 23:38:40,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:38:40,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 23:38:40,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:38:40,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 23:38:40,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-20 23:38:40,963 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 23:38:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:38:41,241 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2021-11-20 23:38:41,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 23:38:41,241 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-11-20 23:38:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:38:41,242 INFO L225 Difference]: With dead ends: 115 [2021-11-20 23:38:41,242 INFO L226 Difference]: Without dead ends: 115 [2021-11-20 23:38:41,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:38:41,244 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 171 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:38:41,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 285 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:38:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-20 23:38:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2021-11-20 23:38:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 91 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:38:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-11-20 23:38:41,251 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 19 [2021-11-20 23:38:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:38:41,251 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-11-20 23:38:41,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 23:38:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-11-20 23:38:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-20 23:38:41,252 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:38:41,252 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:38:41,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 23:38:41,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:38:41,470 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:38:41,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:38:41,471 INFO L85 PathProgramCache]: Analyzing trace with hash -925822775, now seen corresponding path program 1 times [2021-11-20 23:38:41,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:38:41,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181146207] [2021-11-20 23:38:41,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:41,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:38:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:38:41,652 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:38:41,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181146207] [2021-11-20 23:38:41,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181146207] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:38:41,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002300784] [2021-11-20 23:38:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:41,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:38:41,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:38:41,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:38:41,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 23:38:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:41,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-20 23:38:41,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:38:41,765 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-11-20 23:38:42,018 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:38:42,019 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 11 treesize of output 11 [2021-11-20 23:38:42,024 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 14 treesize of output 16 [2021-11-20 23:38:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:38:42,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:38:42,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002300784] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:38:42,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [363668884] [2021-11-20 23:38:42,384 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-20 23:38:42,384 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:38:42,389 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:38:42,394 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:38:42,395 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:38:42,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:38:42,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:38:42,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-20 23:38:42,623 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-20 23:38:42,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-20 23:38:42,694 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-11-20 23:38:42,701 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 9 [2021-11-20 23:38:42,729 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-11-20 23:38:42,744 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-11-20 23:38:42,759 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 15 treesize of output 1 [2021-11-20 23:38:42,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:38:42,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-20 23:38:42,800 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 13 treesize of output 9 [2021-11-20 23:38:42,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:38:42,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-20 23:38:42,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:38:42,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:38:42,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-20 23:38:43,008 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-20 23:38:43,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-20 23:38:43,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:38:43,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:38:43,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-20 23:38:43,609 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:38:43,610 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 24 treesize of output 20 [2021-11-20 23:38:43,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:43,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-20 23:38:43,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:43,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:43,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-20 23:38:43,917 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:38:43,918 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 24 treesize of output 20 [2021-11-20 23:38:44,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:44,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-20 23:38:44,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:44,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-20 23:38:44,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:44,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-20 23:38:44,529 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 11 [2021-11-20 23:38:44,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:38:44,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-20 23:38:44,866 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:38:44,871 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 24 treesize of output 20 [2021-11-20 23:38:44,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:44,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:45,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:45,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-20 23:38:45,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-20 23:38:45,215 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:38:45,216 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 24 treesize of output 20 [2021-11-20 23:38:45,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:45,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:45,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:45,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-20 23:38:45,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-20 23:38:45,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-20 23:38:45,704 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 11 [2021-11-20 23:38:45,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:38:45,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-20 23:38:46,044 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:38:46,044 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 24 treesize of output 20 [2021-11-20 23:38:46,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-20 23:38:46,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:46,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:46,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:46,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-20 23:38:46,330 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:38:46,331 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 24 treesize of output 20 [2021-11-20 23:38:46,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-20 23:38:46,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-20 23:38:46,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:46,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:46,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-20 23:38:46,843 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 23:38:46,844 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 24 treesize of output 20 [2021-11-20 23:38:47,267 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-20 23:38:47,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-20 23:38:47,305 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 88 for LOIs [2021-11-20 23:38:49,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-20 23:38:49,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:38:49,462 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Some non-self update cases but no top-level DER relation at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:340) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:278) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-20 23:38:49,468 INFO L158 Benchmark]: Toolchain (without parser) took 12167.68ms. Allocated memory was 92.3MB in the beginning and 159.4MB in the end (delta: 67.1MB). Free memory was 50.6MB in the beginning and 80.0MB in the end (delta: -29.4MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2021-11-20 23:38:49,469 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 92.3MB. Free memory was 68.2MB in the beginning and 68.2MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 23:38:49,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.50ms. Allocated memory was 92.3MB in the beginning and 127.9MB in the end (delta: 35.7MB). Free memory was 50.4MB in the beginning and 93.8MB in the end (delta: -43.3MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2021-11-20 23:38:49,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.01ms. Allocated memory is still 127.9MB. Free memory was 93.8MB in the beginning and 91.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 23:38:49,470 INFO L158 Benchmark]: Boogie Preprocessor took 75.56ms. Allocated memory is still 127.9MB. Free memory was 91.2MB in the beginning and 89.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 23:38:49,471 INFO L158 Benchmark]: RCFGBuilder took 703.75ms. Allocated memory is still 127.9MB. Free memory was 89.6MB in the beginning and 89.8MB in the end (delta: -232.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-20 23:38:49,471 INFO L158 Benchmark]: TraceAbstraction took 10811.80ms. Allocated memory was 127.9MB in the beginning and 159.4MB in the end (delta: 31.5MB). Free memory was 89.0MB in the beginning and 80.0MB in the end (delta: 9.0MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2021-11-20 23:38:49,474 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 92.3MB. Free memory was 68.2MB in the beginning and 68.2MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.50ms. Allocated memory was 92.3MB in the beginning and 127.9MB in the end (delta: 35.7MB). Free memory was 50.4MB in the beginning and 93.8MB in the end (delta: -43.3MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.01ms. Allocated memory is still 127.9MB. Free memory was 93.8MB in the beginning and 91.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.56ms. Allocated memory is still 127.9MB. Free memory was 91.2MB in the beginning and 89.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 703.75ms. Allocated memory is still 127.9MB. Free memory was 89.6MB in the beginning and 89.8MB in the end (delta: -232.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10811.80ms. Allocated memory was 127.9MB in the beginning and 159.4MB in the end (delta: 31.5MB). Free memory was 89.0MB in the beginning and 80.0MB in the end (delta: 9.0MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Some non-self update cases but no top-level DER relation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Some non-self update cases but no top-level DER relation: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-20 23:38:49,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 23:38:52,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 23:38:52,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 23:38:52,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 23:38:52,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 23:38:52,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 23:38:52,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 23:38:52,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 23:38:52,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 23:38:52,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 23:38:52,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 23:38:52,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 23:38:52,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 23:38:52,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 23:38:52,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 23:38:52,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 23:38:52,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 23:38:52,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 23:38:52,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 23:38:52,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 23:38:52,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 23:38:52,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 23:38:52,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 23:38:52,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 23:38:52,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 23:38:52,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 23:38:52,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 23:38:52,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 23:38:52,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 23:38:52,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 23:38:52,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 23:38:52,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 23:38:52,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 23:38:52,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 23:38:52,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 23:38:52,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 23:38:52,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 23:38:52,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 23:38:52,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 23:38:52,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 23:38:52,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 23:38:52,233 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-20 23:38:52,278 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 23:38:52,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 23:38:52,279 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 23:38:52,280 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 23:38:52,281 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 23:38:52,281 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 23:38:52,281 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 23:38:52,281 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 23:38:52,282 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 23:38:52,282 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 23:38:52,283 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 23:38:52,283 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 23:38:52,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 23:38:52,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 23:38:52,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 23:38:52,286 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 23:38:52,286 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 23:38:52,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 23:38:52,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 23:38:52,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 23:38:52,287 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 23:38:52,287 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 23:38:52,287 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 23:38:52,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 23:38:52,288 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 23:38:52,288 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-20 23:38:52,288 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-20 23:38:52,288 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 23:38:52,289 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 23:38:52,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 23:38:52,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 23:38:52,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 23:38:52,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:38:52,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 23:38:52,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 23:38:52,291 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-20 23:38:52,291 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-20 23:38:52,292 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 23:38:52,292 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 23:38:52,292 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/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_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2021-11-20 23:38:52,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 23:38:52,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 23:38:52,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 23:38:52,763 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 23:38:52,764 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 23:38:52,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2021-11-20 23:38:52,842 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/data/f4954ce1e/bb85a3bf85b14db3a0817ef95ae6face/FLAG8a9ad7ef4 [2021-11-20 23:38:53,461 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 23:38:53,461 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2021-11-20 23:38:53,474 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/data/f4954ce1e/bb85a3bf85b14db3a0817ef95ae6face/FLAG8a9ad7ef4 [2021-11-20 23:38:53,723 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/data/f4954ce1e/bb85a3bf85b14db3a0817ef95ae6face [2021-11-20 23:38:53,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 23:38:53,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 23:38:53,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 23:38:53,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 23:38:53,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 23:38:53,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:38:53" (1/1) ... [2021-11-20 23:38:53,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c7375b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:53, skipping insertion in model container [2021-11-20 23:38:53,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:38:53" (1/1) ... [2021-11-20 23:38:53,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 23:38:53,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 23:38:54,149 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_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2021-11-20 23:38:54,155 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:38:54,175 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 23:38:54,231 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_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2021-11-20 23:38:54,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:38:54,268 INFO L208 MainTranslator]: Completed translation [2021-11-20 23:38:54,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:54 WrapperNode [2021-11-20 23:38:54,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 23:38:54,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 23:38:54,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 23:38:54,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 23:38:54,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:54" (1/1) ... [2021-11-20 23:38:54,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:54" (1/1) ... [2021-11-20 23:38:54,349 INFO L137 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 144 [2021-11-20 23:38:54,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 23:38:54,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 23:38:54,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 23:38:54,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 23:38:54,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:54" (1/1) ... [2021-11-20 23:38:54,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:54" (1/1) ... [2021-11-20 23:38:54,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:54" (1/1) ... [2021-11-20 23:38:54,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:54" (1/1) ... [2021-11-20 23:38:54,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:54" (1/1) ... [2021-11-20 23:38:54,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:54" (1/1) ... [2021-11-20 23:38:54,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:54" (1/1) ... [2021-11-20 23:38:54,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 23:38:54,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 23:38:54,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 23:38:54,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 23:38:54,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:54" (1/1) ... [2021-11-20 23:38:54,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:38:54,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:38:54,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 23:38:54,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 23:38:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-20 23:38:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-20 23:38:54,502 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-20 23:38:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 23:38:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 23:38:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 23:38:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 23:38:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 23:38:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 23:38:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-20 23:38:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 23:38:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-20 23:38:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 23:38:54,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 23:38:54,691 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 23:38:54,692 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 23:38:55,267 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 23:38:55,274 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 23:38:55,275 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-20 23:38:55,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:38:55 BoogieIcfgContainer [2021-11-20 23:38:55,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 23:38:55,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 23:38:55,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 23:38:55,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 23:38:55,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:38:53" (1/3) ... [2021-11-20 23:38:55,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517d3209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:38:55, skipping insertion in model container [2021-11-20 23:38:55,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:54" (2/3) ... [2021-11-20 23:38:55,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517d3209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:38:55, skipping insertion in model container [2021-11-20 23:38:55,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:38:55" (3/3) ... [2021-11-20 23:38:55,285 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2021-11-20 23:38:55,291 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 23:38:55,291 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-11-20 23:38:55,336 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 23:38:55,343 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-11-20 23:38:55,344 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-11-20 23:38:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:38:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-20 23:38:55,369 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:38:55,369 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-20 23:38:55,370 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:38:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:38:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash 895152213, now seen corresponding path program 1 times [2021-11-20 23:38:55,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:38:55,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042738226] [2021-11-20 23:38:55,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:55,390 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:38:55,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:38:55,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:38:55,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-20 23:38:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:55,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 23:38:55,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:38:55,597 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-11-20 23:38:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:38:55,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:38:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:38:55,655 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:38:55,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042738226] [2021-11-20 23:38:55,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042738226] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:38:55,656 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:38:55,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-20 23:38:55,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593021518] [2021-11-20 23:38:55,659 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:38:55,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 23:38:55,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:38:55,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 23:38:55,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:38:55,701 INFO L87 Difference]: Start difference. First operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:38:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:38:55,976 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2021-11-20 23:38:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:38:55,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-20 23:38:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:38:56,001 INFO L225 Difference]: With dead ends: 117 [2021-11-20 23:38:56,001 INFO L226 Difference]: Without dead ends: 114 [2021-11-20 23:38:56,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-11-20 23:38:56,009 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:38:56,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 183 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:38:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-20 23:38:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-11-20 23:38:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 109 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:38:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2021-11-20 23:38:56,075 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 6 [2021-11-20 23:38:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:38:56,076 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2021-11-20 23:38:56,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:38:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2021-11-20 23:38:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-20 23:38:56,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:38:56,078 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-20 23:38:56,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-20 23:38:56,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:38:56,289 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:38:56,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:38:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash 895152214, now seen corresponding path program 1 times [2021-11-20 23:38:56,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:38:56,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201812484] [2021-11-20 23:38:56,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:56,297 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:38:56,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:38:56,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:38:56,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-20 23:38:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:56,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 23:38:56,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:38:56,384 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-11-20 23:38:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:38:56,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:38:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:38:56,478 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:38:56,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201812484] [2021-11-20 23:38:56,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201812484] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:38:56,479 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:38:56,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-20 23:38:56,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530709882] [2021-11-20 23:38:56,480 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:38:56,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 23:38:56,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:38:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 23:38:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:38:56,482 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-11-20 23:38:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:38:57,022 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2021-11-20 23:38:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:38:57,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-20 23:38:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:38:57,025 INFO L225 Difference]: With dead ends: 112 [2021-11-20 23:38:57,026 INFO L226 Difference]: Without dead ends: 112 [2021-11-20 23:38:57,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-11-20 23:38:57,028 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:38:57,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 254 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:38:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-20 23:38:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-11-20 23:38:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 60 states have (on average 1.9) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:38:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2021-11-20 23:38:57,043 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 6 [2021-11-20 23:38:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:38:57,044 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2021-11-20 23:38:57,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-11-20 23:38:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2021-11-20 23:38:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 23:38:57,045 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:38:57,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:38:57,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-20 23:38:57,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:38:57,259 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:38:57,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:38:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 972366423, now seen corresponding path program 1 times [2021-11-20 23:38:57,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:38:57,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269467678] [2021-11-20 23:38:57,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:57,262 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:38:57,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:38:57,263 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:38:57,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-20 23:38:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:57,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 23:38:57,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:38:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:38:57,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:38:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:38:57,418 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:38:57,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269467678] [2021-11-20 23:38:57,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269467678] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:38:57,419 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:38:57,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-20 23:38:57,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146710483] [2021-11-20 23:38:57,419 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:38:57,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 23:38:57,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:38:57,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 23:38:57,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:38:57,421 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11-20 23:38:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:38:57,438 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2021-11-20 23:38:57,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 23:38:57,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2021-11-20 23:38:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:38:57,440 INFO L225 Difference]: With dead ends: 119 [2021-11-20 23:38:57,441 INFO L226 Difference]: Without dead ends: 119 [2021-11-20 23:38:57,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-11-20 23:38:57,442 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 9 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:38:57,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 341 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 23:38:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-20 23:38:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2021-11-20 23:38:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 108 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:38:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2021-11-20 23:38:57,454 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 13 [2021-11-20 23:38:57,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:38:57,455 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2021-11-20 23:38:57,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11-20 23:38:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2021-11-20 23:38:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 23:38:57,456 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:38:57,456 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:38:57,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-20 23:38:57,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:38:57,668 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:38:57,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:38:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573860, now seen corresponding path program 1 times [2021-11-20 23:38:57,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:38:57,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477975934] [2021-11-20 23:38:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:57,670 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:38:57,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:38:57,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:38:57,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-20 23:38:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:57,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 23:38:57,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:38:57,820 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-11-20 23:38:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:38:57,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:38:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:38:57,984 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:38:57,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477975934] [2021-11-20 23:38:57,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477975934] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:38:57,984 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:38:57,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-20 23:38:57,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132500664] [2021-11-20 23:38:57,985 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:38:57,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:38:57,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:38:58,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:38:58,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:38:58,003 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:38:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:38:58,496 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-11-20 23:38:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:38:58,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-11-20 23:38:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:38:58,500 INFO L225 Difference]: With dead ends: 113 [2021-11-20 23:38:58,500 INFO L226 Difference]: Without dead ends: 113 [2021-11-20 23:38:58,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 23:38:58,501 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 12 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:38:58,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 349 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:38:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-20 23:38:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-11-20 23:38:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 61 states have (on average 1.8688524590163935) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:38:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2021-11-20 23:38:58,511 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 22 [2021-11-20 23:38:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:38:58,511 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2021-11-20 23:38:58,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:38:58,512 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2021-11-20 23:38:58,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 23:38:58,513 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:38:58,513 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:38:58,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-20 23:38:58,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:38:58,724 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:38:58,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:38:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573859, now seen corresponding path program 1 times [2021-11-20 23:38:58,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:38:58,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382162370] [2021-11-20 23:38:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:38:58,726 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:38:58,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:38:58,727 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:38:58,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-20 23:38:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:38:58,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 23:38:58,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:38:58,921 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-11-20 23:38:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:38:59,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:38:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:38:59,554 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:38:59,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382162370] [2021-11-20 23:38:59,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382162370] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:38:59,555 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:38:59,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-20 23:38:59,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768115289] [2021-11-20 23:38:59,556 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:38:59,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:38:59,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:38:59,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:38:59,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-20 23:38:59,557 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 23:39:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:39:00,932 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2021-11-20 23:39:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:39:00,934 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2021-11-20 23:39:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:39:00,935 INFO L225 Difference]: With dead ends: 112 [2021-11-20 23:39:00,935 INFO L226 Difference]: Without dead ends: 112 [2021-11-20 23:39:00,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-20 23:39:00,936 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 11 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:39:00,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 634 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-20 23:39:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-20 23:39:00,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2021-11-20 23:39:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:39:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2021-11-20 23:39:00,945 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 22 [2021-11-20 23:39:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:39:00,946 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2021-11-20 23:39:00,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 23:39:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2021-11-20 23:39:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:39:00,947 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:39:00,947 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:39:00,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-20 23:39:01,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:39:01,159 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:39:01,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:39:01,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413691, now seen corresponding path program 1 times [2021-11-20 23:39:01,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:39:01,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466932826] [2021-11-20 23:39:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:39:01,160 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:39:01,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:39:01,163 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:39:01,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-20 23:39:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:39:01,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 23:39:01,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:39:01,303 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-11-20 23:39:01,531 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-20 23:39:01,531 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 24 treesize of output 31 [2021-11-20 23:39:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:39:01,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:39:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:39:27,940 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:39:27,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466932826] [2021-11-20 23:39:27,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466932826] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:39:27,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1389283358] [2021-11-20 23:39:27,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:39:27,941 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-20 23:39:27,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-20 23:39:27,954 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-20 23:39:27,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-20 23:39:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:39:28,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 23:39:28,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:39:28,169 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-11-20 23:39:32,308 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-20 23:39:32,308 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 21 [2021-11-20 23:39:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:39:32,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:39:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:39:40,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1389283358] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:39:40,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:39:40,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 8, 6] total 18 [2021-11-20 23:39:40,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572209576] [2021-11-20 23:39:40,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:39:40,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:39:40,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:39:40,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:39:40,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=270, Unknown=13, NotChecked=0, Total=342 [2021-11-20 23:39:40,880 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 23:39:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:39:43,838 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2021-11-20 23:39:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 23:39:43,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-11-20 23:39:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:39:43,841 INFO L225 Difference]: With dead ends: 128 [2021-11-20 23:39:43,841 INFO L226 Difference]: Without dead ends: 128 [2021-11-20 23:39:43,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 40.2s TimeCoverageRelationStatistics Valid=69, Invalid=297, Unknown=14, NotChecked=0, Total=380 [2021-11-20 23:39:43,843 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 95 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:39:43,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 475 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 405 Invalid, 0 Unknown, 44 Unchecked, 0.9s Time] [2021-11-20 23:39:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-20 23:39:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2021-11-20 23:39:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 105 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:39:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2021-11-20 23:39:43,867 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 25 [2021-11-20 23:39:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:39:43,868 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2021-11-20 23:39:43,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 23:39:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2021-11-20 23:39:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:39:43,875 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:39:43,875 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:39:43,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-20 23:39:44,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-20 23:39:44,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:39:44,287 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:39:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:39:44,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413690, now seen corresponding path program 1 times [2021-11-20 23:39:44,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:39:44,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479175601] [2021-11-20 23:39:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:39:44,289 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:39:44,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:39:44,290 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:39:44,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-20 23:39:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:39:44,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 23:39:44,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:39:44,419 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-11-20 23:39:44,426 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-11-20 23:39:44,795 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:39:44,795 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 28 treesize of output 30 [2021-11-20 23:39:44,809 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:39:44,809 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 27 treesize of output 27 [2021-11-20 23:39:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:39:44,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:39:49,744 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) is different from true [2021-11-20 23:39:54,533 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_49|)))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) is different from false [2021-11-20 23:39:57,358 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |c_node_create_#res#1.offset|))) (and (bvule |c_node_create_#res#1.offset| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |c_node_create_#res#1.base|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_48|))))))) is different from false [2021-11-20 23:39:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-20 23:39:58,051 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:39:58,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479175601] [2021-11-20 23:39:58,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479175601] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:39:58,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [458631905] [2021-11-20 23:39:58,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:39:58,052 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-20 23:39:58,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-20 23:39:58,054 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-20 23:39:58,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-20 23:39:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:39:58,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 23:39:58,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:39:58,258 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-11-20 23:39:58,271 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-11-20 23:39:58,589 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:39:58,590 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 32 treesize of output 34 [2021-11-20 23:39:58,608 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:39:58,608 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 31 treesize of output 31 [2021-11-20 23:39:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:39:58,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:40:10,527 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_57|)))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) is different from false [2021-11-20 23:40:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-20 23:40:11,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [458631905] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:40:11,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834598065] [2021-11-20 23:40:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:40:11,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:40:11,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:40:11,111 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:40:11,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 23:40:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:40:11,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 23:40:11,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:40:11,224 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-11-20 23:40:11,239 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-11-20 23:40:11,557 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:40:11,558 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 31 treesize of output 33 [2021-11-20 23:40:11,577 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:40:11,578 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 30 treesize of output 30 [2021-11-20 23:40:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:40:11,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:40:30,169 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse1)) (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_65|)))))) is different from false [2021-11-20 23:40:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-20 23:40:30,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834598065] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:40:30,785 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-20 23:40:30,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 19 [2021-11-20 23:40:30,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248302237] [2021-11-20 23:40:30,786 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-20 23:40:30,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-20 23:40:30,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:40:30,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 23:40:30,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=172, Unknown=12, NotChecked=150, Total=380 [2021-11-20 23:40:30,788 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-20 23:40:33,053 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_57|)))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_49|)))) (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse3)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4) (bvule .cse4 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse5)) (not (bvule .cse5 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_65|)))))) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 23:40:41,264 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |c_node_create_#res#1.offset|))) (and (bvule |c_node_create_#res#1.offset| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |c_node_create_#res#1.base|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_48|))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse1 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse2 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (= |c_node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_node_create_#res#1.base|))) is different from false [2021-11-20 23:40:43,285 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_57|)))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_49|)))) (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse3)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4) (bvule .cse4 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse5)) (not (bvule .cse5 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_65|))))))) is different from false [2021-11-20 23:41:16,189 WARN L227 SmtUtils]: Spent 16.15s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:41:18,196 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |c_node_create_#res#1.offset|))) (and (bvule |c_node_create_#res#1.offset| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |c_node_create_#res#1.base|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_48|))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse1 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse2 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (= |c_node_create_#res#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse3) (bvule .cse3 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4)) (not (bvule .cse4 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))))) (= (_ bv8 32) (select |c_#length| |c_node_create_#res#1.base|))) is different from false [2021-11-20 23:41:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:41:18,961 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2021-11-20 23:41:18,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:41:18,962 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25 [2021-11-20 23:41:18,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:41:18,963 INFO L225 Difference]: With dead ends: 137 [2021-11-20 23:41:18,963 INFO L226 Difference]: Without dead ends: 137 [2021-11-20 23:41:18,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 80.9s TimeCoverageRelationStatistics Valid=84, Invalid=271, Unknown=23, NotChecked=378, Total=756 [2021-11-20 23:41:18,965 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 7 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 762 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:41:18,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 721 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 239 Invalid, 0 Unknown, 762 Unchecked, 0.8s Time] [2021-11-20 23:41:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-20 23:41:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2021-11-20 23:41:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.646341463414634) internal successors, (135), 126 states have internal predecessors, (135), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 23:41:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2021-11-20 23:41:18,975 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 25 [2021-11-20 23:41:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:41:18,975 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2021-11-20 23:41:18,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-20 23:41:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2021-11-20 23:41:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 23:41:18,978 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:41:18,978 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-20 23:41:18,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2021-11-20 23:41:19,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-20 23:41:19,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-20 23:41:19,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:41:19,583 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:41:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:41:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash 512234271, now seen corresponding path program 1 times [2021-11-20 23:41:19,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:41:19,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2267927] [2021-11-20 23:41:19,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:41:19,584 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:41:19,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:41:19,586 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:41:19,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-20 23:41:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:41:19,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 23:41:19,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:41:19,792 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-11-20 23:41:19,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-11-20 23:41:19,978 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-20 23:41:19,979 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 24 treesize of output 31 [2021-11-20 23:41:20,125 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:41:20,125 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 37 treesize of output 33 [2021-11-20 23:41:20,292 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-20 23:41:20,292 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 54 treesize of output 65 [2021-11-20 23:41:21,147 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-20 23:41:21,147 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 56 treesize of output 67 [2021-11-20 23:41:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:41:21,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:42:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 6 refuted. 13 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:42:00,204 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:42:00,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2267927] [2021-11-20 23:42:00,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2267927] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:42:00,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [26255709] [2021-11-20 23:42:00,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:42:00,205 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-20 23:42:00,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-20 23:42:00,206 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-20 23:42:00,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-11-20 23:42:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:42:00,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 23:42:00,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:42:00,673 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-20 23:42:00,673 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 14 treesize of output 19 [2021-11-20 23:42:00,850 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:42:00,851 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 21 treesize of output 17 [2021-11-20 23:42:01,061 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-20 23:42:01,061 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 26 treesize of output 37 [2021-11-20 23:42:01,402 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-20 23:42:01,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 37 [2021-11-20 23:42:03,835 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-20 23:42:03,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 66 [2021-11-20 23:42:04,815 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-20 23:42:04,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 37 [2021-11-20 23:42:05,172 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-20 23:42:05,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 71 [2021-11-20 23:42:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-20 23:42:05,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:42:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-20 23:42:12,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [26255709] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:42:12,473 INFO L186 FreeRefinementEngine]: Found 2 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:42:12,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [10, 10] total 26 [2021-11-20 23:42:12,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74117673] [2021-11-20 23:42:12,474 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:42:12,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:42:12,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:42:12,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:42:12,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=568, Unknown=14, NotChecked=0, Total=702 [2021-11-20 23:42:12,476 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 23:42:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:42:12,516 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2021-11-20 23:42:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 23:42:12,518 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2021-11-20 23:42:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:42:12,519 INFO L225 Difference]: With dead ends: 135 [2021-11-20 23:42:12,519 INFO L226 Difference]: Without dead ends: 135 [2021-11-20 23:42:12,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 44.3s TimeCoverageRelationStatistics Valid=120, Invalid=568, Unknown=14, NotChecked=0, Total=702 [2021-11-20 23:42:12,521 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 17 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:42:12,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 408 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 124 Unchecked, 0.0s Time] [2021-11-20 23:42:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-11-20 23:42:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2021-11-20 23:42:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 125 states have internal predecessors, (134), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 23:42:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2021-11-20 23:42:12,529 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 37 [2021-11-20 23:42:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:42:12,530 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2021-11-20 23:42:12,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 23:42:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2021-11-20 23:42:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 23:42:12,532 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:42:12,532 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-20 23:42:12,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2021-11-20 23:42:12,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-20 23:42:12,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:42:12,947 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:42:12,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:42:12,947 INFO L85 PathProgramCache]: Analyzing trace with hash 512234272, now seen corresponding path program 1 times [2021-11-20 23:42:12,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:42:12,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672647619] [2021-11-20 23:42:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:42:12,948 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:42:12,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:42:12,956 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:42:12,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-20 23:42:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:42:13,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-20 23:42:13,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:42:13,193 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-11-20 23:42:13,205 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-11-20 23:42:13,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-11-20 23:42:13,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-20 23:42:13,531 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:42:13,532 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 27 treesize of output 29 [2021-11-20 23:42:13,546 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:42:13,547 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 26 treesize of output 22 [2021-11-20 23:42:13,712 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:42:13,712 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 14 treesize of output 14 [2021-11-20 23:42:14,072 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-20 23:42:14,072 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 29 treesize of output 34 [2021-11-20 23:42:15,113 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-20 23:42:15,114 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 23 treesize of output 32 [2021-11-20 23:42:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:42:15,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:42:21,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_103| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_2|))) (or (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_103| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|)) (not (bvule |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_2| .cse0)) (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_2|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|))))))) is different from false [2021-11-20 23:42:24,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_106| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|))))) is different from false [2021-11-20 23:42:44,873 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_106| (_ BitVec 32))) (or (not (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|)) (exists ((|v_node_create_~temp~0#1.base_106| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_110| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_110|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_110| (_ bv8 32)) |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))) (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))))) is different from true [2021-11-20 23:43:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 20 not checked. [2021-11-20 23:43:38,307 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:43:38,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672647619] [2021-11-20 23:43:38,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672647619] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:43:38,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1037473825] [2021-11-20 23:43:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:43:38,308 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-20 23:43:38,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-20 23:43:38,309 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-20 23:43:38,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2021-11-20 23:43:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:43:38,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-20 23:43:38,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:43:38,568 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-11-20 23:43:40,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-20 23:43:40,385 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 23:43:40,385 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 15 treesize of output 17 [2021-11-20 23:43:40,902 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:43:40,902 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 17 treesize of output 13 [2021-11-20 23:43:43,302 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-20 23:43:43,303 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 23 treesize of output 28 [2021-11-20 23:43:45,534 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:43:45,534 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 17 treesize of output 13 [2021-11-20 23:43:45,863 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-20 23:43:45,863 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 32 treesize of output 37 [2021-11-20 23:43:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-20 23:43:46,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:46:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 15 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:46:18,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1037473825] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:46:18,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:46:18,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 12, 10] total 35 [2021-11-20 23:46:18,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056277374] [2021-11-20 23:46:18,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:46:18,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 23:46:18,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:46:18,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 23:46:18,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=835, Unknown=67, NotChecked=192, Total=1260 [2021-11-20 23:46:18,753 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:46:19,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:46:19,266 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2021-11-20 23:46:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:46:19,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-11-20 23:46:19,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:46:19,268 INFO L225 Difference]: With dead ends: 134 [2021-11-20 23:46:19,268 INFO L226 Difference]: Without dead ends: 134 [2021-11-20 23:46:19,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 193.1s TimeCoverageRelationStatistics Valid=166, Invalid=835, Unknown=67, NotChecked=192, Total=1260 [2021-11-20 23:46:19,271 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:46:19,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 440 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 202 Unchecked, 0.5s Time] [2021-11-20 23:46:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-20 23:46:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2021-11-20 23:46:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.6219512195121952) internal successors, (133), 124 states have internal predecessors, (133), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 23:46:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2021-11-20 23:46:19,279 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 37 [2021-11-20 23:46:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:46:19,280 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2021-11-20 23:46:19,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:46:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2021-11-20 23:46:19,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-20 23:46:19,282 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:46:19,283 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-20 23:46:19,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-20 23:46:19,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2021-11-20 23:46:19,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt [2021-11-20 23:46:19,698 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:46:19,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:46:19,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1664104416, now seen corresponding path program 1 times [2021-11-20 23:46:19,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:46:19,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899567091] [2021-11-20 23:46:19,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:46:19,700 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:46:19,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:46:19,700 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:46:19,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-20 23:46:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:46:19,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 23:46:19,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:46:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-20 23:46:19,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:46:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-20 23:46:19,967 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:46:19,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899567091] [2021-11-20 23:46:19,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899567091] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:46:19,967 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:46:19,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-20 23:46:19,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573468251] [2021-11-20 23:46:19,968 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:46:19,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 23:46:19,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:46:19,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 23:46:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:46:19,968 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 23:46:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:46:20,239 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2021-11-20 23:46:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:46:20,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2021-11-20 23:46:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:46:20,242 INFO L225 Difference]: With dead ends: 146 [2021-11-20 23:46:20,242 INFO L226 Difference]: Without dead ends: 146 [2021-11-20 23:46:20,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 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-11-20 23:46:20,243 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 79 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:46:20,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 100 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 23:46:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-20 23:46:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2021-11-20 23:46:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.5609756097560976) internal successors, (128), 119 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 23:46:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2021-11-20 23:46:20,251 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 39 [2021-11-20 23:46:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:46:20,252 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2021-11-20 23:46:20,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 23:46:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2021-11-20 23:46:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-20 23:46:20,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:46:20,254 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-20 23:46:20,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-20 23:46:20,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:46:20,462 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:46:20,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:46:20,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1664104415, now seen corresponding path program 1 times [2021-11-20 23:46:20,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:46:20,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262065876] [2021-11-20 23:46:20,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:46:20,464 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:46:20,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:46:20,465 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:46:20,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-20 23:46:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:46:20,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 23:46:20,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:46:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-20 23:46:20,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:46:20,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-11-20 23:46:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-20 23:46:21,155 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:46:21,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262065876] [2021-11-20 23:46:21,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262065876] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:46:21,155 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:46:21,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-20 23:46:21,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724744976] [2021-11-20 23:46:21,156 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:46:21,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 23:46:21,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:46:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 23:46:21,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-20 23:46:21,158 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 23:46:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:46:21,555 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2021-11-20 23:46:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:46:21,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2021-11-20 23:46:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:46:21,558 INFO L225 Difference]: With dead ends: 123 [2021-11-20 23:46:21,558 INFO L226 Difference]: Without dead ends: 123 [2021-11-20 23:46:21,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-20 23:46:21,559 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 241 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:46:21,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 133 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 23:46:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-20 23:46:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-11-20 23:46:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 82 states have (on average 1.5) internal successors, (123), 114 states have internal predecessors, (123), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 23:46:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2021-11-20 23:46:21,570 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 39 [2021-11-20 23:46:21,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:46:21,571 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2021-11-20 23:46:21,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 23:46:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2021-11-20 23:46:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-20 23:46:21,573 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:46:21,573 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-20 23:46:21,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-20 23:46:21,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:46:21,788 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:46:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:46:21,789 INFO L85 PathProgramCache]: Analyzing trace with hash -47629334, now seen corresponding path program 1 times [2021-11-20 23:46:21,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:46:21,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934302792] [2021-11-20 23:46:21,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:46:21,790 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:46:21,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:46:21,791 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:46:21,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-20 23:46:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:46:21,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 23:46:21,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:46:22,028 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-11-20 23:46:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-20 23:46:22,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:46:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-20 23:46:22,436 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:46:22,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934302792] [2021-11-20 23:46:22,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934302792] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:46:22,436 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:46:22,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-20 23:46:22,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731513189] [2021-11-20 23:46:22,437 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:46:22,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:46:22,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:46:22,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:46:22,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:46:22,438 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 23:46:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:46:23,301 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2021-11-20 23:46:23,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:46:23,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2021-11-20 23:46:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:46:23,303 INFO L225 Difference]: With dead ends: 139 [2021-11-20 23:46:23,303 INFO L226 Difference]: Without dead ends: 139 [2021-11-20 23:46:23,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 23:46:23,305 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 73 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:46:23,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 245 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-20 23:46:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-20 23:46:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 121. [2021-11-20 23:46:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.475609756097561) internal successors, (121), 112 states have internal predecessors, (121), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 23:46:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2021-11-20 23:46:23,312 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 40 [2021-11-20 23:46:23,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:46:23,313 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2021-11-20 23:46:23,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 23:46:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2021-11-20 23:46:23,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-20 23:46:23,315 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:46:23,315 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-20 23:46:23,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-11-20 23:46:23,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:46:23,530 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:46:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:46:23,531 INFO L85 PathProgramCache]: Analyzing trace with hash -47629333, now seen corresponding path program 1 times [2021-11-20 23:46:23,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:46:23,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731351234] [2021-11-20 23:46:23,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:46:23,532 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:46:23,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:46:23,533 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:46:23,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-20 23:46:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:46:23,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 23:46:23,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:46:23,774 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-11-20 23:46:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-20 23:46:24,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:46:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-20 23:46:24,718 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:46:24,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731351234] [2021-11-20 23:46:24,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731351234] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:46:24,719 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:46:24,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-20 23:46:24,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657768908] [2021-11-20 23:46:24,719 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:46:24,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:46:24,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:46:24,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:46:24,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-20 23:46:24,721 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-20 23:46:26,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:46:26,320 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2021-11-20 23:46:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:46:26,321 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2021-11-20 23:46:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:46:26,322 INFO L225 Difference]: With dead ends: 119 [2021-11-20 23:46:26,322 INFO L226 Difference]: Without dead ends: 119 [2021-11-20 23:46:26,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-20 23:46:26,323 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 148 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:46:26,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 368 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-20 23:46:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-20 23:46:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-11-20 23:46:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.451219512195122) internal successors, (119), 110 states have internal predecessors, (119), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 23:46:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2021-11-20 23:46:26,330 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 40 [2021-11-20 23:46:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:46:26,331 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2021-11-20 23:46:26,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-20 23:46:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2021-11-20 23:46:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-20 23:46:26,333 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:46:26,333 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-20 23:46:26,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-20 23:46:26,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:46:26,546 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:46:26,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:46:26,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1476263067, now seen corresponding path program 1 times [2021-11-20 23:46:26,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:46:26,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452704973] [2021-11-20 23:46:26,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:46:26,547 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:46:26,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:46:26,548 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:46:26,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-20 23:46:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:46:26,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-20 23:46:26,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:46:26,896 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-11-20 23:46:27,428 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 17 treesize of output 13 [2021-11-20 23:46:30,215 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-20 23:46:30,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 50 [2021-11-20 23:46:30,287 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-20 23:46:30,287 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 47 treesize of output 58 [2021-11-20 23:46:30,895 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 23:46:30,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 36 [2021-11-20 23:46:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:46:31,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:46:38,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) is different from false [2021-11-20 23:46:41,263 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) is different from false [2021-11-20 23:46:43,428 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) is different from false [2021-11-20 23:46:45,927 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_167| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_167| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_167| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_167|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_167|)))) (not (bvult |v_node_create_~temp~0#1.base_167| |c_#StackHeapBarrier|)))) is different from true [2021-11-20 23:46:45,944 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 146 treesize of output 138 [2021-11-20 23:46:48,543 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:46:48,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 107 [2021-11-20 23:46:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-20 23:46:49,754 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:46:49,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452704973] [2021-11-20 23:46:49,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452704973] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:46:49,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [620995737] [2021-11-20 23:46:49,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:46:49,754 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-20 23:46:49,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-20 23:46:49,756 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-20 23:46:49,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-11-20 23:46:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:46:49,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-20 23:46:49,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:46:50,270 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-11-20 23:46:51,423 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 18 treesize of output 14 [2021-11-20 23:46:51,844 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-20 23:46:51,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 51 [2021-11-20 23:46:51,909 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-20 23:46:51,909 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 48 treesize of output 59 [2021-11-20 23:46:53,181 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 23:46:53,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2021-11-20 23:46:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:46:53,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:47:00,132 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1))))) is different from false [2021-11-20 23:47:02,647 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (_ bv1 1))))) is different from false [2021-11-20 23:47:04,817 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1))))) is different from false [2021-11-20 23:47:07,277 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_178| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_178| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_178| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_178|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_178|)))) (not (bvult |v_node_create_~temp~0#1.base_178| |c_#StackHeapBarrier|)))) is different from true [2021-11-20 23:47:07,291 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 146 treesize of output 138 [2021-11-20 23:47:11,412 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:47:11,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 107 [2021-11-20 23:47:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-20 23:47:11,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [620995737] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:47:11,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491856543] [2021-11-20 23:47:11,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:47:11,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:47:11,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:47:11,926 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:47:11,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-20 23:47:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:47:12,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-20 23:47:12,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:47:12,142 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-11-20 23:47:13,601 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-11-20 23:47:13,857 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 53 treesize of output 41 [2021-11-20 23:47:18,505 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-20 23:47:18,505 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 1 case distinctions, treesize of input 53 treesize of output 49 [2021-11-20 23:47:18,566 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-20 23:47:18,566 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 49 treesize of output 56 [2021-11-20 23:47:21,386 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:47:21,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2021-11-20 23:47:24,458 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:47:24,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2021-11-20 23:47:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:47:25,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:47:26,691 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 23:47:26,691 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 1 case distinctions, treesize of input 84 treesize of output 73 [2021-11-20 23:47:26,738 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-20 23:47:26,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 72 [2021-11-20 23:47:28,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_188| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) (_ bv1 1))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |v_node_create_~temp~0#1.base_188|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| (_ bv0 32))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_188|)))))))) is different from false [2021-11-20 23:47:31,703 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse0)))) (_ bv1 1))) (and (= .cse0 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32)))))) is different from true [2021-11-20 23:47:37,163 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse0)))) (_ bv1 1))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (and (= (_ bv0 32) .cse0) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32))))))) is different from false [2021-11-20 23:47:39,175 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse0)))) (_ bv1 1))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (and (= (_ bv0 32) .cse0) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32))))))) is different from true [2021-11-20 23:47:39,369 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 264 treesize of output 256 [2021-11-20 23:47:43,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))) (_ bv1 1))) (and (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))))) is different from false [2021-11-20 23:47:45,824 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))) (_ bv1 1))) (and (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))))) is different from true [2021-11-20 23:47:53,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (and (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_189|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_189| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_189|)))))) is different from false [2021-11-20 23:47:55,676 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (and (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_189|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_189| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_189|)))))) is different from true [2021-11-20 23:47:55,691 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 142 treesize of output 134 [2021-11-20 23:48:17,427 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:48:17,427 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 46 treesize of output 42 [2021-11-20 23:48:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-20 23:48:32,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491856543] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:48:32,830 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-20 23:48:32,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17, 16, 18, 18] total 74 [2021-11-20 23:48:32,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347297021] [2021-11-20 23:48:32,830 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-20 23:48:32,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2021-11-20 23:48:32,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:48:32,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-11-20 23:48:32,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=3501, Unknown=38, NotChecked=1716, Total=5550 [2021-11-20 23:48:32,835 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 75 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 65 states have internal predecessors, (142), 10 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) [2021-11-20 23:49:27,884 WARN L227 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 67 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:49:29,958 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (and (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_189|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_189| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_189|)))))) (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_167| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_167| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_167| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_167|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_167|)))) (not (bvult |v_node_create_~temp~0#1.base_167| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_178| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_178| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_178| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_178|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_178|)))) (not (bvult |v_node_create_~temp~0#1.base_178| |c_#StackHeapBarrier|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) is different from false [2021-11-20 23:49:32,008 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))) (_ bv1 1))) (and (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1))))) (= (_ bv0 1) (bvneg .cse0)) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= (_ bv0 1) .cse0))) is different from false [2021-11-20 23:49:34,049 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (and (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse0)))) (_ bv1 1))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (and (= (_ bv0 32) .cse0) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32))))))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (store (select |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset|) (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (_ bv1 1))))) (= (_ bv0 1) (bvneg .cse1)) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) .cse1))) is different from false [2021-11-20 23:49:36,091 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse1)))) (_ bv1 1))) (and (= .cse1 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32))))))) is different from false [2021-11-20 23:49:38,155 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse1)))) (_ bv1 1))) (and (= .cse1 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32))))))) is different from false [2021-11-20 23:49:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:49:44,192 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2021-11-20 23:49:44,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-20 23:49:44,193 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 65 states have internal predecessors, (142), 10 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) Word has length 41 [2021-11-20 23:49:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:49:44,194 INFO L225 Difference]: With dead ends: 127 [2021-11-20 23:49:44,194 INFO L226 Difference]: Without dead ends: 127 [2021-11-20 23:49:44,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 160 SyntacticMatches, 8 SemanticMatches, 88 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 2170 ImplicationChecksByTransitivity, 167.0s TimeCoverageRelationStatistics Valid=445, Invalid=4674, Unknown=65, NotChecked=2826, Total=8010 [2021-11-20 23:49:44,198 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 42 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1784 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:49:44,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 1919 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 607 Invalid, 0 Unknown, 1784 Unchecked, 3.2s Time] [2021-11-20 23:49:44,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-20 23:49:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-11-20 23:49:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 117 states have internal predecessors, (127), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 23:49:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2021-11-20 23:49:44,203 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 41 [2021-11-20 23:49:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:49:44,204 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2021-11-20 23:49:44,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 65 states have internal predecessors, (142), 10 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) [2021-11-20 23:49:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2021-11-20 23:49:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-20 23:49:44,205 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:49:44,205 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-20 23:49:44,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-20 23:49:44,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2021-11-20 23:49:44,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-20 23:49:44,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:49:44,806 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-20 23:49:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:49:44,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1476263066, now seen corresponding path program 1 times [2021-11-20 23:49:44,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:49:44,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102764535] [2021-11-20 23:49:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:49:44,814 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:49:44,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:49:44,815 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:49:44,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-20 23:49:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:49:45,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-20 23:49:45,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:49:45,185 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-11-20 23:49:45,202 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-11-20 23:49:46,324 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 35 treesize of output 27 [2021-11-20 23:49:46,336 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 11 treesize of output 7 [2021-11-20 23:49:49,668 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-20 23:49:49,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 84 [2021-11-20 23:49:49,794 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-20 23:49:49,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 73 [2021-11-20 23:49:49,847 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-20 23:49:49,847 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 70 treesize of output 72 [2021-11-20 23:49:49,885 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:49:49,885 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 69 treesize of output 69 [2021-11-20 23:49:50,828 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 23:49:50,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2021-11-20 23:49:50,851 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 23:49:50,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2021-11-20 23:49:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:49:51,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:50:53,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_199| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_199|)))) (or (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) v_prenex_1))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199|) v_prenex_1 (_ bv0 32)) .cse0 v_prenex_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_199| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_199| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_199|) v_prenex_1 (_ bv0 32)) .cse0 v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((|v_node_create_~temp~0#1.offset_189| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199|) |v_node_create_~temp~0#1.offset_189| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_189|) v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) (bvult |v_node_create_~temp~0#1.base_199| |c_#StackHeapBarrier|))) (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse2 v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse2 v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|))))) (forall ((v_DerPreprocessor_10 (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse3 (bvadd .cse3 (_ bv4 32)))))))) is different from false [2021-11-20 23:50:56,954 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|))))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) (exists ((|v_node_create_~temp~0#1.base_199| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_199|)))) (or (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) v_prenex_1))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199|) v_prenex_1 (_ bv0 32)) .cse2 v_prenex_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_199| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_199| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_199|) v_prenex_1 (_ bv0 32)) .cse2 v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((|v_node_create_~temp~0#1.offset_189| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199|) |v_node_create_~temp~0#1.offset_189| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_189|) v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))))) (bvult |v_node_create_~temp~0#1.base_199| |c_#StackHeapBarrier|))))) is different from false [2021-11-20 23:51:04,869 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_200| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_199| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_199|)))) (or (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) v_prenex_1))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199|) v_prenex_1 (_ bv0 32)) .cse0 v_prenex_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_199| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_199| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_199|) v_prenex_1 (_ bv0 32)) .cse0 v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((|v_node_create_~temp~0#1.offset_189| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_199|) |v_node_create_~temp~0#1.offset_189| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_189|) v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) (bvult |v_node_create_~temp~0#1.base_199| |c_#StackHeapBarrier|))) (not (bvult |v_node_create_~temp~0#1.base_200| |c_#StackHeapBarrier|)) (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_200| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_200|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse2 v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_#length| |v_node_create_~temp~0#1.base_200| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_200| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_200|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse2 v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|))))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_200| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_200|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_14|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_200|)))))) is different from true [2021-11-20 23:51:04,897 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 431 treesize of output 419 [2021-11-20 23:51:04,908 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 1180 treesize of output 1128 [2021-11-20 23:51:13,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-11-20 23:51:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-11-20 23:51:15,958 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:51:15,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102764535] [2021-11-20 23:51:15,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102764535] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:51:15,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [99005459] [2021-11-20 23:51:15,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:51:15,958 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-20 23:51:15,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-20 23:51:15,968 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-20 23:51:15,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebec9ebf-9dc9-4162-b0ce-de793d67e57a/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2021-11-20 23:51:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:51:16,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-20 23:51:16,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:51:16,640 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-11-20 23:51:16,657 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-11-20 23:51:18,808 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 35 treesize of output 27 [2021-11-20 23:51:18,821 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 11 treesize of output 7 [2021-11-20 23:51:19,552 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-20 23:51:19,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 84 [2021-11-20 23:51:19,684 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-20 23:51:19,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 73 [2021-11-20 23:51:19,739 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-20 23:51:19,740 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 70 treesize of output 72 [2021-11-20 23:51:19,779 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-20 23:51:19,780 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 69 treesize of output 69 [2021-11-20 23:51:21,103 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 23:51:21,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 48 [2021-11-20 23:51:21,120 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 23:51:21,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2021-11-20 23:51:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:51:21,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:51:44,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))) (let ((.cse0 (bvadd (_ bv4 32) .cse1))) (and (bvule .cse0 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))) (bvule .cse1 .cse0)))) (exists ((|v_node_create_~temp~0#1.base_210| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_210|)))) (or (exists ((v_DerPreprocessor_13 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_200| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210|) |v_node_create_~temp~0#1.offset_200| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_200|) v_DerPreprocessor_13)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) (exists ((v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_200| (_ BitVec 32))) (not (let ((.cse3 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_200|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210|) |v_node_create_~temp~0#1.offset_200| (_ bv0 32)) .cse3 v_DerPreprocessor_13)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_210| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_210| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_210|) |v_node_create_~temp~0#1.offset_200| (_ bv0 32)) .cse3 v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))))))) (bvult |v_node_create_~temp~0#1.base_210| |c_#StackHeapBarrier|))))) is different from false [2021-11-20 23:51:51,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_15 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_15)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse1 v_DerPreprocessor_15)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse1 v_DerPreprocessor_14)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|)))))) (exists ((|v_node_create_~temp~0#1.base_210| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_210|)))) (or (exists ((v_DerPreprocessor_13 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_200| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210|) |v_node_create_~temp~0#1.offset_200| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_200|) v_DerPreprocessor_13)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse3 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210|) v_prenex_6 (_ bv0 32)) .cse3 v_prenex_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_210| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_210| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_210|) v_prenex_6 (_ bv0 32)) .cse3 v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))))))) (bvult |v_node_create_~temp~0#1.base_210| |c_#StackHeapBarrier|))))) is different from false [2021-11-20 23:51:55,939 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_15)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse1 v_DerPreprocessor_15)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse1 v_DerPreprocessor_14)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|)))))) (exists ((|v_node_create_~temp~0#1.base_210| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_210|)))) (or (exists ((v_DerPreprocessor_13 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_200| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210|) |v_node_create_~temp~0#1.offset_200| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_200|) v_DerPreprocessor_13)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse3 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210|) v_prenex_6 (_ bv0 32)) .cse3 v_prenex_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_210| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_210| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_210|) v_prenex_6 (_ bv0 32)) .cse3 v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))))))) (bvult |v_node_create_~temp~0#1.base_210| |c_#StackHeapBarrier|))))) is different from false [2021-11-20 23:52:05,395 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_211| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (not (bvult |v_node_create_~temp~0#1.base_211| |c_#StackHeapBarrier|)) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_211|)))) (exists ((|v_node_create_~temp~0#1.base_210| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_210|)))) (or (exists ((v_DerPreprocessor_13 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_200| (_ BitVec 32))) (not (let ((.cse0 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210|) |v_node_create_~temp~0#1.offset_200| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_200|) v_DerPreprocessor_13)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_210|) v_prenex_6 (_ bv0 32)) .cse1 v_prenex_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_210| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_210| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_210|) v_prenex_6 (_ bv0 32)) .cse1 v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))))))) (bvult |v_node_create_~temp~0#1.base_210| |c_#StackHeapBarrier|))) (and (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_211| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_211|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_15)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32))) (let ((.cse3 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_211| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_211|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse3 v_DerPreprocessor_15)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_#length| |v_node_create_~temp~0#1.base_211| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_211| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_211|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse3 v_DerPreprocessor_14)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_16|)))))))) is different from true [2021-11-20 23:52:05,413 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 430 treesize of output 418 [2021-11-20 23:52:05,425 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 1179 treesize of output 1127