./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_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_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/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_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/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_654baa15-39d6-4894-b417-f1d8cd9b0786/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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:09:07,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:09:07,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:09:07,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:09:07,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:09:07,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:09:07,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:09:07,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:09:07,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:09:07,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:09:07,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:09:07,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:09:07,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:09:07,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:09:07,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:09:07,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:09:07,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:09:07,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:09:07,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:09:07,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:09:07,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:09:07,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:09:07,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:09:07,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:09:07,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:09:07,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:09:07,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:09:07,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:09:07,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:09:07,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:09:07,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:09:07,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:09:07,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:09:07,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:09:07,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:09:07,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:09:07,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:09:07,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:09:07,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:09:07,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:09:07,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:09:07,151 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-21 00:09:07,210 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:09:07,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:09:07,211 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:09:07,211 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:09:07,212 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:09:07,213 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:09:07,213 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:09:07,213 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:09:07,213 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:09:07,214 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 00:09:07,215 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:09:07,215 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:09:07,215 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 00:09:07,215 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 00:09:07,216 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:09:07,216 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 00:09:07,216 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 00:09:07,216 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 00:09:07,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 00:09:07,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 00:09:07,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:09:07,218 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:09:07,218 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 00:09:07,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:09:07,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:09:07,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:09:07,220 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 00:09:07,220 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 00:09:07,221 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 00:09:07,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:09:07,221 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 00:09:07,221 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:09:07,222 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:09:07,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:09:07,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:09:07,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:09:07,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:09:07,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:09:07,223 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 00:09:07,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 00:09:07,223 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:09:07,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:09:07,224 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_654baa15-39d6-4894-b417-f1d8cd9b0786/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_654baa15-39d6-4894-b417-f1d8cd9b0786/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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2021-11-21 00:09:07,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:09:07,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:09:07,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:09:07,581 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:09:07,582 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:09:07,583 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2021-11-21 00:09:07,664 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/data/f09ff0ed9/d2ff9e0fb5d14a9891920d5e12d6eff4/FLAG4bfca85c5 [2021-11-21 00:09:08,210 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:09:08,211 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2021-11-21 00:09:08,225 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/data/f09ff0ed9/d2ff9e0fb5d14a9891920d5e12d6eff4/FLAG4bfca85c5 [2021-11-21 00:09:08,509 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/data/f09ff0ed9/d2ff9e0fb5d14a9891920d5e12d6eff4 [2021-11-21 00:09:08,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:09:08,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:09:08,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:09:08,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:09:08,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:09:08,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:09:08" (1/1) ... [2021-11-21 00:09:08,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22201721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:08, skipping insertion in model container [2021-11-21 00:09:08,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:09:08" (1/1) ... [2021-11-21 00:09:08,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:09:08,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:09:08,940 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_654baa15-39d6-4894-b417-f1d8cd9b0786/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2021-11-21 00:09:08,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:09:08,961 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:09:09,037 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_654baa15-39d6-4894-b417-f1d8cd9b0786/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2021-11-21 00:09:09,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:09:09,075 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:09:09,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:09 WrapperNode [2021-11-21 00:09:09,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:09:09,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:09:09,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:09:09,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:09:09,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:09" (1/1) ... [2021-11-21 00:09:09,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:09" (1/1) ... [2021-11-21 00:09:09,158 INFO L137 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2021-11-21 00:09:09,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:09:09,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:09:09,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:09:09,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:09:09,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:09" (1/1) ... [2021-11-21 00:09:09,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:09" (1/1) ... [2021-11-21 00:09:09,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:09" (1/1) ... [2021-11-21 00:09:09,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:09" (1/1) ... [2021-11-21 00:09:09,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:09" (1/1) ... [2021-11-21 00:09:09,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:09" (1/1) ... [2021-11-21 00:09:09,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:09" (1/1) ... [2021-11-21 00:09:09,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:09:09,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:09:09,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:09:09,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:09:09,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:09" (1/1) ... [2021-11-21 00:09:09,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:09:09,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:09:09,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:09:09,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:09:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 00:09:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 00:09:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 00:09:09,288 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 00:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 00:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 00:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 00:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 00:09:09,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 00:09:09,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:09:09,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:09:09,446 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:09:09,448 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:09:09,901 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:09:09,941 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:09:09,941 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 00:09:09,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:09:09 BoogieIcfgContainer [2021-11-21 00:09:09,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:09:09,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:09:09,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:09:09,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:09:09,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:09:08" (1/3) ... [2021-11-21 00:09:09,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0b57ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:09:09, skipping insertion in model container [2021-11-21 00:09:09,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:09" (2/3) ... [2021-11-21 00:09:09,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0b57ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:09:09, skipping insertion in model container [2021-11-21 00:09:09,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:09:09" (3/3) ... [2021-11-21 00:09:09,953 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2021-11-21 00:09:09,958 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:09:09,958 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2021-11-21 00:09:10,004 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:09:10,011 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-21 00:09:10,011 INFO L340 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2021-11-21 00:09:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 46 states have (on average 2.3260869565217392) internal successors, (107), 96 states have internal predecessors, (107), 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-21 00:09:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-21 00:09:10,036 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:10,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-21 00:09:10,037 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:10,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:10,043 INFO L85 PathProgramCache]: Analyzing trace with hash 215348405, now seen corresponding path program 1 times [2021-11-21 00:09:10,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:09:10,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919392259] [2021-11-21 00:09:10,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:10,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:09:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:10,213 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-21 00:09:10,213 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:09:10,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919392259] [2021-11-21 00:09:10,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919392259] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:09:10,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:09:10,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 00:09:10,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166970751] [2021-11-21 00:09:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:09:10,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:09:10,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:09:10,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:09:10,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:09:10,250 INFO L87 Difference]: Start difference. First operand has 101 states, 46 states have (on average 2.3260869565217392) internal successors, (107), 96 states have internal predecessors, (107), 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-21 00:09:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:09:10,424 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2021-11-21 00:09:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:09:10,426 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-21 00:09:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:09:10,435 INFO L225 Difference]: With dead ends: 99 [2021-11-21 00:09:10,436 INFO L226 Difference]: Without dead ends: 97 [2021-11-21 00:09:10,437 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-21 00:09:10,446 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:09:10,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 137 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:09:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-21 00:09:10,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-11-21 00:09:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 45 states have (on average 2.2) 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-21 00:09:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-11-21 00:09:10,510 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 5 [2021-11-21 00:09:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:09:10,511 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-11-21 00:09:10,511 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-21 00:09:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-11-21 00:09:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-21 00:09:10,512 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:10,512 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-21 00:09:10,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 00:09:10,513 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:10,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:10,516 INFO L85 PathProgramCache]: Analyzing trace with hash 215348406, now seen corresponding path program 1 times [2021-11-21 00:09:10,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:09:10,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984813466] [2021-11-21 00:09:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:10,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:09:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:10,581 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-21 00:09:10,582 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:09:10,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984813466] [2021-11-21 00:09:10,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984813466] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:09:10,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:09:10,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 00:09:10,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937019116] [2021-11-21 00:09:10,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:09:10,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:09:10,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:09:10,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:09:10,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:09:10,586 INFO L87 Difference]: Start difference. First operand 97 states and 105 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-21 00:09:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:09:10,708 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2021-11-21 00:09:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:09:10,709 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-21 00:09:10,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:09:10,715 INFO L225 Difference]: With dead ends: 95 [2021-11-21 00:09:10,716 INFO L226 Difference]: Without dead ends: 95 [2021-11-21 00:09:10,720 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-21 00:09:10,722 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:09:10,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 142 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:09:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-21 00:09:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-11-21 00:09:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 90 states have internal predecessors, (97), 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-21 00:09:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2021-11-21 00:09:10,746 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 5 [2021-11-21 00:09:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:09:10,746 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2021-11-21 00:09:10,747 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-21 00:09:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2021-11-21 00:09:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 00:09:10,747 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:10,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:09:10,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 00:09:10,748 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:10,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1291578560, now seen corresponding path program 1 times [2021-11-21 00:09:10,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:09:10,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044104537] [2021-11-21 00:09:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:10,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:09:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:10,860 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-21 00:09:10,860 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:09:10,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044104537] [2021-11-21 00:09:10,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044104537] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:09:10,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:09:10,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 00:09:10,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116301642] [2021-11-21 00:09:10,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:09:10,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:09:10,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:09:10,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:09:10,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:09:10,864 INFO L87 Difference]: Start difference. First operand 95 states and 103 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-21 00:09:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:09:10,914 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2021-11-21 00:09:10,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:09:10,915 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-21 00:09:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:09:10,916 INFO L225 Difference]: With dead ends: 101 [2021-11-21 00:09:10,916 INFO L226 Difference]: Without dead ends: 101 [2021-11-21 00:09:10,917 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-21 00:09:10,918 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 4 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 175 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-21 00:09:10,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 175 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:09:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-21 00:09:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2021-11-21 00:09:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 46 states have (on average 2.130434782608696) 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-21 00:09:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-11-21 00:09:10,929 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 10 [2021-11-21 00:09:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:09:10,929 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-11-21 00:09:10,929 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-21 00:09:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-11-21 00:09:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-21 00:09:10,930 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:10,930 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:09:10,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 00:09:10,931 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:10,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1840990944, now seen corresponding path program 1 times [2021-11-21 00:09:10,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:09:10,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281185661] [2021-11-21 00:09:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:10,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:09:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:11,008 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-21 00:09:11,008 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:09:11,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281185661] [2021-11-21 00:09:11,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281185661] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:09:11,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:09:11,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 00:09:11,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630765894] [2021-11-21 00:09:11,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:09:11,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:09:11,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:09:11,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:09:11,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:09:11,011 INFO L87 Difference]: Start difference. First operand 96 states and 104 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-21 00:09:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:09:11,206 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2021-11-21 00:09:11,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:09:11,209 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-21 00:09:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:09:11,214 INFO L225 Difference]: With dead ends: 96 [2021-11-21 00:09:11,214 INFO L226 Difference]: Without dead ends: 96 [2021-11-21 00:09:11,214 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-21 00:09:11,222 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 9 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:09:11,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 272 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 00:09:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-21 00:09:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2021-11-21 00:09:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 46 states have (on average 2.108695652173913) internal successors, (97), 90 states have internal predecessors, (97), 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-21 00:09:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2021-11-21 00:09:11,237 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 17 [2021-11-21 00:09:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:09:11,237 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2021-11-21 00:09:11,238 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-21 00:09:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2021-11-21 00:09:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-21 00:09:11,239 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:11,239 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:09:11,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 00:09:11,240 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1840990945, now seen corresponding path program 1 times [2021-11-21 00:09:11,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:09:11,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794455947] [2021-11-21 00:09:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:11,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:09:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:11,360 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-21 00:09:11,360 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:09:11,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794455947] [2021-11-21 00:09:11,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794455947] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:09:11,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:09:11,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 00:09:11,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515509456] [2021-11-21 00:09:11,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:09:11,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:09:11,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:09:11,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:09:11,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:09:11,362 INFO L87 Difference]: Start difference. First operand 95 states and 103 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-21 00:09:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:09:11,529 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2021-11-21 00:09:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:09:11,529 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-21 00:09:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:09:11,531 INFO L225 Difference]: With dead ends: 95 [2021-11-21 00:09:11,531 INFO L226 Difference]: Without dead ends: 95 [2021-11-21 00:09:11,531 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-21 00:09:11,532 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 7 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:09:11,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 296 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:09:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-21 00:09:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2021-11-21 00:09:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 89 states have internal predecessors, (96), 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-21 00:09:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2021-11-21 00:09:11,554 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 17 [2021-11-21 00:09:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:09:11,554 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2021-11-21 00:09:11,554 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-21 00:09:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2021-11-21 00:09:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-21 00:09:11,555 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:11,555 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:09:11,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-21 00:09:11,556 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:11,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:11,556 INFO L85 PathProgramCache]: Analyzing trace with hash -334043550, now seen corresponding path program 1 times [2021-11-21 00:09:11,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:09:11,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122985151] [2021-11-21 00:09:11,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:11,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:09:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:11,769 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-21 00:09:11,769 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:09:11,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122985151] [2021-11-21 00:09:11,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122985151] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:09:11,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939424096] [2021-11-21 00:09:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:11,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:09:11,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:09:11,774 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:09:11,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 00:09:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:11,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-21 00:09:11,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:09:11,991 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-21 00:09:12,116 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-11-21 00:09:12,116 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-21 00:09:12,174 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-21 00:09:12,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-21 00:09:12,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939424096] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:09:12,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-21 00:09:12,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2021-11-21 00:09:12,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524065933] [2021-11-21 00:09:12,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:09:12,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-21 00:09:12,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:09:12,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-21 00:09:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:09:12,177 INFO L87 Difference]: Start difference. First operand 94 states and 102 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-21 00:09:12,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:09:12,527 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2021-11-21 00:09:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-21 00:09:12,528 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-21 00:09:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:09:12,529 INFO L225 Difference]: With dead ends: 112 [2021-11-21 00:09:12,529 INFO L226 Difference]: Without dead ends: 112 [2021-11-21 00:09:12,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-21 00:09:12,530 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 164 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:09:12,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 365 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-21 00:09:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-21 00:09:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2021-11-21 00:09:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 88 states have internal predecessors, (95), 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-21 00:09:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2021-11-21 00:09:12,539 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 19 [2021-11-21 00:09:12,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:09:12,539 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2021-11-21 00:09:12,539 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-21 00:09:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2021-11-21 00:09:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-21 00:09:12,540 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:12,540 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:09:12,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-21 00:09:12,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-21 00:09:12,754 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:12,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:12,754 INFO L85 PathProgramCache]: Analyzing trace with hash -334043549, now seen corresponding path program 1 times [2021-11-21 00:09:12,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:09:12,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87015531] [2021-11-21 00:09:12,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:12,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:09:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:12,972 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-21 00:09:12,972 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:09:12,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87015531] [2021-11-21 00:09:12,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87015531] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:09:12,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114151949] [2021-11-21 00:09:12,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:12,973 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:09:12,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:09:12,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:09:12,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-21 00:09:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:13,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-21 00:09:13,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:09:13,104 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-21 00:09:13,352 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:09:13,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-21 00:09:13,421 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-21 00:09:13,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:09:13,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114151949] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:09:13,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1956287344] [2021-11-21 00:09:13,583 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-21 00:09:13,583 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 00:09:13,587 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 00:09:13,593 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 00:09:13,593 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 00:09:13,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:09:13,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:09:13,702 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-21 00:09:13,823 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 00:09:13,824 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-21 00:09:13,890 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-21 00:09:13,905 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-21 00:09:13,934 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-21 00:09:13,949 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-21 00:09:13,962 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-21 00:09:13,989 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-21 00:09:14,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:09:14,006 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-21 00:09:14,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:09:14,018 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-21 00:09:14,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:09:14,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:09:14,128 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-21 00:09:14,220 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 00:09:14,221 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-21 00:09:14,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:09:14,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:09:14,379 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-21 00:09:14,800 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:09:14,800 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-21 00:09:14,874 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-21 00:09:14,884 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-21 00:09:14,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, 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-21 00:09:14,979 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-21 00:09:15,001 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-21 00:09:15,085 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:09:15,085 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-21 00:09:15,171 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-21 00:09:15,191 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-21 00:09:15,228 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-21 00:09:15,288 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-21 00:09:15,301 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-21 00:09:15,551 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-21 00:09:15,584 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-21 00:09:15,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:09:15,667 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-21 00:09:15,885 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:09:15,886 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-21 00:09:15,990 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-21 00:09:16,018 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-21 00:09:16,032 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-21 00:09:16,057 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-21 00:09:16,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-21 00:09:16,207 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:09:16,208 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-21 00:09:16,256 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-21 00:09:16,268 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-21 00:09:16,290 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-21 00:09:16,338 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-21 00:09:16,392 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-21 00:09:16,633 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-21 00:09:16,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:09:16,658 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-21 00:09:16,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, 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-21 00:09:16,987 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:09:16,988 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-21 00:09:17,046 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-21 00:09:17,085 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-21 00:09:17,104 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-21 00:09:17,174 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-21 00:09:17,193 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-21 00:09:17,250 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:09:17,251 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-21 00:09:17,334 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-21 00:09:17,360 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-21 00:09:17,438 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-21 00:09:17,463 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-21 00:09:17,475 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-21 00:09:17,720 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:09:17,720 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-21 00:09:18,124 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 00:09:18,125 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-21 00:09:18,183 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 88 for LOIs [2021-11-21 00:09:20,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-21 00:09:20,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:09:20,324 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-21 00:09:20,328 INFO L158 Benchmark]: Toolchain (without parser) took 11816.08ms. Allocated memory was 102.8MB in the beginning and 220.2MB in the end (delta: 117.4MB). Free memory was 66.7MB in the beginning and 142.8MB in the end (delta: -76.1MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2021-11-21 00:09:20,329 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 102.8MB. Free memory was 57.5MB in the beginning and 57.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:09:20,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.00ms. Allocated memory is still 102.8MB. Free memory was 66.5MB in the beginning and 68.0MB in the end (delta: -1.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-21 00:09:20,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.53ms. Allocated memory is still 102.8MB. Free memory was 68.0MB in the beginning and 65.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:09:20,334 INFO L158 Benchmark]: Boogie Preprocessor took 44.92ms. Allocated memory is still 102.8MB. Free memory was 65.7MB in the beginning and 63.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:09:20,335 INFO L158 Benchmark]: RCFGBuilder took 737.57ms. Allocated memory was 102.8MB in the beginning and 151.0MB in the end (delta: 48.2MB). Free memory was 63.8MB in the beginning and 118.1MB in the end (delta: -54.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2021-11-21 00:09:20,335 INFO L158 Benchmark]: TraceAbstraction took 10381.66ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 117.4MB in the beginning and 142.8MB in the end (delta: -25.4MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2021-11-21 00:09:20,338 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.33ms. Allocated memory is still 102.8MB. Free memory was 57.5MB in the beginning and 57.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.00ms. Allocated memory is still 102.8MB. Free memory was 66.5MB in the beginning and 68.0MB in the end (delta: -1.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.53ms. Allocated memory is still 102.8MB. Free memory was 68.0MB in the beginning and 65.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.92ms. Allocated memory is still 102.8MB. Free memory was 65.7MB in the beginning and 63.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 737.57ms. Allocated memory was 102.8MB in the beginning and 151.0MB in the end (delta: 48.2MB). Free memory was 63.8MB in the beginning and 118.1MB in the end (delta: -54.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10381.66ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 117.4MB in the beginning and 142.8MB in the end (delta: -25.4MB). Peak memory consumption was 43.8MB. 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-21 00:09:20,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/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_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/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_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/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_654baa15-39d6-4894-b417-f1d8cd9b0786/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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:09:22,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:09:22,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:09:22,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:09:22,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:09:22,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:09:22,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:09:22,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:09:22,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:09:22,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:09:22,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:09:22,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:09:22,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:09:22,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:09:22,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:09:22,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:09:22,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:09:22,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:09:22,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:09:22,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:09:22,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:09:22,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:09:22,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:09:22,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:09:22,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:09:22,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:09:22,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:09:22,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:09:22,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:09:22,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:09:22,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:09:22,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:09:22,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:09:22,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:09:22,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:09:22,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:09:22,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:09:22,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:09:22,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:09:22,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:09:22,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:09:22,954 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-21 00:09:23,004 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:09:23,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:09:23,005 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:09:23,005 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:09:23,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:09:23,007 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:09:23,007 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:09:23,007 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:09:23,007 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:09:23,008 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:09:23,009 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:09:23,009 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:09:23,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 00:09:23,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 00:09:23,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:09:23,011 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:09:23,011 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 00:09:23,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:09:23,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:09:23,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:09:23,012 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 00:09:23,012 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 00:09:23,013 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 00:09:23,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:09:23,013 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 00:09:23,013 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 00:09:23,013 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 00:09:23,014 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:09:23,014 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:09:23,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:09:23,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 00:09:23,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:09:23,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:09:23,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:09:23,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:09:23,016 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 00:09:23,016 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 00:09:23,016 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:09:23,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:09:23,017 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_654baa15-39d6-4894-b417-f1d8cd9b0786/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_654baa15-39d6-4894-b417-f1d8cd9b0786/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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2021-11-21 00:09:23,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:09:23,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:09:23,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:09:23,461 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:09:23,462 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:09:23,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2021-11-21 00:09:23,534 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/data/0b951d55d/803ebd0eb74748e8afcd11fb8b377289/FLAGb0ac88640 [2021-11-21 00:09:24,216 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:09:24,217 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2021-11-21 00:09:24,239 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/data/0b951d55d/803ebd0eb74748e8afcd11fb8b377289/FLAGb0ac88640 [2021-11-21 00:09:24,492 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/data/0b951d55d/803ebd0eb74748e8afcd11fb8b377289 [2021-11-21 00:09:24,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:09:24,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:09:24,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:09:24,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:09:24,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:09:24,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:09:24" (1/1) ... [2021-11-21 00:09:24,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e517b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24, skipping insertion in model container [2021-11-21 00:09:24,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:09:24" (1/1) ... [2021-11-21 00:09:24,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:09:24,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:09:24,892 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_654baa15-39d6-4894-b417-f1d8cd9b0786/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2021-11-21 00:09:24,895 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:09:24,907 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:09:24,950 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_654baa15-39d6-4894-b417-f1d8cd9b0786/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2021-11-21 00:09:24,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:09:24,987 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:09:24,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24 WrapperNode [2021-11-21 00:09:24,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:09:24,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:09:24,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:09:24,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:09:24,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24" (1/1) ... [2021-11-21 00:09:25,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24" (1/1) ... [2021-11-21 00:09:25,042 INFO L137 Inliner]: procedures = 130, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2021-11-21 00:09:25,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:09:25,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:09:25,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:09:25,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:09:25,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24" (1/1) ... [2021-11-21 00:09:25,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24" (1/1) ... [2021-11-21 00:09:25,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24" (1/1) ... [2021-11-21 00:09:25,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24" (1/1) ... [2021-11-21 00:09:25,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24" (1/1) ... [2021-11-21 00:09:25,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24" (1/1) ... [2021-11-21 00:09:25,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24" (1/1) ... [2021-11-21 00:09:25,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:09:25,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:09:25,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:09:25,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:09:25,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24" (1/1) ... [2021-11-21 00:09:25,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:09:25,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:09:25,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:09:25,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:09:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-21 00:09:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 00:09:25,189 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 00:09:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 00:09:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:09:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:09:25,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 00:09:25,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 00:09:25,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:09:25,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-21 00:09:25,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 00:09:25,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 00:09:25,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:09:25,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:09:25,304 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:09:25,305 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:09:25,912 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:09:25,920 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:09:25,921 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 00:09:25,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:09:25 BoogieIcfgContainer [2021-11-21 00:09:25,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:09:25,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:09:25,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:09:25,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:09:25,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:09:24" (1/3) ... [2021-11-21 00:09:25,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba8b8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:09:25, skipping insertion in model container [2021-11-21 00:09:25,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:09:24" (2/3) ... [2021-11-21 00:09:25,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba8b8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:09:25, skipping insertion in model container [2021-11-21 00:09:25,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:09:25" (3/3) ... [2021-11-21 00:09:25,932 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2021-11-21 00:09:25,938 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:09:25,938 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2021-11-21 00:09:25,979 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:09:25,986 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-21 00:09:25,987 INFO L340 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2021-11-21 00:09:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 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-21 00:09:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 00:09:26,033 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:26,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 00:09:26,034 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:26,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:26,046 INFO L85 PathProgramCache]: Analyzing trace with hash 895059861, now seen corresponding path program 1 times [2021-11-21 00:09:26,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:09:26,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066156138] [2021-11-21 00:09:26,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:26,060 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:09:26,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:09:26,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:09:26,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 00:09:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:26,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 00:09:26,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:09:26,232 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-21 00:09:26,248 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-21 00:09:26,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:09:26,273 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-21 00:09:26,274 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:09:26,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066156138] [2021-11-21 00:09:26,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066156138] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:09:26,276 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:09:26,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 00:09:26,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807364751] [2021-11-21 00:09:26,279 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:09:26,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:09:26,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:09:26,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:09:26,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:09:26,325 INFO L87 Difference]: Start difference. First operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 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-21 00:09:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:09:26,586 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2021-11-21 00:09:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:09:26,588 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-21 00:09:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:09:26,604 INFO L225 Difference]: With dead ends: 114 [2021-11-21 00:09:26,604 INFO L226 Difference]: Without dead ends: 111 [2021-11-21 00:09:26,606 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-21 00:09:26,619 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:09:26,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 00:09:26,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-21 00:09:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-11-21 00:09:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.9152542372881356) 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-21 00:09:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2021-11-21 00:09:26,689 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 6 [2021-11-21 00:09:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:09:26,690 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2021-11-21 00:09:26,690 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-21 00:09:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2021-11-21 00:09:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 00:09:26,691 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:26,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 00:09:26,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 00:09:26,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:09:26,903 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:26,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash 895059862, now seen corresponding path program 1 times [2021-11-21 00:09:26,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:09:26,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810949086] [2021-11-21 00:09:26,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:26,906 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:09:26,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:09:26,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:09:26,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 00:09:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:27,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 00:09:27,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:09:27,046 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-21 00:09:27,072 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-21 00:09:27,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:09:27,169 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-21 00:09:27,170 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:09:27,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810949086] [2021-11-21 00:09:27,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810949086] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:09:27,170 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:09:27,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-21 00:09:27,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202786714] [2021-11-21 00:09:27,171 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:09:27,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:09:27,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:09:27,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:09:27,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:09:27,173 INFO L87 Difference]: Start difference. First operand 111 states and 119 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-21 00:09:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:09:27,700 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2021-11-21 00:09:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:09:27,702 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-21 00:09:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:09:27,703 INFO L225 Difference]: With dead ends: 109 [2021-11-21 00:09:27,704 INFO L226 Difference]: Without dead ends: 109 [2021-11-21 00:09:27,704 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-21 00:09:27,706 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:09:27,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 249 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-21 00:09:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-21 00:09:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-11-21 00:09:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.88135593220339) internal successors, (111), 104 states have internal predecessors, (111), 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-21 00:09:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2021-11-21 00:09:27,718 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 6 [2021-11-21 00:09:27,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:09:27,718 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2021-11-21 00:09:27,719 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-21 00:09:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2021-11-21 00:09:27,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 00:09:27,720 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:27,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:09:27,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 00:09:27,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:09:27,946 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:27,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:27,947 INFO L85 PathProgramCache]: Analyzing trace with hash 100467671, now seen corresponding path program 1 times [2021-11-21 00:09:27,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:09:27,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581369580] [2021-11-21 00:09:27,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:27,949 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:09:27,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:09:27,950 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:09:27,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 00:09:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:28,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 00:09:28,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:09:28,078 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-21 00:09:28,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:09:28,117 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-21 00:09:28,118 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:09:28,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581369580] [2021-11-21 00:09:28,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581369580] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:09:28,118 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:09:28,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 00:09:28,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062148628] [2021-11-21 00:09:28,119 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:09:28,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:09:28,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:09:28,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:09:28,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:09:28,121 INFO L87 Difference]: Start difference. First operand 109 states and 117 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-21 00:09:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:09:28,140 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2021-11-21 00:09:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:09:28,141 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-21 00:09:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:09:28,143 INFO L225 Difference]: With dead ends: 116 [2021-11-21 00:09:28,143 INFO L226 Difference]: Without dead ends: 116 [2021-11-21 00:09:28,144 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-21 00:09:28,145 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:09:28,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 226 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:09:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-21 00:09:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2021-11-21 00:09:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.8666666666666667) 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-21 00:09:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2021-11-21 00:09:28,158 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 13 [2021-11-21 00:09:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:09:28,159 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2021-11-21 00:09:28,159 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-21 00:09:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2021-11-21 00:09:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-21 00:09:28,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:28,160 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:09:28,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 00:09:28,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:09:28,371 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash -900354020, now seen corresponding path program 1 times [2021-11-21 00:09:28,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:09:28,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359653739] [2021-11-21 00:09:28,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:28,373 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:09:28,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:09:28,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:09:28,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 00:09:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:28,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:09:28,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:09:28,520 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-21 00:09:28,593 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-21 00:09:28,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:09:28,697 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-21 00:09:28,697 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:09:28,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359653739] [2021-11-21 00:09:28,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359653739] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:09:28,698 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:09:28,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-21 00:09:28,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465587601] [2021-11-21 00:09:28,698 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:09:28,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:09:28,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:09:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:09:28,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:09:28,700 INFO L87 Difference]: Start difference. First operand 110 states and 118 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-21 00:09:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:09:29,192 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2021-11-21 00:09:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:09:29,192 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-21 00:09:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:09:29,195 INFO L225 Difference]: With dead ends: 110 [2021-11-21 00:09:29,195 INFO L226 Difference]: Without dead ends: 110 [2021-11-21 00:09:29,195 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-21 00:09:29,196 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 12 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:09:29,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 342 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-21 00:09:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-21 00:09:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2021-11-21 00:09:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.85) internal successors, (111), 104 states have internal predecessors, (111), 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-21 00:09:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2021-11-21 00:09:29,206 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 22 [2021-11-21 00:09:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:09:29,207 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2021-11-21 00:09:29,207 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-21 00:09:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2021-11-21 00:09:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-21 00:09:29,208 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:29,208 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:09:29,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 00:09:29,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:09:29,420 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:29,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:29,421 INFO L85 PathProgramCache]: Analyzing trace with hash -900354019, now seen corresponding path program 1 times [2021-11-21 00:09:29,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:09:29,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083401380] [2021-11-21 00:09:29,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:29,422 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:09:29,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:09:29,424 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:09:29,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-21 00:09:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:29,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 00:09:29,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:09:29,560 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-21 00:09:29,682 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-21 00:09:29,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:09:30,066 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-21 00:09:30,066 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:09:30,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083401380] [2021-11-21 00:09:30,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083401380] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:09:30,067 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:09:30,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-21 00:09:30,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10933079] [2021-11-21 00:09:30,067 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:09:30,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 00:09:30,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:09:30,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 00:09:30,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-21 00:09:30,069 INFO L87 Difference]: Start difference. First operand 109 states and 117 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-21 00:09:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:09:31,322 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2021-11-21 00:09:31,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:09:31,324 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-21 00:09:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:09:31,325 INFO L225 Difference]: With dead ends: 109 [2021-11-21 00:09:31,325 INFO L226 Difference]: Without dead ends: 109 [2021-11-21 00:09:31,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-21 00:09:31,326 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 11 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:09:31,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 557 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-21 00:09:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-21 00:09:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2021-11-21 00:09:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 103 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-21 00:09:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2021-11-21 00:09:31,343 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 22 [2021-11-21 00:09:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:09:31,344 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2021-11-21 00:09:31,344 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-21 00:09:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2021-11-21 00:09:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:09:31,345 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:09:31,345 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-21 00:09:31,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-21 00:09:31,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:09:31,557 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:09:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:09:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash -375857467, now seen corresponding path program 1 times [2021-11-21 00:09:31,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:09:31,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842574576] [2021-11-21 00:09:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:31,558 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:09:31,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:09:31,559 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:09:31,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-21 00:09:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:31,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-21 00:09:31,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:09:31,684 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-21 00:09:31,926 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 00:09:31,926 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 23 treesize of output 30 [2021-11-21 00:09:32,116 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-21 00:09:32,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:09:57,710 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-21 00:09:57,711 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:09:57,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842574576] [2021-11-21 00:09:57,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842574576] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:09:57,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1670756537] [2021-11-21 00:09:57,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:09:57,712 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:09:57,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:09:57,720 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:09:57,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-21 00:09:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:09:57,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-21 00:09:57,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:09:57,917 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-21 00:10:02,090 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-21 00:10:02,090 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-21 00:10:02,200 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-21 00:10:02,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:10:10,832 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-21 00:10:10,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1670756537] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 00:10:10,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:10:10,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 8, 6] total 18 [2021-11-21 00:10:10,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067972897] [2021-11-21 00:10:10,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:10,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 00:10:10,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:10:10,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 00:10:10,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=271, Unknown=12, NotChecked=0, Total=342 [2021-11-21 00:10:10,834 INFO L87 Difference]: Start difference. First operand 108 states and 116 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-21 00:10:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:13,695 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2021-11-21 00:10:13,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 00:10:13,696 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-21 00:10:13,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:13,698 INFO L225 Difference]: With dead ends: 125 [2021-11-21 00:10:13,698 INFO L226 Difference]: Without dead ends: 125 [2021-11-21 00:10:13,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=69, Invalid=298, Unknown=13, NotChecked=0, Total=380 [2021-11-21 00:10:13,700 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 92 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:13,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 469 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 391 Invalid, 0 Unknown, 60 Unchecked, 0.8s Time] [2021-11-21 00:10:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-21 00:10:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2021-11-21 00:10:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 102 states have internal predecessors, (109), 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-21 00:10:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2021-11-21 00:10:13,709 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 25 [2021-11-21 00:10:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:13,709 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2021-11-21 00:10:13,709 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-21 00:10:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2021-11-21 00:10:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:10:13,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:13,711 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-21 00:10:13,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-21 00:10:13,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-21 00:10:14,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:10:14,114 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:10:14,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:14,115 INFO L85 PathProgramCache]: Analyzing trace with hash -375857466, now seen corresponding path program 1 times [2021-11-21 00:10:14,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:10:14,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364821424] [2021-11-21 00:10:14,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:14,115 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:10:14,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:10:14,117 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:10:14,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-21 00:10:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:14,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 00:10:14,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:10:14,268 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-21 00:10:14,276 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-21 00:10:14,608 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:10:14,608 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 26 treesize of output 28 [2021-11-21 00:10:14,620 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:10:14,621 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 25 treesize of output 25 [2021-11-21 00:10:14,756 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-21 00:10:14,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:10:28,051 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 (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|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (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-21 00:10:31,932 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-21 00:10:31,932 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:10:31,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364821424] [2021-11-21 00:10:31,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364821424] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:10:31,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1765624299] [2021-11-21 00:10:31,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:31,933 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:10:31,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:10:31,936 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:10:31,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-21 00:10:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:32,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 00:10:32,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:10:32,153 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-21 00:10:32,163 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-21 00:10:32,410 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:10:32,411 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-21 00:10:32,428 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:10:32,428 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-21 00:10:32,538 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-21 00:10:32,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:10:50,166 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|))))))) (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|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) is different from false [2021-11-21 00:10:50,736 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-21 00:10:50,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1765624299] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:10:50,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844950493] [2021-11-21 00:10:50,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:50,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:10:50,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:10:50,738 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:10:50,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-21 00:10:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:50,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 00:10:50,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:10:50,831 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-21 00:10:51,166 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:10:51,167 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-21 00:10:51,181 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:10:51,182 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-21 00:10:51,288 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-21 00:10:51,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:11:06,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|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 (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (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_65| (_ 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-21 00:11:06,909 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-21 00:11:06,910 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 34 treesize of output 33 [2021-11-21 00:11:09,537 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-21 00:11:09,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844950493] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:11:09,537 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 00:11:09,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 9, 9] total 20 [2021-11-21 00:11:09,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599799521] [2021-11-21 00:11:09,538 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 00:11:09,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-21 00:11:09,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:11:09,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-21 00:11:09,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=254, Unknown=11, NotChecked=102, Total=420 [2021-11-21 00:11:09,540 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 21 states, 20 states have (on average 2.65) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-21 00:11:17,825 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|))))))) (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|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) (forall ((|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|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 (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (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_65| (_ 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.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 (let ((.cse4 (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| .cse4) (bvule .cse4 (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|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (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_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse5)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))))))) is different from false [2021-11-21 00:11:19,870 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (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|)))))))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_node_create_~temp~0#1.base|))) is different from false [2021-11-21 00:11:21,886 WARN L838 $PredicateComparison]: unable to prove that (and (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|)))))))) (= (_ 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-21 00:11:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:22,715 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2021-11-21 00:11:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-21 00:11:22,716 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2021-11-21 00:11:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:22,718 INFO L225 Difference]: With dead ends: 127 [2021-11-21 00:11:22,718 INFO L226 Difference]: Without dead ends: 127 [2021-11-21 00:11:22,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 123 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=75, Invalid=315, Unknown=14, NotChecked=246, Total=650 [2021-11-21 00:11:22,720 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 744 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:22,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 915 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 744 Unchecked, 0.9s Time] [2021-11-21 00:11:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-21 00:11:22,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2021-11-21 00:11:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 75 states have (on average 1.68) internal successors, (126), 117 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:11:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2021-11-21 00:11:22,732 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 25 [2021-11-21 00:11:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:22,733 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2021-11-21 00:11:22,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-21 00:11:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2021-11-21 00:11:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-21 00:11:22,735 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:22,735 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-21 00:11:22,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-21 00:11:22,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-21 00:11:23,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-21 00:11:23,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:11:23,349 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:11:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:23,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867041, now seen corresponding path program 1 times [2021-11-21 00:11:23,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:11:23,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812222841] [2021-11-21 00:11:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:23,351 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:11:23,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:11:23,352 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:11:23,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-21 00:11:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:23,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-21 00:11:23,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:11:23,583 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-21 00:11:23,615 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-21 00:11:23,855 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 00:11:23,856 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-21 00:11:24,057 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:11:24,057 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 39 treesize of output 35 [2021-11-21 00:11:24,269 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 00:11:24,269 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-21 00:11:25,268 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 00:11:25,269 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-21 00:11:25,484 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-21 00:11:25,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:12:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:12:13,543 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:12:13,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812222841] [2021-11-21 00:12:13,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812222841] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:12:13,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [600318684] [2021-11-21 00:12:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:13,544 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:12:13,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:12:13,546 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:12:13,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-11-21 00:12:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:13,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 00:12:13,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:12:13,978 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-21 00:12:13,979 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-21 00:12:14,148 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:12:14,148 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-21 00:12:14,369 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 00:12:14,370 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-21 00:12:14,744 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-21 00:12:14,745 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 39 treesize of output 33 [2021-11-21 00:12:19,217 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-21 00:12:19,217 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 48 treesize of output 65 [2021-11-21 00:12:20,286 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-21 00:12:20,287 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 39 treesize of output 33 [2021-11-21 00:12:20,675 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-21 00:12:20,675 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-21 00:12:21,295 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-21 00:12:21,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:12:31,357 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-21 00:12:31,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [600318684] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:12:31,358 INFO L186 FreeRefinementEngine]: Found 2 perfect and 2 imperfect interpolant sequences. [2021-11-21 00:12:31,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [10, 10] total 26 [2021-11-21 00:12:31,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290097211] [2021-11-21 00:12:31,359 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:12:31,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:12:31,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:12:31,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:12:31,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=568, Unknown=22, NotChecked=0, Total=702 [2021-11-21 00:12:31,361 INFO L87 Difference]: Start difference. First operand 125 states and 136 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-21 00:12:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:12:31,628 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2021-11-21 00:12:31,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-21 00:12:31,629 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-21 00:12:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:12:31,630 INFO L225 Difference]: With dead ends: 125 [2021-11-21 00:12:31,631 INFO L226 Difference]: Without dead ends: 125 [2021-11-21 00:12:31,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 102 SyntacticMatches, 17 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 58.7s TimeCoverageRelationStatistics Valid=112, Invalid=568, Unknown=22, NotChecked=0, Total=702 [2021-11-21 00:12:31,632 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 15 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:12:31,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 445 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 209 Unchecked, 0.3s Time] [2021-11-21 00:12:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-21 00:12:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2021-11-21 00:12:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 116 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:12:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2021-11-21 00:12:31,642 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 37 [2021-11-21 00:12:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:12:31,643 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2021-11-21 00:12:31,643 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-21 00:12:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2021-11-21 00:12:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-21 00:12:31,645 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:12:31,645 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-21 00:12:31,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2021-11-21 00:12:31,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-21 00:12:32,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:12:32,058 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:12:32,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:12:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867040, now seen corresponding path program 1 times [2021-11-21 00:12:32,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:12:32,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208942577] [2021-11-21 00:12:32,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:12:32,060 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:12:32,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:12:32,061 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:12:32,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-21 00:12:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:12:32,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-21 00:12:32,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:12:32,263 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-21 00:12:32,276 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-21 00:12:32,329 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-21 00:12:32,337 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-21 00:12:32,647 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:12:32,648 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-21 00:12:32,662 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:12:32,662 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-21 00:12:32,895 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:12:32,895 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-21 00:12:33,292 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 00:12:33,293 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-21 00:12:34,336 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-21 00:12:34,336 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-21 00:12:34,647 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-21 00:12:34,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:12:42,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_103| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_2|))) (or (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_append_~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_append_~head#1.base_BEFORE_CALL_6|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_103| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|)) (not (bvule |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_2| .cse0))))) is different from false [2021-11-21 00:12:45,575 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-21 00:14:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 7 times theorem prover too weak. 0 trivial. 14 not checked. [2021-11-21 00:14:35,868 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:14:35,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208942577] [2021-11-21 00:14:35,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208942577] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:14:35,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1361876831] [2021-11-21 00:14:35,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:14:35,869 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:14:35,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:14:35,877 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:14:35,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2021-11-21 00:14:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:14:36,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-21 00:14:36,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:14:36,145 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-21 00:14:39,364 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-21 00:14:39,555 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:14:39,555 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-21 00:14:40,008 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:14:40,009 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-21 00:14:44,402 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 00:14:44,402 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-21 00:14:46,855 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:14:46,855 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-21 00:14:47,194 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 00:14:47,194 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-21 00:14:47,490 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-21 00:14:47,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:17:36,642 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-21 00:17:36,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1361876831] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 00:17:36,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:17:36,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 12, 10] total 35 [2021-11-21 00:17:36,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683001808] [2021-11-21 00:17:36,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:36,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-21 00:17:36,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:17:36,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-21 00:17:36,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=873, Unknown=90, NotChecked=130, Total=1260 [2021-11-21 00:17:36,646 INFO L87 Difference]: Start difference. First operand 124 states and 135 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-21 00:17:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:37,263 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2021-11-21 00:17:37,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-21 00:17:37,264 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-21 00:17:37,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:37,265 INFO L225 Difference]: With dead ends: 124 [2021-11-21 00:17:37,265 INFO L226 Difference]: Without dead ends: 124 [2021-11-21 00:17:37,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 250.4s TimeCoverageRelationStatistics Valid=167, Invalid=873, Unknown=90, NotChecked=130, Total=1260 [2021-11-21 00:17:37,267 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 6 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:37,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 388 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 99 Unchecked, 0.6s Time] [2021-11-21 00:17:37,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-21 00:17:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2021-11-21 00:17:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 115 states have internal predecessors, (124), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:17:37,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2021-11-21 00:17:37,276 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 37 [2021-11-21 00:17:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:37,276 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2021-11-21 00:17:37,276 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-21 00:17:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2021-11-21 00:17:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-21 00:17:37,278 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:37,279 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-21 00:17:37,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2021-11-21 00:17:37,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-11-21 00:17:37,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:17:37,682 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:17:37,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash -94242400, now seen corresponding path program 1 times [2021-11-21 00:17:37,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:17:37,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5575226] [2021-11-21 00:17:37,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:37,683 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:17:37,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:17:37,684 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:17:37,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-21 00:17:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:37,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:17:37,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:17:37,832 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-21 00:17:37,958 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-21 00:17:37,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:17:38,180 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-21 00:17:38,180 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:17:38,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5575226] [2021-11-21 00:17:38,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5575226] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:38,181 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:38,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-21 00:17:38,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085932167] [2021-11-21 00:17:38,182 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:38,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:17:38,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:17:38,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:17:38,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:17:38,183 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-21 00:17:39,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:39,077 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2021-11-21 00:17:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:17:39,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 39 [2021-11-21 00:17:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:39,079 INFO L225 Difference]: With dead ends: 139 [2021-11-21 00:17:39,079 INFO L226 Difference]: Without dead ends: 139 [2021-11-21 00:17:39,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:17:39,081 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 81 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:39,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 261 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-21 00:17:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-21 00:17:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 121. [2021-11-21 00:17:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 113 states have internal predecessors, (122), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:17:39,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2021-11-21 00:17:39,089 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 39 [2021-11-21 00:17:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:39,090 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2021-11-21 00:17:39,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-21 00:17:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2021-11-21 00:17:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-21 00:17:39,092 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:39,092 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-21 00:17:39,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-21 00:17:39,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:17:39,307 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:17:39,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:39,307 INFO L85 PathProgramCache]: Analyzing trace with hash -94242399, now seen corresponding path program 1 times [2021-11-21 00:17:39,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:17:39,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840572388] [2021-11-21 00:17:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:39,308 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:17:39,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:17:39,310 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:17:39,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-21 00:17:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:39,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 00:17:39,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:17:39,532 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-21 00:17:39,805 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-21 00:17:39,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:17:40,478 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-21 00:17:40,478 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:17:40,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840572388] [2021-11-21 00:17:40,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840572388] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:40,479 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:40,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-21 00:17:40,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89722630] [2021-11-21 00:17:40,479 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:40,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 00:17:40,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:17:40,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 00:17:40,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-21 00:17:40,480 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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-21 00:17:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:42,099 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2021-11-21 00:17:42,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:17:42,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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 39 [2021-11-21 00:17:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:42,102 INFO L225 Difference]: With dead ends: 119 [2021-11-21 00:17:42,103 INFO L226 Difference]: Without dead ends: 119 [2021-11-21 00:17:42,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 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-21 00:17:42,104 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 164 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:42,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 392 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-21 00:17:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-21 00:17:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-11-21 00:17:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 75 states have (on average 1.6) internal successors, (120), 111 states have internal predecessors, (120), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:17:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2021-11-21 00:17:42,111 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 39 [2021-11-21 00:17:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:42,111 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2021-11-21 00:17:42,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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-21 00:17:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2021-11-21 00:17:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-21 00:17:42,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:42,114 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-21 00:17:42,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-21 00:17:42,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:17:42,329 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:17:42,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:42,329 INFO L85 PathProgramCache]: Analyzing trace with hash -94242144, now seen corresponding path program 1 times [2021-11-21 00:17:42,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:17:42,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582696542] [2021-11-21 00:17:42,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:42,330 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:17:42,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:17:42,331 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:17:42,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-21 00:17:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:42,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 00:17:42,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:17:42,535 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-21 00:17:42,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:17:42,602 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-21 00:17:42,602 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:17:42,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582696542] [2021-11-21 00:17:42,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582696542] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:42,603 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:42,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 00:17:42,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447480252] [2021-11-21 00:17:42,603 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:42,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:17:42,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:17:42,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:17:42,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:17:42,604 INFO L87 Difference]: Start difference. First operand 119 states and 130 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-21 00:17:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:42,897 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2021-11-21 00:17:42,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:17:42,898 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-21 00:17:42,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:42,899 INFO L225 Difference]: With dead ends: 133 [2021-11-21 00:17:42,899 INFO L226 Difference]: Without dead ends: 133 [2021-11-21 00:17:42,899 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-21 00:17:42,900 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 73 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:42,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 98 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-21 00:17:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-21 00:17:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2021-11-21 00:17:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 107 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:17:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2021-11-21 00:17:42,907 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 39 [2021-11-21 00:17:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:42,908 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2021-11-21 00:17:42,908 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-21 00:17:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2021-11-21 00:17:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-21 00:17:42,909 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:42,909 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-21 00:17:42,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-11-21 00:17:43,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:17:43,116 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:17:43,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash -94242143, now seen corresponding path program 1 times [2021-11-21 00:17:43,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:17:43,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739559873] [2021-11-21 00:17:43,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:43,117 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:17:43,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:17:43,118 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:17:43,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-21 00:17:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:43,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:17:43,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:17:43,423 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-21 00:17:43,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:17:43,515 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-21 00:17:43,751 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-21 00:17:43,752 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:17:43,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739559873] [2021-11-21 00:17:43,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739559873] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:17:43,752 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:17:43,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-21 00:17:43,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484220736] [2021-11-21 00:17:43,753 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:17:43,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 00:17:43,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:17:43,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 00:17:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-21 00:17:43,754 INFO L87 Difference]: Start difference. First operand 115 states and 126 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-21 00:17:44,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:17:44,107 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2021-11-21 00:17:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:17:44,109 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-21 00:17:44,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:17:44,110 INFO L225 Difference]: With dead ends: 111 [2021-11-21 00:17:44,110 INFO L226 Difference]: Without dead ends: 111 [2021-11-21 00:17:44,111 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-21 00:17:44,112 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 297 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:17:44,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 153 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-21 00:17:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-21 00:17:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-11-21 00:17:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 103 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 00:17:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2021-11-21 00:17:44,119 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 39 [2021-11-21 00:17:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:17:44,119 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2021-11-21 00:17:44,120 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-21 00:17:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2021-11-21 00:17:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-21 00:17:44,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:17:44,121 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-21 00:17:44,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-21 00:17:44,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:17:44,330 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-11-21 00:17:44,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:17:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash -372386587, now seen corresponding path program 1 times [2021-11-21 00:17:44,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:17:44,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090175539] [2021-11-21 00:17:44,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:17:44,331 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:17:44,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:17:44,332 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:17:44,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-21 00:17:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:17:44,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-21 00:17:44,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:17:44,634 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-21 00:17:45,128 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-21 00:17:47,875 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 00:17:47,876 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 61 treesize of output 49 [2021-11-21 00:17:47,953 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-21 00:17:47,953 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 46 treesize of output 57 [2021-11-21 00:17:48,579 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 00:17:48,579 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 59 treesize of output 43 [2021-11-21 00:17:49,039 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-21 00:17:49,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:17:57,834 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (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_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ 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_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|))))) (_ bv1 1))))) is different from false [2021-11-21 00:18:00,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ 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 (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_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|))))) (_ bv1 1))) (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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (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_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) is different from false [2021-11-21 00:18:02,422 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (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_2)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (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_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) is different from false [2021-11-21 00:18:33,798 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-21 00:18:41,444 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:18:41,444 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 90 treesize of output 108 [2021-11-21 00:18:46,773 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-21 00:18:46,774 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:18:46,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090175539] [2021-11-21 00:18:46,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090175539] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:18:46,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [242016538] [2021-11-21 00:18:46,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:18:46,775 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:18:46,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:18:46,783 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:18:46,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-11-21 00:18:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:18:47,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-21 00:18:47,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:18:49,409 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-21 00:18:54,878 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-21 00:18:55,355 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 00:18:55,355 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-21 00:18:55,427 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-21 00:18:55,427 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-21 00:18:58,306 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 00:18:58,307 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 54 treesize of output 38 [2021-11-21 00:18:58,722 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-21 00:18:58,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:19:06,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))))))))) (= (_ 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 (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))))))) is different from false [2021-11-21 00:19:08,854 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))))))))) (= (_ 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 (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_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))) (_ bv1 1))))) is different from false [2021-11-21 00:19:11,037 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (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_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))))) (_ bv1 1))) (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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) is different from false [2021-11-21 00:19:36,826 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-21 00:19:42,246 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:19:42,247 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 85 treesize of output 103 [2021-11-21 00:19:42,778 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-21 00:19:42,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [242016538] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:19:42,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393240296] [2021-11-21 00:19:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:42,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:19:42,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:19:42,780 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:19:42,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654baa15-39d6-4894-b417-f1d8cd9b0786/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-21 00:19:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:42,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-21 00:19:42,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:19:54,921 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-21 00:19:57,205 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 52 treesize of output 40 [2021-11-21 00:20:03,891 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-21 00:20:03,891 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 54 treesize of output 50 [2021-11-21 00:20:03,952 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 00:20:03,953 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 50 treesize of output 57 [2021-11-21 00:20:08,891 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:20:08,892 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 57 treesize of output 57 [2021-11-21 00:20:11,593 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:20:11,593 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 51 treesize of output 35 [2021-11-21 00:20:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 00:20:12,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:20:18,992 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 208 treesize of output 200 [2021-11-21 00:21:48,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ 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_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|))) (or (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_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (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 (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|)))))))) is different from false [2021-11-21 00:21:50,646 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ 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_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|))) (or (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_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (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 (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|)))))))) is different from true [2021-11-21 00:21:50,833 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 173 treesize of output 169 [2021-11-21 00:21:55,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (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|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1))) (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|) (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))))))) is different from false [2021-11-21 00:21:57,269 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (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|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1))) (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|) (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))))))) is different from true [2021-11-21 00:22:05,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (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_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1))) (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_node_create_~temp~0#1.base_189| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= (_ bv0 1) (select |c_#valid| |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 (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))))))) is different from false [2021-11-21 00:22:07,095 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (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_8)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1))) (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_node_create_~temp~0#1.base_189| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= (_ bv0 1) (select |c_#valid| |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 (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12|)))))))) (_ bv1 1)))) (or (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_node_create_~temp~0#1.base_188| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_14|))))))) is different from true [2021-11-21 00:22:07,110 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 147 treesize of output 139 [2021-11-21 00:22:33,469 INFO L354 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-11-21 00:22:33,469 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 74 treesize of output 72 [2021-11-21 00:22:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2021-11-21 00:22:53,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393240296] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:22:53,288 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 00:22:53,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17, 16, 18, 18] total 73 [2021-11-21 00:22:53,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981877291] [2021-11-21 00:22:53,289 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 00:22:53,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2021-11-21 00:22:53,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:22:53,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-11-21 00:22:53,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=3794, Unknown=98, NotChecked=1206, Total=5402 [2021-11-21 00:22:53,293 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 74 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 65 states have internal predecessors, (138), 10 states have call successors, (15), 6 states have call predecessors, (15), 11 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) [2021-11-21 00:22:55,490 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (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_2)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (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_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) (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|) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (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_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))))) (_ bv1 1))) (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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) is different from false [2021-11-21 00:22:57,533 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (= (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|) (= (_ bv0 1) (select |c_old(#valid)| |c_node_create_~temp~0#1.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_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))))))))) (= (_ 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 (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_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ 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 (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_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|))))) (_ bv1 1))) (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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (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_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) (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|)) is different from false [2021-11-21 00:22:59,557 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (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|))) (= (_ 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|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.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|))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (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_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ 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_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|))))) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))))))))) (= (_ 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 (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from false [2021-11-21 00:23:01,593 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (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|))) (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|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.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|))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (bvneg (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_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|)))))))) (_ bv1 1)))) (= (_ 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_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_8|))))) (_ bv1 1))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_~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 (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (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_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|))))))))))))) (= (_ 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 (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_append_~head#1.offset_BEFORE_CALL_10|)))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from false