./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V --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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:18:47,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:18:47,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:18:47,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:18:47,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:18:47,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:18:47,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:18:47,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:18:47,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:18:47,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:18:47,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:18:47,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:18:47,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:18:47,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:18:47,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:18:47,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:18:47,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:18:47,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:18:47,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:18:47,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:18:47,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:18:47,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:18:47,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:18:47,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:18:47,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:18:47,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:18:47,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:18:47,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:18:47,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:18:47,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:18:47,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:18:47,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:18:47,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:18:47,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:18:47,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:18:47,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:18:47,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:18:47,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:18:47,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:18:47,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:18:47,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:18:47,142 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-23 02:18:47,200 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:18:47,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:18:47,206 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:18:47,206 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:18:47,207 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:18:47,207 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:18:47,208 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:18:47,208 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:18:47,208 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:18:47,208 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:18:47,209 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:18:47,210 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:18:47,210 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:18:47,210 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:18:47,210 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:18:47,211 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:18:47,211 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:18:47,211 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:18:47,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 02:18:47,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 02:18:47,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:18:47,213 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:18:47,213 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:18:47,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:18:47,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:18:47,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:18:47,216 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 02:18:47,216 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 02:18:47,216 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 02:18:47,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:18:47,217 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 02:18:47,217 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:18:47,217 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:18:47,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:18:47,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:18:47,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:18:47,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:18:47,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:18:47,218 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:18:47,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:18:47,219 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:18:47,219 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:18:47,219 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_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/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_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2021-11-23 02:18:47,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:18:47,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:18:47,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:18:47,502 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:18:47,503 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:18:47,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2021-11-23 02:18:47,584 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/data/5e1075414/d13767d6d09c4e7facc94632cfc00830/FLAGa8fa87dbe [2021-11-23 02:18:48,136 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:18:48,137 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2021-11-23 02:18:48,162 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/data/5e1075414/d13767d6d09c4e7facc94632cfc00830/FLAGa8fa87dbe [2021-11-23 02:18:48,419 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/data/5e1075414/d13767d6d09c4e7facc94632cfc00830 [2021-11-23 02:18:48,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:18:48,423 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:18:48,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:18:48,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:18:48,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:18:48,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:48" (1/1) ... [2021-11-23 02:18:48,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1abd765b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48, skipping insertion in model container [2021-11-23 02:18:48,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:48" (1/1) ... [2021-11-23 02:18:48,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:18:48,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:18:48,840 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_72be73eb-3030-4838-b31b-ea81debddd74/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2021-11-23 02:18:48,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:18:48,863 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:18:48,910 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_72be73eb-3030-4838-b31b-ea81debddd74/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2021-11-23 02:18:48,911 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:18:48,943 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:18:48,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48 WrapperNode [2021-11-23 02:18:48,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:18:48,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:18:48,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:18:48,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:18:48,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48" (1/1) ... [2021-11-23 02:18:48,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48" (1/1) ... [2021-11-23 02:18:48,993 INFO L137 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2021-11-23 02:18:48,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:18:48,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:18:48,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:18:48,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:18:49,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48" (1/1) ... [2021-11-23 02:18:49,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48" (1/1) ... [2021-11-23 02:18:49,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48" (1/1) ... [2021-11-23 02:18:49,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48" (1/1) ... [2021-11-23 02:18:49,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48" (1/1) ... [2021-11-23 02:18:49,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48" (1/1) ... [2021-11-23 02:18:49,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48" (1/1) ... [2021-11-23 02:18:49,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:18:49,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:18:49,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:18:49,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:18:49,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48" (1/1) ... [2021-11-23 02:18:49,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:18:49,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:18:49,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:18:49,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:18:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 02:18:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 02:18:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-23 02:18:49,108 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-23 02:18:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 02:18:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:18:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:18:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 02:18:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 02:18:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:18:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 02:18:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 02:18:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:18:49,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:18:49,210 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:18:49,212 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:18:49,553 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:18:49,616 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:18:49,616 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-23 02:18:49,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:49 BoogieIcfgContainer [2021-11-23 02:18:49,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:18:49,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:18:49,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:18:49,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:18:49,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:18:48" (1/3) ... [2021-11-23 02:18:49,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774c4d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:49, skipping insertion in model container [2021-11-23 02:18:49,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:48" (2/3) ... [2021-11-23 02:18:49,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774c4d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:49, skipping insertion in model container [2021-11-23 02:18:49,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:49" (3/3) ... [2021-11-23 02:18:49,626 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2021-11-23 02:18:49,631 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:18:49,632 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2021-11-23 02:18:49,670 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:18:49,677 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-23 02:18:49,677 INFO L340 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2021-11-23 02:18:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 33 states have (on average 2.272727272727273) internal successors, (75), 66 states have internal predecessors, (75), 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-23 02:18:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 02:18:49,702 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:18:49,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 02:18:49,704 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:18:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:18:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1129778367, now seen corresponding path program 1 times [2021-11-23 02:18:49,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:18:49,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277365324] [2021-11-23 02:18:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:49,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:18:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:49,995 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-23 02:18:49,996 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:18:49,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277365324] [2021-11-23 02:18:49,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277365324] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:18:49,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:18:49,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:18:50,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727551824] [2021-11-23 02:18:50,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:18:50,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:18:50,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:18:50,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:18:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:18:50,038 INFO L87 Difference]: Start difference. First operand has 70 states, 33 states have (on average 2.272727272727273) internal successors, (75), 66 states have internal predecessors, (75), 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) 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-23 02:18:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:18:50,136 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2021-11-23 02:18:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:18:50,139 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-23 02:18:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:18:50,148 INFO L225 Difference]: With dead ends: 68 [2021-11-23 02:18:50,149 INFO L226 Difference]: Without dead ends: 66 [2021-11-23 02:18:50,150 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-23 02:18:50,155 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:18:50,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 90 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:18:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-23 02:18:50,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-11-23 02:18:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 32 states have (on average 2.125) internal successors, (68), 62 states have internal predecessors, (68), 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-23 02:18:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2021-11-23 02:18:50,197 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 6 [2021-11-23 02:18:50,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:18:50,197 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2021-11-23 02:18:50,197 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-23 02:18:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2021-11-23 02:18:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 02:18:50,198 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:18:50,198 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 02:18:50,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 02:18:50,199 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:18:50,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:18:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1129778368, now seen corresponding path program 1 times [2021-11-23 02:18:50,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:18:50,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541273052] [2021-11-23 02:18:50,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:50,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:18:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:50,265 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-23 02:18:50,265 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:18:50,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541273052] [2021-11-23 02:18:50,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541273052] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:18:50,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:18:50,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:18:50,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678124043] [2021-11-23 02:18:50,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:18:50,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:18:50,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:18:50,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:18:50,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:18:50,286 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:18:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:18:50,361 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-11-23 02:18:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:18:50,362 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-23 02:18:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:18:50,363 INFO L225 Difference]: With dead ends: 64 [2021-11-23 02:18:50,364 INFO L226 Difference]: Without dead ends: 64 [2021-11-23 02:18:50,364 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-23 02:18:50,366 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:18:50,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:18:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-23 02:18:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-11-23 02:18:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 2.0625) internal successors, (66), 60 states have internal predecessors, (66), 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-23 02:18:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-11-23 02:18:50,375 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 6 [2021-11-23 02:18:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:18:50,375 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-11-23 02:18:50,375 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-23 02:18:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-11-23 02:18:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 02:18:50,376 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:18:50,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:18:50,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 02:18:50,377 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:18:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:18:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1940859804, now seen corresponding path program 1 times [2021-11-23 02:18:50,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:18:50,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132471201] [2021-11-23 02:18:50,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:50,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:18:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:50,457 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-23 02:18:50,457 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:18:50,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132471201] [2021-11-23 02:18:50,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132471201] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:18:50,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:18:50,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:18:50,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929755908] [2021-11-23 02:18:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:18:50,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:18:50,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:18:50,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:18:50,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:18:50,465 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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-23 02:18:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:18:50,672 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2021-11-23 02:18:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:18:50,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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-23 02:18:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:18:50,676 INFO L225 Difference]: With dead ends: 66 [2021-11-23 02:18:50,676 INFO L226 Difference]: Without dead ends: 66 [2021-11-23 02:18:50,677 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-23 02:18:50,684 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:18:50,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 185 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:18:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-23 02:18:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2021-11-23 02:18:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 32 states have (on average 2.03125) internal successors, (65), 59 states have internal predecessors, (65), 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-23 02:18:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-11-23 02:18:50,712 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 10 [2021-11-23 02:18:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:18:50,713 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-11-23 02:18:50,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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-23 02:18:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-11-23 02:18:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 02:18:50,714 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:18:50,714 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:18:50,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 02:18:50,715 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:18:50,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:18:50,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1940859805, now seen corresponding path program 1 times [2021-11-23 02:18:50,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:18:50,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156690033] [2021-11-23 02:18:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:50,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:18:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:50,885 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-23 02:18:50,885 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:18:50,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156690033] [2021-11-23 02:18:50,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156690033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:18:50,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:18:50,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:18:50,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334033353] [2021-11-23 02:18:50,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:18:50,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:18:50,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:18:50,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:18:50,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:18:50,890 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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-23 02:18:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:18:51,095 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2021-11-23 02:18:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:18:51,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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-23 02:18:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:18:51,101 INFO L225 Difference]: With dead ends: 65 [2021-11-23 02:18:51,101 INFO L226 Difference]: Without dead ends: 65 [2021-11-23 02:18:51,101 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-23 02:18:51,111 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:18:51,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 197 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:18:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-23 02:18:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2021-11-23 02:18:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 32 states have (on average 2.0) internal successors, (64), 58 states have internal predecessors, (64), 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-23 02:18:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-11-23 02:18:51,127 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 10 [2021-11-23 02:18:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:18:51,128 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-11-23 02:18:51,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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-23 02:18:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-11-23 02:18:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 02:18:51,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:18:51,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:18:51,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 02:18:51,130 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:18:51,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:18:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash -298389700, now seen corresponding path program 1 times [2021-11-23 02:18:51,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:18:51,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493655633] [2021-11-23 02:18:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:51,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:18:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:51,191 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-23 02:18:51,192 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:18:51,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493655633] [2021-11-23 02:18:51,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493655633] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:18:51,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:18:51,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:18:51,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432328508] [2021-11-23 02:18:51,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:18:51,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:18:51,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:18:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:18:51,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:18:51,197 INFO L87 Difference]: Start difference. First operand 62 states and 68 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-23 02:18:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:18:51,229 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2021-11-23 02:18:51,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:18:51,230 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-23 02:18:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:18:51,232 INFO L225 Difference]: With dead ends: 66 [2021-11-23 02:18:51,232 INFO L226 Difference]: Without dead ends: 66 [2021-11-23 02:18:51,233 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-23 02:18:51,234 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:18:51,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 111 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:18:51,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-23 02:18:51,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2021-11-23 02:18:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 59 states have internal predecessors, (65), 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-23 02:18:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-11-23 02:18:51,256 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 10 [2021-11-23 02:18:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:18:51,257 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-11-23 02:18:51,257 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-23 02:18:51,258 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-11-23 02:18:51,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 02:18:51,259 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:18:51,259 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:18:51,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 02:18:51,260 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:18:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:18:51,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1310491658, now seen corresponding path program 1 times [2021-11-23 02:18:51,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:18:51,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115682535] [2021-11-23 02:18:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:51,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:18:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 02:18:51,353 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:18:51,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115682535] [2021-11-23 02:18:51,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115682535] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:18:51,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002082039] [2021-11-23 02:18:51,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:51,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:18:51,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:18:51,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:18:51,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 02:18:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:51,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:18:51,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:18:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:18:51,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:18:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 02:18:51,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002082039] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:18:51,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1669950218] [2021-11-23 02:18:51,650 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-23 02:18:51,650 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:18:51,654 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:18:51,660 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:18:51,660 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:18:51,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:51,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:51,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-23 02:18:51,968 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 02:18:51,968 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 39 treesize of output 45 [2021-11-23 02:18:52,015 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-23 02:18:52,035 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-23 02:18:52,056 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-23 02:18:52,064 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-23 02:18:52,076 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 19 treesize of output 1 [2021-11-23 02:18:52,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:52,109 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 25 treesize of output 13 [2021-11-23 02:18:52,116 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-23 02:18:52,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:52,126 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 25 treesize of output 13 [2021-11-23 02:18:52,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:52,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:52,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-23 02:18:52,288 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 02:18:52,289 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 39 treesize of output 45 [2021-11-23 02:18:52,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:52,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:52,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-23 02:18:52,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:18:52,467 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 21 treesize of output 13 [2021-11-23 02:18:52,478 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:18:52,480 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 21 treesize of output 13 [2021-11-23 02:18:52,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:52,494 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-23 02:18:52,574 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:18:52,574 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 31 treesize of output 27 [2021-11-23 02:18:52,633 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-23 02:18:52,645 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 13 treesize of output 9 [2021-11-23 02:18:52,656 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 9 treesize of output 3 [2021-11-23 02:18:52,668 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-23 02:18:52,685 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 9 treesize of output 3 [2021-11-23 02:18:52,734 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:18:52,735 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 31 treesize of output 27 [2021-11-23 02:18:52,786 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-23 02:18:52,800 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 13 treesize of output 9 [2021-11-23 02:18:52,814 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 9 treesize of output 3 [2021-11-23 02:18:52,823 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 9 treesize of output 3 [2021-11-23 02:18:52,839 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-23 02:18:53,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:53,043 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 270 treesize of output 250 [2021-11-23 02:18:53,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:18:53,059 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 0 case distinctions, treesize of input 251 treesize of output 239 [2021-11-23 02:18:53,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:18:53,074 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 0 case distinctions, treesize of input 248 treesize of output 236 [2021-11-23 02:18:53,176 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:18:53,177 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 31 treesize of output 27 [2021-11-23 02:18:53,235 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 13 treesize of output 9 [2021-11-23 02:18:53,244 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-23 02:18:53,253 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 9 treesize of output 3 [2021-11-23 02:18:53,276 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 9 treesize of output 3 [2021-11-23 02:18:53,286 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-23 02:18:53,330 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:18:53,330 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 31 treesize of output 27 [2021-11-23 02:18:53,385 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-23 02:18:53,394 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 9 treesize of output 3 [2021-11-23 02:18:53,407 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 13 treesize of output 9 [2021-11-23 02:18:53,421 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 9 treesize of output 3 [2021-11-23 02:18:53,434 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-23 02:18:53,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:53,580 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 270 treesize of output 250 [2021-11-23 02:18:53,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:18:53,594 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 0 case distinctions, treesize of input 251 treesize of output 239 [2021-11-23 02:18:53,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:18:53,608 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 0 case distinctions, treesize of input 254 treesize of output 242 [2021-11-23 02:18:53,895 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 7 treesize of output 3 [2021-11-23 02:18:53,912 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 7 treesize of output 3 [2021-11-23 02:18:54,031 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 7 treesize of output 3 [2021-11-23 02:18:54,050 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 7 treesize of output 3 [2021-11-23 02:18:54,294 INFO L354 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2021-11-23 02:18:54,295 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 396 treesize of output 401 [2021-11-23 02:18:54,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:54,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-23 02:18:54,463 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 105 for LOIs [2021-11-23 02:18:55,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:18:55,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-23 02:18:55,546 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.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) 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:119) 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-23 02:18:55,549 INFO L158 Benchmark]: Toolchain (without parser) took 7126.01ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 67.4MB in the beginning and 73.0MB in the end (delta: -5.6MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2021-11-23 02:18:55,549 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 104.9MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:18:55,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.87ms. Allocated memory is still 104.9MB. Free memory was 67.2MB in the beginning and 73.3MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 02:18:55,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.67ms. Allocated memory is still 104.9MB. Free memory was 73.3MB in the beginning and 71.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:18:55,550 INFO L158 Benchmark]: Boogie Preprocessor took 32.22ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 69.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:18:55,551 INFO L158 Benchmark]: RCFGBuilder took 591.80ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 49.6MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-23 02:18:55,551 INFO L158 Benchmark]: TraceAbstraction took 5928.43ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 49.3MB in the beginning and 73.0MB in the end (delta: -23.6MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2021-11-23 02:18:55,553 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.28ms. Allocated memory is still 104.9MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.87ms. Allocated memory is still 104.9MB. Free memory was 67.2MB in the beginning and 73.3MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.67ms. Allocated memory is still 104.9MB. Free memory was 73.3MB in the beginning and 71.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.22ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 69.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 591.80ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 49.6MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5928.43ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 49.3MB in the beginning and 73.0MB in the end (delta: -23.6MB). Peak memory consumption was 1.5MB. 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-23 02:18:55,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/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_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V --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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:18:57,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:18:57,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:18:57,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:18:57,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:18:57,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:18:57,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:18:58,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:18:58,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:18:58,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:18:58,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:18:58,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:18:58,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:18:58,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:18:58,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:18:58,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:18:58,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:18:58,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:18:58,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:18:58,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:18:58,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:18:58,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:18:58,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:18:58,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:18:58,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:18:58,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:18:58,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:18:58,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:18:58,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:18:58,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:18:58,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:18:58,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:18:58,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:18:58,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:18:58,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:18:58,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:18:58,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:18:58,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:18:58,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:18:58,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:18:58,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:18:58,071 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-23 02:18:58,117 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:18:58,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:18:58,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:18:58,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:18:58,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:18:58,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:18:58,119 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:18:58,119 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:18:58,119 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:18:58,120 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:18:58,121 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:18:58,121 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:18:58,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 02:18:58,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 02:18:58,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:18:58,123 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:18:58,123 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:18:58,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:18:58,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:18:58,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:18:58,124 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 02:18:58,124 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 02:18:58,124 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 02:18:58,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:18:58,124 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 02:18:58,125 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-23 02:18:58,125 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-23 02:18:58,125 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:18:58,125 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:18:58,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:18:58,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 02:18:58,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:18:58,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:18:58,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:18:58,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:18:58,127 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-23 02:18:58,127 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-23 02:18:58,128 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:18:58,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:18:58,128 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_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/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_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2021-11-23 02:18:58,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:18:58,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:18:58,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:18:58,541 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:18:58,542 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:18:58,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2021-11-23 02:18:58,612 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/data/33d94c879/7c3c76dc2a4a47ac85bc59f7cd51e9ec/FLAG45529d227 [2021-11-23 02:18:59,156 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:18:59,158 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2021-11-23 02:18:59,179 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/data/33d94c879/7c3c76dc2a4a47ac85bc59f7cd51e9ec/FLAG45529d227 [2021-11-23 02:18:59,467 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/data/33d94c879/7c3c76dc2a4a47ac85bc59f7cd51e9ec [2021-11-23 02:18:59,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:18:59,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:18:59,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:18:59,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:18:59,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:18:59,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:59" (1/1) ... [2021-11-23 02:18:59,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc1e89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:59, skipping insertion in model container [2021-11-23 02:18:59,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:59" (1/1) ... [2021-11-23 02:18:59,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:18:59,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:18:59,959 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_72be73eb-3030-4838-b31b-ea81debddd74/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2021-11-23 02:18:59,962 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:18:59,985 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:19:00,050 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_72be73eb-3030-4838-b31b-ea81debddd74/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2021-11-23 02:19:00,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:19:00,107 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:19:00,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:00 WrapperNode [2021-11-23 02:19:00,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:19:00,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:19:00,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:19:00,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:19:00,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:00" (1/1) ... [2021-11-23 02:19:00,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:00" (1/1) ... [2021-11-23 02:19:00,190 INFO L137 Inliner]: procedures = 130, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2021-11-23 02:19:00,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:19:00,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:19:00,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:19:00,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:19:00,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:00" (1/1) ... [2021-11-23 02:19:00,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:00" (1/1) ... [2021-11-23 02:19:00,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:00" (1/1) ... [2021-11-23 02:19:00,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:00" (1/1) ... [2021-11-23 02:19:00,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:00" (1/1) ... [2021-11-23 02:19:00,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:00" (1/1) ... [2021-11-23 02:19:00,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:00" (1/1) ... [2021-11-23 02:19:00,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:19:00,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:19:00,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:19:00,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:19:00,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:00" (1/1) ... [2021-11-23 02:19:00,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:19:00,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:19:00,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:19:00,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:19:00,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-23 02:19:00,350 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-23 02:19:00,351 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-23 02:19:00,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 02:19:00,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:19:00,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:19:00,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 02:19:00,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 02:19:00,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:19:00,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-23 02:19:00,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 02:19:00,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-23 02:19:00,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:19:00,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:19:00,539 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:19:00,541 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:19:01,018 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:19:01,025 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:19:01,025 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-23 02:19:01,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:19:01 BoogieIcfgContainer [2021-11-23 02:19:01,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:19:01,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:19:01,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:19:01,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:19:01,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:18:59" (1/3) ... [2021-11-23 02:19:01,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a4f938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:19:01, skipping insertion in model container [2021-11-23 02:19:01,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:00" (2/3) ... [2021-11-23 02:19:01,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a4f938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:19:01, skipping insertion in model container [2021-11-23 02:19:01,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:19:01" (3/3) ... [2021-11-23 02:19:01,035 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2021-11-23 02:19:01,040 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:19:01,041 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2021-11-23 02:19:01,084 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:19:01,091 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-23 02:19:01,091 INFO L340 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2021-11-23 02:19:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 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-23 02:19:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 02:19:01,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:19:01,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:19:01,115 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:19:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:19:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904761, now seen corresponding path program 1 times [2021-11-23 02:19:01,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:19:01,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143012603] [2021-11-23 02:19:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:19:01,145 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:19:01,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:19:01,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:19:01,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-23 02:19:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:19:01,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 02:19:01,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:19:01,312 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-23 02:19:01,326 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-23 02:19:01,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:19:01,359 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-23 02:19:01,360 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:19:01,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143012603] [2021-11-23 02:19:01,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143012603] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:19:01,362 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:19:01,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-23 02:19:01,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991174905] [2021-11-23 02:19:01,365 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:19:01,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:19:01,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:19:01,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:19:01,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:19:01,418 INFO L87 Difference]: Start difference. First operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:19:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:19:01,600 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2021-11-23 02:19:01,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:19:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-23 02:19:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:19:01,617 INFO L225 Difference]: With dead ends: 83 [2021-11-23 02:19:01,617 INFO L226 Difference]: Without dead ends: 80 [2021-11-23 02:19:01,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-23 02:19:01,624 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:19:01,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:19:01,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-11-23 02:19:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-11-23 02:19:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 76 states have internal predecessors, (82), 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-23 02:19:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2021-11-23 02:19:01,685 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 7 [2021-11-23 02:19:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:19:01,685 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2021-11-23 02:19:01,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:19:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2021-11-23 02:19:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 02:19:01,686 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:19:01,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:19:01,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:19:01,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:19:01,898 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:19:01,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:19:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904762, now seen corresponding path program 1 times [2021-11-23 02:19:01,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:19:01,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101337101] [2021-11-23 02:19:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:19:01,906 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:19:01,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:19:01,908 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:19:01,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-23 02:19:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:19:01,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 02:19:01,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:19:01,997 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-23 02:19:02,020 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-23 02:19:02,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:19:02,088 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-23 02:19:02,089 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:19:02,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101337101] [2021-11-23 02:19:02,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101337101] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:19:02,090 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:19:02,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-23 02:19:02,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951723977] [2021-11-23 02:19:02,090 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:19:02,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:19:02,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:19:02,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:19:02,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:19:02,093 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:19:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:19:02,396 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2021-11-23 02:19:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:19:02,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-23 02:19:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:19:02,400 INFO L225 Difference]: With dead ends: 78 [2021-11-23 02:19:02,400 INFO L226 Difference]: Without dead ends: 78 [2021-11-23 02:19:02,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-23 02:19:02,402 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:19:02,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:19:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-23 02:19:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-11-23 02:19:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 74 states have internal predecessors, (80), 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-23 02:19:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2021-11-23 02:19:02,423 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 7 [2021-11-23 02:19:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:19:02,424 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2021-11-23 02:19:02,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:19:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2021-11-23 02:19:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 02:19:02,426 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:19:02,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:19:02,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:19:02,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:19:02,652 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:19:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:19:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810752, now seen corresponding path program 1 times [2021-11-23 02:19:02,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:19:02,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173307401] [2021-11-23 02:19:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:19:02,654 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:19:02,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:19:02,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:19:02,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-23 02:19:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:19:02,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:19:02,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:19:02,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:19:02,848 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-23 02:19:02,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:19:02,953 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-23 02:19:02,954 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:19:02,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173307401] [2021-11-23 02:19:02,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173307401] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:19:02,954 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:19:02,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-23 02:19:02,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254059895] [2021-11-23 02:19:02,955 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:19:02,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:19:02,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:19:02,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:19:02,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:19:02,957 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-23 02:19:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:19:03,373 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2021-11-23 02:19:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:19:03,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2021-11-23 02:19:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:19:03,376 INFO L225 Difference]: With dead ends: 82 [2021-11-23 02:19:03,376 INFO L226 Difference]: Without dead ends: 82 [2021-11-23 02:19:03,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:19:03,377 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:19:03,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 268 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:19:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-23 02:19:03,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2021-11-23 02:19:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 73 states have internal predecessors, (79), 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-23 02:19:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2021-11-23 02:19:03,393 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 13 [2021-11-23 02:19:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:19:03,394 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2021-11-23 02:19:03,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-23 02:19:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2021-11-23 02:19:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 02:19:03,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:19:03,396 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:19:03,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:19:03,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:19:03,607 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:19:03,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:19:03,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810753, now seen corresponding path program 1 times [2021-11-23 02:19:03,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:19:03,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659550533] [2021-11-23 02:19:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:19:03,609 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:19:03,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:19:03,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:19:03,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-23 02:19:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:19:03,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 02:19:03,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:19:03,713 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-23 02:19:03,821 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-23 02:19:03,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:19:04,197 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-23 02:19:04,197 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:19:04,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659550533] [2021-11-23 02:19:04,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659550533] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:19:04,198 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:19:04,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-23 02:19:04,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313007770] [2021-11-23 02:19:04,198 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:19:04,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:19:04,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:19:04,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:19:04,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-23 02:19:04,200 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:19:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:19:05,079 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2021-11-23 02:19:05,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:19:05,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-11-23 02:19:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:19:05,081 INFO L225 Difference]: With dead ends: 81 [2021-11-23 02:19:05,081 INFO L226 Difference]: Without dead ends: 81 [2021-11-23 02:19:05,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:19:05,083 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 11 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-23 02:19:05,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 331 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-23 02:19:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-23 02:19:05,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2021-11-23 02:19:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 states have internal predecessors, (78), 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-23 02:19:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2021-11-23 02:19:05,091 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 13 [2021-11-23 02:19:05,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:19:05,092 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2021-11-23 02:19:05,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:19:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2021-11-23 02:19:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 02:19:05,093 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:19:05,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:19:05,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:19:05,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:19:05,304 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:19:05,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:19:05,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1399608384, now seen corresponding path program 1 times [2021-11-23 02:19:05,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:19:05,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526121300] [2021-11-23 02:19:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:19:05,305 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:19:05,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:19:05,306 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:19:05,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-23 02:19:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:19:05,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 02:19:05,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:19:05,432 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-23 02:19:05,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:19:05,480 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-23 02:19:05,480 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:19:05,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526121300] [2021-11-23 02:19:05,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526121300] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:19:05,481 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:19:05,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-23 02:19:05,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866446609] [2021-11-23 02:19:05,481 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:19:05,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:19:05,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:19:05,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:19:05,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:19:05,484 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:19:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:19:05,510 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2021-11-23 02:19:05,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:19:05,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-11-23 02:19:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:19:05,512 INFO L225 Difference]: With dead ends: 83 [2021-11-23 02:19:05,512 INFO L226 Difference]: Without dead ends: 83 [2021-11-23 02:19:05,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-23 02:19:05,515 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 8 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:19:05,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 232 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:19:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-11-23 02:19:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-11-23 02:19:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 78 states have internal predecessors, (84), 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-23 02:19:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2021-11-23 02:19:05,550 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 15 [2021-11-23 02:19:05,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:19:05,550 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2021-11-23 02:19:05,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:19:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2021-11-23 02:19:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-23 02:19:05,552 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:19:05,552 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:19:05,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-23 02:19:05,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:19:05,759 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:19:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:19:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186176, now seen corresponding path program 1 times [2021-11-23 02:19:05,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:19:05,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693061541] [2021-11-23 02:19:05,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:19:05,766 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:19:05,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:19:05,767 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:19:05,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-23 02:19:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:19:05,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-23 02:19:05,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:19:06,000 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-23 02:19:06,054 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 15 treesize of output 13 [2021-11-23 02:19:06,215 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 02:19:06,216 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 22 treesize of output 29 [2021-11-23 02:19:06,531 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:19:06,532 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 33 treesize of output 29 [2021-11-23 02:19:06,794 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 02:19:06,795 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 52 treesize of output 63 [2021-11-23 02:19:07,687 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 02:19:07,687 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 55 treesize of output 66 [2021-11-23 02:19:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:19:07,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:19:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 6 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:19:55,073 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:19:55,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693061541] [2021-11-23 02:19:55,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693061541] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:19:55,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1705630012] [2021-11-23 02:19:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:19:55,092 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:19:55,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:19:55,096 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:19:55,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-23 02:19:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:19:55,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-23 02:19:55,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:19:55,422 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-23 02:19:55,423 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 17 treesize of output 22 [2021-11-23 02:19:57,734 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:19:57,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2021-11-23 02:20:00,083 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 02:20:00,083 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 36 treesize of output 47 [2021-11-23 02:20:00,894 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-23 02:20:00,895 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 56 treesize of output 50 [2021-11-23 02:20:07,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:07,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:07,606 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-23 02:20:07,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 76 [2021-11-23 02:20:09,194 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-23 02:20:09,195 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 57 treesize of output 51 [2021-11-23 02:20:11,617 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-23 02:20:11,617 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 73 treesize of output 90 [2021-11-23 02:20:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 02:20:12,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:20:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 02:20:53,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1705630012] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:20:53,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:20:53,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 10, 11] total 33 [2021-11-23 02:20:53,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535783960] [2021-11-23 02:20:53,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:20:53,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 02:20:53,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:20:53,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 02:20:53,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=916, Unknown=28, NotChecked=0, Total=1122 [2021-11-23 02:20:53,629 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 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-23 02:20:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:20:53,805 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2021-11-23 02:20:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 02:20:53,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 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 41 [2021-11-23 02:20:53,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:20:53,808 INFO L225 Difference]: With dead ends: 92 [2021-11-23 02:20:53,808 INFO L226 Difference]: Without dead ends: 92 [2021-11-23 02:20:53,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 115 SyntacticMatches, 13 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 96.9s TimeCoverageRelationStatistics Valid=178, Invalid=916, Unknown=28, NotChecked=0, Total=1122 [2021-11-23 02:20:53,810 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 56 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:20:53,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 148 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 102 Unchecked, 0.2s Time] [2021-11-23 02:20:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-23 02:20:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2021-11-23 02:20:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 75 states have internal predecessors, (81), 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-23 02:20:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2021-11-23 02:20:53,818 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 41 [2021-11-23 02:20:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:20:53,819 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2021-11-23 02:20:53,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 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-23 02:20:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2021-11-23 02:20:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-23 02:20:53,821 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:20:53,821 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:20:53,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2021-11-23 02:20:54,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-23 02:20:54,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:20:54,225 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:20:54,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:20:54,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186175, now seen corresponding path program 1 times [2021-11-23 02:20:54,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:20:54,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862311691] [2021-11-23 02:20:54,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:20:54,226 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:20:54,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:20:54,232 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:20:54,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-23 02:20:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:20:54,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:20:54,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:20:54,416 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-23 02:20:54,428 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-23 02:20:54,567 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 17 treesize of output 15 [2021-11-23 02:20:54,575 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 12 treesize of output 10 [2021-11-23 02:20:54,885 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:20:54,885 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-23 02:20:54,894 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:20:54,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 26 treesize of output 22 [2021-11-23 02:20:55,206 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:20:55,207 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-23 02:20:55,638 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 02:20:55,639 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 33 treesize of output 38 [2021-11-23 02:20:56,914 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-23 02:20:56,915 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 27 treesize of output 36 [2021-11-23 02:20:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:20:57,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:21:00,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_55| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)))) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| .cse0))))) is different from false [2021-11-23 02:21:04,297 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_54| (_ 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_54| (_ 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_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ 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_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ 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|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) is different from false [2021-11-23 02:22:17,371 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_63| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_63| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_63|))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) is different from true [2021-11-23 02:22:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 6 times theorem prover too weak. 0 trivial. 15 not checked. [2021-11-23 02:22:17,707 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:22:17,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862311691] [2021-11-23 02:22:17,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862311691] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:22:17,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [942341001] [2021-11-23 02:22:17,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:17,708 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:22:17,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:22:17,709 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:22:17,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-23 02:22:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:17,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:22:17,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:22:17,963 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-23 02:22:18,404 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-23 02:22:22,697 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:22:22,697 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-23 02:22:24,012 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:22:24,012 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-23 02:22:30,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:30,654 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-23 02:22:30,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 25 [2021-11-23 02:22:32,131 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:22:32,131 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-23 02:22:34,455 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 02:22:34,456 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-23 02:22:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 02:22:36,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:24:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 9 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 02:24:41,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [942341001] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:24:41,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544157579] [2021-11-23 02:24:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:24:41,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:24:41,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:24:41,018 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:24:41,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 02:24:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:24:41,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-23 02:24:41,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:24:41,150 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-23 02:24:41,161 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-23 02:24:48,350 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:24:48,350 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-23 02:24:48,394 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-11-23 02:24:48,394 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 31 treesize of output 34 [2021-11-23 02:24:53,941 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 02:24:53,941 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 51 treesize of output 56 [2021-11-23 02:24:53,977 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:24:53,977 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 50 treesize of output 48 [2021-11-23 02:24:57,231 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-11-23 02:24:57,233 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 26 treesize of output 46 [2021-11-23 02:24:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:24:59,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:25:01,527 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|)) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|))))))) is different from false [2021-11-23 02:25:03,973 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_81| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (or (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_81| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|)) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|))))))) is different from false [2021-11-23 02:25:26,913 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) is different from false [2021-11-23 02:25:31,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_85| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_85|)))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_85| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) is different from false [2021-11-23 02:25:41,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (= (_ bv0 1) (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_88| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))))))) (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))))) is different from false [2021-11-23 02:26:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2021-11-23 02:26:49,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544157579] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:26:49,484 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 02:26:49,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11, 10, 13, 12] total 58 [2021-11-23 02:26:49,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53141322] [2021-11-23 02:26:49,484 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 02:26:49,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-11-23 02:26:49,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:26:49,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-11-23 02:26:49,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2161, Unknown=98, NotChecked=840, Total=3422 [2021-11-23 02:26:49,489 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 59 states, 53 states have (on average 3.30188679245283) internal successors, (175), 43 states have internal predecessors, (175), 16 states have call successors, (18), 14 states have call predecessors, (18), 16 states have return successors, (18), 14 states have call predecessors, (18), 16 states have call successors, (18) [2021-11-23 02:26:51,507 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_85| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_85|)))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_85| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_63| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_63| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_63|))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) is different from false [2021-11-23 02:26:53,529 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_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_54| (_ 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_54| (_ 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_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ 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_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ 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|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (= (_ bv0 1) (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_88| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))))))) (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))))) is different from false [2021-11-23 02:26:55,571 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_#res#1.base|)))) (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_54| (_ 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_54| (_ 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_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ 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_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ 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|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (= (store |c_old(#length)| |c_node_create_#res#1.base| (_ bv8 32)) |c_#length|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (= (_ bv0 1) (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_88| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))))))) (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))))) is different from false [2021-11-23 02:27:00,206 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_85| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_85|)))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_85| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_63| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_63| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_63|))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) is different from false [2021-11-23 02:27:02,241 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_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_54| (_ 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_54| (_ 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_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ 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_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ 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|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (= (_ bv0 1) (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_88| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))))))) (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))))) is different from false [2021-11-23 02:27:04,302 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_#res#1.base|)))) (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_54| (_ 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_54| (_ 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_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ 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_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ 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|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#length)| |c_node_create_#res#1.base| (_ bv8 32)) |c_#length|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (= (_ bv0 1) (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_88| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))))))) (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))))) is different from false [2021-11-23 02:29:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:29:04,410 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2021-11-23 02:29:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-23 02:29:04,411 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 53 states have (on average 3.30188679245283) internal successors, (175), 43 states have internal predecessors, (175), 16 states have call successors, (18), 14 states have call predecessors, (18), 16 states have return successors, (18), 14 states have call predecessors, (18), 16 states have call successors, (18) Word has length 41 [2021-11-23 02:29:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:29:04,412 INFO L225 Difference]: With dead ends: 94 [2021-11-23 02:29:04,412 INFO L226 Difference]: Without dead ends: 94 [2021-11-23 02:29:04,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 177 SyntacticMatches, 10 SemanticMatches, 70 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 399.4s TimeCoverageRelationStatistics Valid=436, Invalid=2790, Unknown=136, NotChecked=1750, Total=5112 [2021-11-23 02:29:04,415 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 14 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 641 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:29:04,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 1022 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 641 Unchecked, 0.2s Time] [2021-11-23 02:29:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-23 02:29:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2021-11-23 02:29:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.4375) internal successors, (92), 86 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:29:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2021-11-23 02:29:04,423 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 41 [2021-11-23 02:29:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:29:04,424 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-11-23 02:29:04,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 53 states have (on average 3.30188679245283) internal successors, (175), 43 states have internal predecessors, (175), 16 states have call successors, (18), 14 states have call predecessors, (18), 16 states have return successors, (18), 14 states have call predecessors, (18), 16 states have call successors, (18) [2021-11-23 02:29:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2021-11-23 02:29:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 02:29:04,426 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:29:04,426 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:29:04,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 02:29:04,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:29:04,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:29:05,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt [2021-11-23 02:29:05,037 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:29:05,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:29:05,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1843554242, now seen corresponding path program 1 times [2021-11-23 02:29:05,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:29:05,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570939818] [2021-11-23 02:29:05,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:05,038 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:29:05,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:29:05,039 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:29:05,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-23 02:29:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:05,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:29:05,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 02:29:05,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:29:05,461 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-23 02:29:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 02:29:05,696 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:29:05,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570939818] [2021-11-23 02:29:05,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570939818] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:29:05,696 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:29:05,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-23 02:29:05,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29777487] [2021-11-23 02:29:05,697 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:29:05,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 02:29:05,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:29:05,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 02:29:05,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-23 02:29:05,698 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-23 02:29:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:29:06,037 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2021-11-23 02:29:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:29:06,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2021-11-23 02:29:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:29:06,039 INFO L225 Difference]: With dead ends: 91 [2021-11-23 02:29:06,039 INFO L226 Difference]: Without dead ends: 91 [2021-11-23 02:29:06,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 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-23 02:29:06,040 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 112 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:29:06,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 120 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:29:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-11-23 02:29:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-11-23 02:29:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.40625) internal successors, (90), 84 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:29:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2021-11-23 02:29:06,050 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 43 [2021-11-23 02:29:06,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:29:06,051 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2021-11-23 02:29:06,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-23 02:29:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2021-11-23 02:29:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:29:06,053 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:29:06,053 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:29:06,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-11-23 02:29:06,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:29:06,265 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:29:06,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:29:06,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2129100770, now seen corresponding path program 1 times [2021-11-23 02:29:06,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:29:06,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911956678] [2021-11-23 02:29:06,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:06,267 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:29:06,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:29:06,268 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:29:06,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-23 02:29:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:06,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 02:29:06,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 02:29:06,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:29:06,541 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 02:29:06,541 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 19 treesize of output 18 [2021-11-23 02:29:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 02:29:06,604 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:29:06,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911956678] [2021-11-23 02:29:06,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911956678] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:29:06,605 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:29:06,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-23 02:29:06,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482169707] [2021-11-23 02:29:06,605 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:29:06,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:29:06,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:29:06,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:29:06,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:29:06,607 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-23 02:29:06,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:29:06,819 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2021-11-23 02:29:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:29:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 45 [2021-11-23 02:29:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:29:06,820 INFO L225 Difference]: With dead ends: 101 [2021-11-23 02:29:06,821 INFO L226 Difference]: Without dead ends: 101 [2021-11-23 02:29:06,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:29:06,822 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 109 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:29:06,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 91 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:29:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-23 02:29:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2021-11-23 02:29:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.375) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:29:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2021-11-23 02:29:06,827 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 45 [2021-11-23 02:29:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:29:06,828 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2021-11-23 02:29:06,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-23 02:29:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2021-11-23 02:29:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:29:06,830 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:29:06,830 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:29:06,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-23 02:29:07,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:29:07,047 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:29:07,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:29:07,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2129100771, now seen corresponding path program 1 times [2021-11-23 02:29:07,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:29:07,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895214848] [2021-11-23 02:29:07,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:07,048 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:29:07,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:29:07,052 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:29:07,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-23 02:29:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:07,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-23 02:29:07,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 02:29:07,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:29:07,626 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:29:07,627 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 22 treesize of output 26 [2021-11-23 02:29:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 02:29:08,013 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:29:08,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895214848] [2021-11-23 02:29:08,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895214848] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:29:08,013 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:29:08,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-23 02:29:08,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849447649] [2021-11-23 02:29:08,014 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:29:08,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 02:29:08,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:29:08,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 02:29:08,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 02:29:08,015 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-23 02:29:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:29:08,233 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2021-11-23 02:29:08,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:29:08,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 45 [2021-11-23 02:29:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:29:08,235 INFO L225 Difference]: With dead ends: 87 [2021-11-23 02:29:08,235 INFO L226 Difference]: Without dead ends: 87 [2021-11-23 02:29:08,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-11-23 02:29:08,236 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 97 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:29:08,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 112 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:29:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-23 02:29:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-11-23 02:29:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.34375) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:29:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2021-11-23 02:29:08,241 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 45 [2021-11-23 02:29:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:29:08,242 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2021-11-23 02:29:08,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-23 02:29:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2021-11-23 02:29:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:29:08,243 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:29:08,244 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:29:08,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-23 02:29:08,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:29:08,453 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-23 02:29:08,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:29:08,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253767, now seen corresponding path program 1 times [2021-11-23 02:29:08,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:29:08,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273005527] [2021-11-23 02:29:08,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:08,454 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:29:08,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:29:08,454 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:29:08,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-23 02:29:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:08,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 02:29:08,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:08,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:29:09,417 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 20 treesize of output 16 [2021-11-23 02:29:09,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:29:14,430 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-23 02:29:14,430 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 75 treesize of output 67 [2021-11-23 02:29:14,482 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-23 02:29:14,482 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 64 treesize of output 66 [2021-11-23 02:29:14,591 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-23 02:29:14,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 55 [2021-11-23 02:29:15,307 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-23 02:29:15,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 60 treesize of output 46 [2021-11-23 02:29:15,316 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-23 02:29:15,317 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 40 treesize of output 26 [2021-11-23 02:29:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 02:29:17,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:29:30,520 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (let ((.cse3 (bvadd (_ bv8 32) .cse2))) (and (bvule (bvadd (_ bv4 32) .cse2) .cse3) (bvule .cse3 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))))) is different from false [2021-11-23 02:29:36,780 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_3 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (bvule (bvadd (_ bv8 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|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))))) (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse1 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse1 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))))) is different from false [2021-11-23 02:29:40,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))))) is different from false [2021-11-23 02:29:46,266 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_120| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))) (not (bvult |v_node_create_~temp~0#1.base_120| |c_#StackHeapBarrier|)) (and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120|) .cse2 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)) (select (store |c_#length| |v_node_create_~temp~0#1.base_120| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_120| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_120|) .cse2 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))))) is different from true [2021-11-23 02:29:46,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 429 treesize of output 417 [2021-11-23 02:29:46,304 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 1045 treesize of output 1001 [2021-11-23 02:29:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2021-11-23 02:29:50,324 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:29:50,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273005527] [2021-11-23 02:29:50,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273005527] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:29:50,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [685867994] [2021-11-23 02:29:50,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:50,324 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:29:50,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:29:50,325 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:29:50,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72be73eb-3030-4838-b31b-ea81debddd74/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-11-23 02:29:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:50,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-23 02:29:50,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:50,970 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-23 02:29:50,988 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-23 02:29:55,027 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 38 treesize of output 30 [2021-11-23 02:29:55,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:30:12,447 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-23 02:30:12,448 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 101 treesize of output 89 [2021-11-23 02:30:12,730 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-23 02:30:12,731 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 90 treesize of output 82 [2021-11-23 02:30:12,813 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-23 02:30:12,814 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 79 treesize of output 79 [2021-11-23 02:30:12,944 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-23 02:30:12,944 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 61 treesize of output 63 [2021-11-23 02:30:15,399 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-23 02:30:15,399 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 68 treesize of output 50 [2021-11-23 02:30:15,420 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-23 02:30:15,421 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 44 treesize of output 30 [2021-11-23 02:30:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 02:30:19,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:30:38,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (let ((.cse1 (bvadd .cse0 (_ bv8 32)))) (and (bvule (bvadd .cse0 (_ bv4 32)) .cse1) (bvule .cse1 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((|v_node_create_~temp~0#1.base_130| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse3 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_130| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))))))) (bvult |v_node_create_~temp~0#1.base_130| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_130|))))))))) is different from false [2021-11-23 02:30:47,857 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (bvule (bvadd (_ bv8 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|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (exists ((|v_node_create_~temp~0#1.base_130| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) .cse1 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_130| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130|) .cse1 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))))) (bvult |v_node_create_~temp~0#1.base_130| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_130|))))))))) is different from false [2021-11-23 02:30:49,879 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (bvule (bvadd (_ bv8 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|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (exists ((|v_node_create_~temp~0#1.base_130| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) .cse1 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_130| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130|) .cse1 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))))) (bvult |v_node_create_~temp~0#1.base_130| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_130|))))))))) is different from true [2021-11-23 02:30:54,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_130| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) .cse0 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_130| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130|) .cse0 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) (bvult |v_node_create_~temp~0#1.base_130| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_130|))))))) (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse2 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse2 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))))) is different from false [2021-11-23 02:32:49,224 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 241 treesize of output 233 [2021-11-23 02:32:49,251 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 1188 treesize of output 1136