./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/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_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/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_faca00d0-ee70-4362-84e2-b012b833f57d/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 f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:28:42,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:28:42,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:28:42,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:28:42,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:28:42,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:28:42,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:28:42,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:28:42,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:28:42,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:28:42,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:28:42,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:28:42,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:28:42,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:28:42,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:28:42,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:28:42,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:28:42,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:28:42,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:28:42,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:28:42,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:28:42,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:28:42,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:28:42,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:28:42,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:28:42,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:28:42,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:28:42,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:28:42,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:28:42,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:28:42,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:28:42,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:28:42,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:28:42,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:28:42,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:28:42,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:28:42,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:28:42,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:28:42,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:28:42,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:28:42,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:28:42,600 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-23 02:28:42,673 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:28:42,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:28:42,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:28:42,677 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:28:42,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:28:42,679 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:28:42,679 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:28:42,680 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:28:42,680 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:28:42,680 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:28:42,682 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:28:42,682 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:28:42,683 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:28:42,683 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:28:42,683 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:28:42,683 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:28:42,684 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:28:42,684 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:28:42,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 02:28:42,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 02:28:42,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:28:42,686 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:28:42,686 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:28:42,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:28:42,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:28:42,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:28:42,690 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 02:28:42,690 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 02:28:42,691 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 02:28:42,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:28:42,691 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 02:28:42,692 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:28:42,692 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:28:42,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:28:42,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:28:42,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:28:42,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:28:42,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:28:42,694 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:28:42,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:28:42,695 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:28:42,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:28:42,696 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_faca00d0-ee70-4362-84e2-b012b833f57d/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_faca00d0-ee70-4362-84e2-b012b833f57d/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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2021-11-23 02:28:43,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:28:43,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:28:43,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:28:43,087 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:28:43,088 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:28:43,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2021-11-23 02:28:43,194 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/data/7f07fb70f/a2cb374a0f604daf828c1b5e4b8079a5/FLAG7e61db46e [2021-11-23 02:28:43,978 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:28:43,979 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2021-11-23 02:28:44,012 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/data/7f07fb70f/a2cb374a0f604daf828c1b5e4b8079a5/FLAG7e61db46e [2021-11-23 02:28:44,209 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/data/7f07fb70f/a2cb374a0f604daf828c1b5e4b8079a5 [2021-11-23 02:28:44,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:28:44,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:28:44,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:28:44,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:28:44,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:28:44,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:28:44" (1/1) ... [2021-11-23 02:28:44,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@171255b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:28:44, skipping insertion in model container [2021-11-23 02:28:44,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:28:44" (1/1) ... [2021-11-23 02:28:44,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:28:44,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:28:44,800 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_faca00d0-ee70-4362-84e2-b012b833f57d/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2021-11-23 02:28:44,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:28:44,814 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:28:44,896 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_faca00d0-ee70-4362-84e2-b012b833f57d/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2021-11-23 02:28:44,898 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:28:44,941 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:28:44,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:28:44 WrapperNode [2021-11-23 02:28:44,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:28:44,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:28:44,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:28:44,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:28:44,954 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:28:44" (1/1) ... [2021-11-23 02:28:44,996 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:28:44" (1/1) ... [2021-11-23 02:28:45,029 INFO L137 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2021-11-23 02:28:45,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:28:45,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:28:45,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:28:45,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:28:45,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:28:44" (1/1) ... [2021-11-23 02:28:45,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:28:44" (1/1) ... [2021-11-23 02:28:45,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:28:44" (1/1) ... [2021-11-23 02:28:45,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:28:44" (1/1) ... [2021-11-23 02:28:45,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:28:44" (1/1) ... [2021-11-23 02:28:45,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:28:44" (1/1) ... [2021-11-23 02:28:45,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:28:44" (1/1) ... [2021-11-23 02:28:45,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:28:45,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:28:45,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:28:45,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:28:45,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:28:44" (1/1) ... [2021-11-23 02:28:45,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:28:45,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:28:45,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:28:45,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:28:45,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 02:28:45,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 02:28:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-23 02:28:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-23 02:28:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 02:28:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:28:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:28:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 02:28:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 02:28:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:28:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 02:28:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 02:28:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:28:45,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:28:45,444 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:28:45,447 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:28:46,188 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:28:46,289 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:28:46,289 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-23 02:28:46,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:28:46 BoogieIcfgContainer [2021-11-23 02:28:46,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:28:46,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:28:46,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:28:46,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:28:46,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:28:44" (1/3) ... [2021-11-23 02:28:46,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d277970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:28:46, skipping insertion in model container [2021-11-23 02:28:46,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:28:44" (2/3) ... [2021-11-23 02:28:46,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d277970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:28:46, skipping insertion in model container [2021-11-23 02:28:46,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:28:46" (3/3) ... [2021-11-23 02:28:46,304 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2021-11-23 02:28:46,312 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:28:46,312 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-11-23 02:28:46,368 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:28:46,378 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:28:46,378 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-11-23 02:28:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 47 states have (on average 2.3404255319148937) internal successors, (110), 99 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:28:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-23 02:28:46,412 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:28:46,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-23 02:28:46,413 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:28:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:28:46,426 INFO L85 PathProgramCache]: Analyzing trace with hash 220058362, now seen corresponding path program 1 times [2021-11-23 02:28:46,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:28:46,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038803812] [2021-11-23 02:28:46,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:28:46,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:28:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:28:46,733 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:28:46,734 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:28:46,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038803812] [2021-11-23 02:28:46,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038803812] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:28:46,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:28:46,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:28:46,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21316445] [2021-11-23 02:28:46,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:28:46,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:28:46,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:28:46,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:28:46,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:28:46,802 INFO L87 Difference]: Start difference. First operand has 104 states, 47 states have (on average 2.3404255319148937) internal successors, (110), 99 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:28:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:28:47,031 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2021-11-23 02:28:47,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:28:47,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-23 02:28:47,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:28:47,055 INFO L225 Difference]: With dead ends: 102 [2021-11-23 02:28:47,055 INFO L226 Difference]: Without dead ends: 100 [2021-11-23 02:28:47,059 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:28:47,067 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:28:47,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 141 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:28:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-23 02:28:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-11-23 02:28:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 46 states have (on average 2.217391304347826) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:28:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2021-11-23 02:28:47,156 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 5 [2021-11-23 02:28:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:28:47,157 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2021-11-23 02:28:47,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:28:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2021-11-23 02:28:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-23 02:28:47,159 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:28:47,159 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-23 02:28:47,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 02:28:47,161 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:28:47,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:28:47,166 INFO L85 PathProgramCache]: Analyzing trace with hash 220058363, now seen corresponding path program 1 times [2021-11-23 02:28:47,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:28:47,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539894360] [2021-11-23 02:28:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:28:47,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:28:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:28:47,301 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:28:47,301 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:28:47,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539894360] [2021-11-23 02:28:47,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539894360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:28:47,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:28:47,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:28:47,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126548741] [2021-11-23 02:28:47,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:28:47,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:28:47,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:28:47,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:28:47,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:28:47,320 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:28:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:28:47,515 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2021-11-23 02:28:47,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:28:47,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-23 02:28:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:28:47,519 INFO L225 Difference]: With dead ends: 98 [2021-11-23 02:28:47,519 INFO L226 Difference]: Without dead ends: 98 [2021-11-23 02:28:47,520 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:28:47,524 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:28:47,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:28:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-23 02:28:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-11-23 02:28:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:28:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-11-23 02:28:47,545 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 5 [2021-11-23 02:28:47,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:28:47,546 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-11-23 02:28:47,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:28:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-11-23 02:28:47,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 02:28:47,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:28:47,548 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:28:47,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 02:28:47,548 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:28:47,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:28:47,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1428630120, now seen corresponding path program 1 times [2021-11-23 02:28:47,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:28:47,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107418552] [2021-11-23 02:28:47,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:28:47,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:28:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:28:47,637 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:28:47,637 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:28:47,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107418552] [2021-11-23 02:28:47,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107418552] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:28:47,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:28:47,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:28:47,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610626933] [2021-11-23 02:28:47,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:28:47,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:28:47,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:28:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:28:47,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:28:47,641 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 02:28:47,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:28:47,709 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2021-11-23 02:28:47,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:28:47,711 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:28:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:28:47,717 INFO L225 Difference]: With dead ends: 104 [2021-11-23 02:28:47,717 INFO L226 Difference]: Without dead ends: 104 [2021-11-23 02:28:47,717 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:28:47,725 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:28:47,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 181 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:28:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-23 02:28:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2021-11-23 02:28:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 47 states have (on average 2.148936170212766) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:28:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2021-11-23 02:28:47,751 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 10 [2021-11-23 02:28:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:28:47,752 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2021-11-23 02:28:47,753 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:28:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2021-11-23 02:28:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 02:28:47,754 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:28:47,754 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:28:47,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 02:28:47,755 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:28:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:28:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash -707108059, now seen corresponding path program 1 times [2021-11-23 02:28:47,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:28:47,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808511261] [2021-11-23 02:28:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:28:47,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:28:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:28:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 02:28:47,931 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:28:47,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808511261] [2021-11-23 02:28:47,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808511261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:28:47,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:28:47,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:28:47,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117854847] [2021-11-23 02:28:47,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:28:47,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:28:47,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:28:47,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:28:47,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:28:47,939 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:28:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:28:48,268 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2021-11-23 02:28:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:28:48,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-23 02:28:48,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:28:48,274 INFO L225 Difference]: With dead ends: 99 [2021-11-23 02:28:48,275 INFO L226 Difference]: Without dead ends: 99 [2021-11-23 02:28:48,275 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:28:48,287 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:28:48,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 279 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:28:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-23 02:28:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-11-23 02:28:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 47 states have (on average 2.127659574468085) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:28:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-11-23 02:28:48,310 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 17 [2021-11-23 02:28:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:28:48,311 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-11-23 02:28:48,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:28:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-11-23 02:28:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 02:28:48,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:28:48,313 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:28:48,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 02:28:48,313 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:28:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:28:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash -707108058, now seen corresponding path program 1 times [2021-11-23 02:28:48,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:28:48,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532425386] [2021-11-23 02:28:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:28:48,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:28:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:28:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:28:48,510 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:28:48,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532425386] [2021-11-23 02:28:48,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532425386] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:28:48,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:28:48,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:28:48,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318626772] [2021-11-23 02:28:48,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:28:48,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:28:48,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:28:48,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:28:48,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:28:48,513 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:28:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:28:48,767 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2021-11-23 02:28:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:28:48,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-23 02:28:48,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:28:48,769 INFO L225 Difference]: With dead ends: 98 [2021-11-23 02:28:48,769 INFO L226 Difference]: Without dead ends: 98 [2021-11-23 02:28:48,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 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:28:48,771 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 7 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:28:48,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 303 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:28:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-23 02:28:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2021-11-23 02:28:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 47 states have (on average 2.106382978723404) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:28:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-11-23 02:28:48,793 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 17 [2021-11-23 02:28:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:28:48,794 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-11-23 02:28:48,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:28:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-11-23 02:28:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 02:28:48,797 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:28:48,797 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:28:48,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 02:28:48,797 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:28:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:28:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash -925822776, now seen corresponding path program 1 times [2021-11-23 02:28:48,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:28:48,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742615198] [2021-11-23 02:28:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:28:48,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:28:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:28:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:28:49,073 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:28:49,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742615198] [2021-11-23 02:28:49,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742615198] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:28:49,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410580422] [2021-11-23 02:28:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:28:49,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:28:49,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:28:49,079 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:28:49,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 02:28:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:28:49,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-23 02:28:49,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:28:49,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 02:28:49,446 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-11-23 02:28:49,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 9 [2021-11-23 02:28:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:28:49,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:28:49,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410580422] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:28:49,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:28:49,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2021-11-23 02:28:49,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301457877] [2021-11-23 02:28:49,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:28:49,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 02:28:49,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:28:49,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 02:28:49,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:28:49,520 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:28:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:28:49,889 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2021-11-23 02:28:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 02:28:49,890 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-11-23 02:28:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:28:49,892 INFO L225 Difference]: With dead ends: 115 [2021-11-23 02:28:49,892 INFO L226 Difference]: Without dead ends: 115 [2021-11-23 02:28:49,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-23 02:28:49,894 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 171 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:28:49,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 285 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:28:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-23 02:28:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2021-11-23 02:28:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 91 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:28:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-11-23 02:28:49,905 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 19 [2021-11-23 02:28:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:28:49,906 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-11-23 02:28:49,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:28:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-11-23 02:28:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 02:28:49,907 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:28:49,908 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:28:49,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:28:50,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:28:50,134 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:28:50,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:28:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash -925822775, now seen corresponding path program 1 times [2021-11-23 02:28:50,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:28:50,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750799792] [2021-11-23 02:28:50,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:28:50,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:28:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:28:50,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:28:50,346 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:28:50,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750799792] [2021-11-23 02:28:50,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750799792] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:28:50,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414798094] [2021-11-23 02:28:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:28:50,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:28:50,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:28:50,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:28:50,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 02:28:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:28:50,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 02:28:50,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:28:50,479 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:28:50,847 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:28:50,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-23 02:28:50,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-23 02:28:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:28:51,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:28:51,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414798094] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:28:51,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [971234168] [2021-11-23 02:28:51,314 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-23 02:28:51,315 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:28:51,322 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:28:51,329 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:28:51,330 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:28:51,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:28:51,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:28:51,421 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:28:51,551 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 02:28:51,551 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:28:51,586 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:28:51,594 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:28:51,611 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:28:51,621 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:28:51,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-23 02:28:51,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:28:51,652 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:28:51,662 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:28:51,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:28:51,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:28:51,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:28:51,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:28:51,737 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:28:51,848 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 02:28:51,849 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:28:51,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:28:51,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:28:51,940 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:28:52,126 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:28:52,126 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:28:52,204 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:28:52,217 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:28:52,229 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:28:52,254 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:28:52,268 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:28:52,344 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:28:52,344 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:28:52,419 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:28:52,434 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:28:52,452 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:28:52,473 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:28:52,485 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:28:52,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 02:28:52,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 02:28:52,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:28:52,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-23 02:28:52,978 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:28:52,984 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 285 treesize of output 273 [2021-11-23 02:28:53,411 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:28:53,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, 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:28:53,442 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:28:53,457 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:28:53,496 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:28:53,516 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:53,521 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:53,525 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:53,529 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:53,532 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:53,680 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:28:53,682 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 285 treesize of output 273 [2021-11-23 02:28:54,076 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:28:54,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-23 02:28:54,109 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:28:54,127 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:28:54,143 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:28:54,162 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:54,166 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:54,168 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:54,172 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:54,179 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:54,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 02:28:54,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 02:28:54,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:28:54,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-23 02:28:54,511 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:28:54,512 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 285 treesize of output 273 [2021-11-23 02:28:54,788 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:28:54,802 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:28:54,817 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:28:54,832 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:28:54,845 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:28:54,865 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:54,868 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:54,871 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:54,877 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:55,037 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:28:55,038 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 285 treesize of output 273 [2021-11-23 02:28:55,310 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:55,313 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:55,317 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:55,320 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:55,322 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-23 02:28:55,342 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:28:55,355 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:28:55,367 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:28:55,386 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:28:55,398 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:28:55,601 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-23 02:28:55,602 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 285 treesize of output 273 [2021-11-23 02:28:55,906 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-23 02:28:55,907 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:28:55,924 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 85 for LOIs [2021-11-23 02:28:56,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:28:56,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-23 02:28:56,641 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:28:56,645 INFO L158 Benchmark]: Toolchain (without parser) took 12429.08ms. Allocated memory was 88.1MB in the beginning and 201.3MB in the end (delta: 113.2MB). Free memory was 46.0MB in the beginning and 124.5MB in the end (delta: -78.5MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2021-11-23 02:28:56,646 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 88.1MB. Free memory is still 63.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:28:56,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 722.48ms. Allocated memory is still 88.1MB. Free memory was 45.7MB in the beginning and 54.4MB in the end (delta: -8.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 02:28:56,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.24ms. Allocated memory is still 88.1MB. Free memory was 54.4MB in the beginning and 52.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:28:56,647 INFO L158 Benchmark]: Boogie Preprocessor took 64.54ms. Allocated memory is still 88.1MB. Free memory was 52.1MB in the beginning and 50.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:28:56,647 INFO L158 Benchmark]: RCFGBuilder took 1188.45ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 50.3MB in the beginning and 76.6MB in the end (delta: -26.3MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2021-11-23 02:28:56,648 INFO L158 Benchmark]: TraceAbstraction took 10349.45ms. Allocated memory was 107.0MB in the beginning and 201.3MB in the end (delta: 94.4MB). Free memory was 76.0MB in the beginning and 124.5MB in the end (delta: -48.5MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2021-11-23 02:28:56,652 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.38ms. Allocated memory is still 88.1MB. Free memory is still 63.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 722.48ms. Allocated memory is still 88.1MB. Free memory was 45.7MB in the beginning and 54.4MB in the end (delta: -8.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.24ms. Allocated memory is still 88.1MB. Free memory was 54.4MB in the beginning and 52.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.54ms. Allocated memory is still 88.1MB. Free memory was 52.1MB in the beginning and 50.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1188.45ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 50.3MB in the beginning and 76.6MB in the end (delta: -26.3MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10349.45ms. Allocated memory was 107.0MB in the beginning and 201.3MB in the end (delta: 94.4MB). Free memory was 76.0MB in the beginning and 124.5MB in the end (delta: -48.5MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Some non-self update cases but no top-level DER relation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Some non-self update cases but no top-level DER relation: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-23 02:28:56,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/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_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/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_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/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_faca00d0-ee70-4362-84e2-b012b833f57d/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 f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:28:59,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:28:59,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:28:59,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:28:59,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:28:59,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:28:59,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:28:59,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:28:59,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:28:59,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:28:59,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:28:59,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:28:59,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:28:59,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:28:59,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:28:59,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:28:59,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:28:59,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:28:59,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:28:59,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:29:00,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:29:00,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:29:00,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:29:00,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:29:00,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:29:00,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:29:00,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:29:00,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:29:00,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:29:00,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:29:00,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:29:00,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:29:00,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:29:00,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:29:00,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:29:00,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:29:00,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:29:00,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:29:00,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:29:00,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:29:00,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:29:00,054 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-23 02:29:00,128 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:29:00,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:29:00,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:29:00,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:29:00,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:29:00,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:29:00,136 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:29:00,137 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:29:00,137 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:29:00,137 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:29:00,139 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:29:00,139 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:29:00,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 02:29:00,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 02:29:00,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:29:00,143 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:29:00,143 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:29:00,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:29:00,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:29:00,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:29:00,144 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 02:29:00,144 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 02:29:00,145 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 02:29:00,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:29:00,145 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 02:29:00,146 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-23 02:29:00,146 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-23 02:29:00,146 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:29:00,147 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:29:00,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:29:00,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 02:29:00,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:29:00,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:29:00,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:29:00,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:29:00,150 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-23 02:29:00,150 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-23 02:29:00,150 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:29:00,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:29:00,151 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_faca00d0-ee70-4362-84e2-b012b833f57d/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_faca00d0-ee70-4362-84e2-b012b833f57d/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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2021-11-23 02:29:00,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:29:00,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:29:00,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:29:00,756 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:29:00,757 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:29:00,759 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2021-11-23 02:29:00,841 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/data/8be553120/7846287514b848d09425bdd10a843cff/FLAG9361a6331 [2021-11-23 02:29:01,710 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:29:01,719 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2021-11-23 02:29:01,743 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/data/8be553120/7846287514b848d09425bdd10a843cff/FLAG9361a6331 [2021-11-23 02:29:01,916 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/data/8be553120/7846287514b848d09425bdd10a843cff [2021-11-23 02:29:01,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:29:01,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:29:01,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:29:01,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:29:01,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:29:01,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:29:01" (1/1) ... [2021-11-23 02:29:01,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403a4741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:01, skipping insertion in model container [2021-11-23 02:29:01,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:29:01" (1/1) ... [2021-11-23 02:29:01,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:29:02,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:29:02,584 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_faca00d0-ee70-4362-84e2-b012b833f57d/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2021-11-23 02:29:02,592 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:29:02,620 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:29:02,695 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_faca00d0-ee70-4362-84e2-b012b833f57d/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2021-11-23 02:29:02,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:29:02,743 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:29:02,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:02 WrapperNode [2021-11-23 02:29:02,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:29:02,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:29:02,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:29:02,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:29:02,756 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:29:02" (1/1) ... [2021-11-23 02:29:02,781 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:29:02" (1/1) ... [2021-11-23 02:29:02,822 INFO L137 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 144 [2021-11-23 02:29:02,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:29:02,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:29:02,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:29:02,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:29:02,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:02" (1/1) ... [2021-11-23 02:29:02,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:02" (1/1) ... [2021-11-23 02:29:02,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:02" (1/1) ... [2021-11-23 02:29:02,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:02" (1/1) ... [2021-11-23 02:29:02,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:02" (1/1) ... [2021-11-23 02:29:02,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:02" (1/1) ... [2021-11-23 02:29:02,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:02" (1/1) ... [2021-11-23 02:29:02,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:29:02,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:29:02,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:29:02,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:29:02,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:02" (1/1) ... [2021-11-23 02:29:02,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:29:02,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:29:02,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:29:02,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:29:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-23 02:29:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-23 02:29:03,049 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-23 02:29:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 02:29:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:29:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:29:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 02:29:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 02:29:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:29:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-23 02:29:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 02:29:03,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-23 02:29:03,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:29:03,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:29:03,226 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:29:03,228 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:29:04,142 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:29:04,152 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:29:04,153 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-23 02:29:04,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:29:04 BoogieIcfgContainer [2021-11-23 02:29:04,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:29:04,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:29:04,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:29:04,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:29:04,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:29:01" (1/3) ... [2021-11-23 02:29:04,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e67263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:29:04, skipping insertion in model container [2021-11-23 02:29:04,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:02" (2/3) ... [2021-11-23 02:29:04,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e67263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:29:04, skipping insertion in model container [2021-11-23 02:29:04,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:29:04" (3/3) ... [2021-11-23 02:29:04,167 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2021-11-23 02:29:04,174 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:29:04,175 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-11-23 02:29:04,276 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:29:04,286 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:29:04,287 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-11-23 02:29:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:29:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 02:29:04,327 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:29:04,328 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 02:29:04,329 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:29:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:29:04,337 INFO L85 PathProgramCache]: Analyzing trace with hash 895152213, now seen corresponding path program 1 times [2021-11-23 02:29:04,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:29:04,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769623332] [2021-11-23 02:29:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:04,355 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:29:04,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:29:04,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:29:04,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-23 02:29:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:04,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 02:29:04,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:04,622 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:04,650 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:29:04,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:29:04,684 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:29:04,685 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:29:04,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769623332] [2021-11-23 02:29:04,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769623332] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:29:04,687 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:29:04,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-23 02:29:04,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604621958] [2021-11-23 02:29:04,691 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:29:04,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:29:04,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:29:04,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:29:04,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:29:04,738 INFO L87 Difference]: Start difference. First operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:29:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:29:05,074 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2021-11-23 02:29:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:29:05,078 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:29:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:29:05,090 INFO L225 Difference]: With dead ends: 117 [2021-11-23 02:29:05,091 INFO L226 Difference]: Without dead ends: 114 [2021-11-23 02:29:05,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:29:05,098 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:29:05,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 183 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:29:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-23 02:29:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-11-23 02:29:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 109 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:29:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2021-11-23 02:29:05,178 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 6 [2021-11-23 02:29:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:29:05,179 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2021-11-23 02:29:05,180 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:29:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2021-11-23 02:29:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 02:29:05,182 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:29:05,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 02:29:05,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:29:05,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:29:05,403 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:29:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:29:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash 895152214, now seen corresponding path program 1 times [2021-11-23 02:29:05,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:29:05,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359702981] [2021-11-23 02:29:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:05,406 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:29:05,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:29:05,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:29:05,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-23 02:29:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:05,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 02:29:05,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:05,585 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:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:29:05,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:29:05,734 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:29:05,734 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:29:05,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359702981] [2021-11-23 02:29:05,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359702981] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:29:05,737 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:29:05,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-23 02:29:05,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121475761] [2021-11-23 02:29:05,738 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:29:05,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:29:05,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:29:05,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:29:05,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:29:05,745 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:29:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:29:06,456 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2021-11-23 02:29:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:29:06,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-23 02:29:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:29:06,460 INFO L225 Difference]: With dead ends: 112 [2021-11-23 02:29:06,460 INFO L226 Difference]: Without dead ends: 112 [2021-11-23 02:29:06,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:29:06,463 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:29:06,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 254 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-23 02:29:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-23 02:29:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-11-23 02:29:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 60 states have (on average 1.9) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:29:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2021-11-23 02:29:06,491 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 6 [2021-11-23 02:29:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:29:06,491 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2021-11-23 02:29:06,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:29:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2021-11-23 02:29:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 02:29:06,492 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:29:06,493 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:29:06,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:29:06,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:29:06,694 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:29:06,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:29:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash 972366423, now seen corresponding path program 1 times [2021-11-23 02:29:06,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:29:06,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613314522] [2021-11-23 02:29:06,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:06,696 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:29:06,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:29:06,697 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:29:06,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-23 02:29:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:06,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 02:29:06,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:06,839 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:29:06,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:29:06,895 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:29:06,895 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:29:06,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613314522] [2021-11-23 02:29:06,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613314522] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:29:06,896 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:29:06,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-23 02:29:06,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147279341] [2021-11-23 02:29:06,897 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:29:06,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:29:06,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:29:06,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:29:06,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:29:06,900 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:29:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:29:06,929 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2021-11-23 02:29:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:29:06,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2021-11-23 02:29:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:29:06,933 INFO L225 Difference]: With dead ends: 119 [2021-11-23 02:29:06,933 INFO L226 Difference]: Without dead ends: 119 [2021-11-23 02:29:06,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:29:06,935 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 9 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:29:06,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 341 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:29:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-23 02:29:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2021-11-23 02:29:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 108 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:29:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2021-11-23 02:29:06,952 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 13 [2021-11-23 02:29:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:29:06,953 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2021-11-23 02:29:06,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:29:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2021-11-23 02:29:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 02:29:06,955 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:29:06,955 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:29:06,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:29:07,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:29:07,169 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:29:07,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:29:07,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573860, now seen corresponding path program 1 times [2021-11-23 02:29:07,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:29:07,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832472853] [2021-11-23 02:29:07,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:07,171 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:29:07,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:29:07,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:29:07,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-23 02:29:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:07,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:29:07,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:07,351 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:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:29:07,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:29:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:29:07,587 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:29:07,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832472853] [2021-11-23 02:29:07,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832472853] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:29:07,588 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:29:07,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-23 02:29:07,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935171336] [2021-11-23 02:29:07,589 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:29:07,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:29:07,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:29:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:29:07,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:29:07,598 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:29:08,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:29:08,264 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-11-23 02:29:08,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:29:08,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-11-23 02:29:08,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:29:08,269 INFO L225 Difference]: With dead ends: 113 [2021-11-23 02:29:08,269 INFO L226 Difference]: Without dead ends: 113 [2021-11-23 02:29:08,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:29:08,271 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 12 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:29:08,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 349 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 02:29:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-23 02:29:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-11-23 02:29:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 61 states have (on average 1.8688524590163935) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:29:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2021-11-23 02:29:08,285 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 22 [2021-11-23 02:29:08,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:29:08,286 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2021-11-23 02:29:08,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 02:29:08,286 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2021-11-23 02:29:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 02:29:08,287 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:29:08,288 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:29:08,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:29:08,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:29:08,503 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:29:08,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:29:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573859, now seen corresponding path program 1 times [2021-11-23 02:29:08,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:29:08,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083964365] [2021-11-23 02:29:08,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:08,506 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:29:08,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:29:08,507 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:29:08,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-23 02:29:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:08,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 02:29:08,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:08,661 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:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:29:08,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:29:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:29:09,353 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:29:09,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083964365] [2021-11-23 02:29:09,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083964365] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:29:09,354 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:29:09,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-23 02:29:09,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631174268] [2021-11-23 02:29:09,356 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:29:09,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:29:09,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:29:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:29:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-23 02:29:09,359 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:29:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:29:11,073 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2021-11-23 02:29:11,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:29:11,074 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2021-11-23 02:29:11,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:29:11,076 INFO L225 Difference]: With dead ends: 112 [2021-11-23 02:29:11,076 INFO L226 Difference]: Without dead ends: 112 [2021-11-23 02:29:11,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:29:11,078 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 11 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:29:11,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 634 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-23 02:29:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-23 02:29:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2021-11-23 02:29:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:29:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2021-11-23 02:29:11,091 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 22 [2021-11-23 02:29:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:29:11,092 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2021-11-23 02:29:11,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:29:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2021-11-23 02:29:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 02:29:11,094 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:29:11,094 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:29:11,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-23 02:29:11,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:29:11,312 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:29:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:29:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413691, now seen corresponding path program 1 times [2021-11-23 02:29:11,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:29:11,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507244809] [2021-11-23 02:29:11,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:11,316 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:29:11,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:29:11,317 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:29:11,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-23 02:29:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:11,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 02:29:11,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:11,477 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:11,767 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 02:29:11,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2021-11-23 02:29:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:29:12,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:29:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:29:42,420 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:29:42,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507244809] [2021-11-23 02:29:42,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507244809] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:29:42,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1736447740] [2021-11-23 02:29:42,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:29:42,421 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:29:42,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:29:42,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:29:42,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-23 02:29:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:29:42,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 02:29:42,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:29:42,681 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:46,898 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-23 02:29:46,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2021-11-23 02:29:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:29:47,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:29:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:29:57,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1736447740] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:29:57,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:29:57,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 8, 6] total 18 [2021-11-23 02:29:57,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865752443] [2021-11-23 02:29:57,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:29:57,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:29:57,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:29:57,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:29:57,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=270, Unknown=13, NotChecked=0, Total=342 [2021-11-23 02:29:57,178 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:30:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:30:00,374 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2021-11-23 02:30:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 02:30:00,375 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-11-23 02:30:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:30:00,377 INFO L225 Difference]: With dead ends: 128 [2021-11-23 02:30:00,377 INFO L226 Difference]: Without dead ends: 128 [2021-11-23 02:30:00,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=69, Invalid=297, Unknown=14, NotChecked=0, Total=380 [2021-11-23 02:30:00,379 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 95 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:30:00,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 475 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 405 Invalid, 0 Unknown, 44 Unchecked, 1.1s Time] [2021-11-23 02:30:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-23 02:30:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2021-11-23 02:30:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 105 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:30:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2021-11-23 02:30:00,392 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 25 [2021-11-23 02:30:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:30:00,393 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2021-11-23 02:30:00,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 02:30:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2021-11-23 02:30:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 02:30:00,395 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:30:00,395 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:30:00,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-23 02:30:00,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2021-11-23 02:30:00,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt [2021-11-23 02:30:00,810 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:30:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:30:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413690, now seen corresponding path program 1 times [2021-11-23 02:30:00,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:30:00,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022211053] [2021-11-23 02:30:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:30:00,815 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:30:00,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:30:00,817 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:30:00,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-23 02:30:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:30:00,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:30:00,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:30:00,986 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:30:00,994 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:30:01,403 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:30:01,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-11-23 02:30:01,419 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:30:01,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2021-11-23 02:30:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:30:01,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:30:07,562 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) is different from true [2021-11-23 02:30:12,784 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_49|)))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) is different from false [2021-11-23 02:30:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-23 02:30:15,946 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:30:15,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022211053] [2021-11-23 02:30:15,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022211053] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:30:15,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [638165618] [2021-11-23 02:30:15,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:30:15,947 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:30:15,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:30:15,951 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:30:15,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-23 02:30:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:30:16,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:30:16,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:30:16,264 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:30:16,284 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:30:16,637 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:30:16,638 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:30:16,658 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:30:16,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2021-11-23 02:30:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:30:16,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:30:31,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_57|)))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) is different from false [2021-11-23 02:30:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:30:31,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [638165618] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:30:31,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047118900] [2021-11-23 02:30:31,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:30:31,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:30:31,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:30:31,842 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:30:31,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 02:30:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:30:31,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:30:31,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:30:31,947 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:30:31,961 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:30:32,258 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:30:32,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2021-11-23 02:30:32,278 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:30:32,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2021-11-23 02:30:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:30:32,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:31:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:31:05,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047118900] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:31:05,547 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 02:31:05,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 19 [2021-11-23 02:31:05,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339431364] [2021-11-23 02:31:05,549 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 02:31:05,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-23 02:31:05,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:31:05,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-23 02:31:05,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=221, Unknown=15, NotChecked=96, Total=380 [2021-11-23 02:31:05,552 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-23 02:31:07,836 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_57|)))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_49|)))) (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse3)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-23 02:31:30,600 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_57|)))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_49|)))) (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse3)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4) (bvule .cse4 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse5)) (not (bvule .cse5 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_65|))))))) is different from false [2021-11-23 02:31:32,654 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_node_create_~temp~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse2) (bvule .cse2 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse3)) (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))))))))) is different from false [2021-11-23 02:31:34,673 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (= |c_node_create_#res#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse2) (bvule .cse2 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse3)) (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))))) (= (_ bv8 32) (select |c_#length| |c_node_create_#res#1.base|))) is different from false [2021-11-23 02:31:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:31:35,720 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2021-11-23 02:31:35,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-23 02:31:35,721 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25 [2021-11-23 02:31:35,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:31:35,724 INFO L225 Difference]: With dead ends: 137 [2021-11-23 02:31:35,724 INFO L226 Difference]: Without dead ends: 137 [2021-11-23 02:31:35,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 79.1s TimeCoverageRelationStatistics Valid=88, Invalid=334, Unknown=26, NotChecked=308, Total=756 [2021-11-23 02:31:35,726 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 7 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 747 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:31:35,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 682 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 173 Invalid, 0 Unknown, 747 Unchecked, 1.1s Time] [2021-11-23 02:31:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-23 02:31:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2021-11-23 02:31:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.646341463414634) internal successors, (135), 126 states have internal predecessors, (135), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:31:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2021-11-23 02:31:35,743 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 25 [2021-11-23 02:31:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:31:35,744 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2021-11-23 02:31:35,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-23 02:31:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2021-11-23 02:31:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 02:31:35,747 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:31:35,748 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:31:35,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:31:36,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 02:31:36,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:31:36,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:31:36,352 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:31:36,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:31:36,353 INFO L85 PathProgramCache]: Analyzing trace with hash 512234271, now seen corresponding path program 1 times [2021-11-23 02:31:36,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:31:36,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832761463] [2021-11-23 02:31:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:31:36,354 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:31:36,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:31:36,356 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:31:36,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-23 02:31:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:31:36,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 02:31:36,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:31:36,662 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:31:36,699 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:31:36,932 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 02:31:36,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2021-11-23 02:31:37,165 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:31:37,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2021-11-23 02:31:37,478 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 02:31:37,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 65 [2021-11-23 02:31:38,760 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 02:31:38,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 67 [2021-11-23 02:31:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:31:39,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:32:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:32:25,386 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:32:25,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832761463] [2021-11-23 02:32:25,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832761463] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:32:25,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1452173619] [2021-11-23 02:32:25,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:32:25,387 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:32:25,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:32:25,402 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:32:25,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-11-23 02:32:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:32:25,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:32:25,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:32:25,908 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-23 02:32:25,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2021-11-23 02:32:26,105 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:32:26,106 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 20 treesize of output 16 [2021-11-23 02:32:26,396 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-23 02:32:26,396 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 25 treesize of output 36 [2021-11-23 02:32:26,898 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-23 02:32:26,898 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 40 treesize of output 34 [2021-11-23 02:32:31,513 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-23 02:32:31,514 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 46 treesize of output 63 [2021-11-23 02:32:32,826 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-23 02:32:32,826 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 40 treesize of output 34 [2021-11-23 02:32:33,227 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-23 02:32:33,227 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 51 treesize of output 68 [2021-11-23 02:32:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 02:32:34,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:32:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:32:41,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1452173619] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:32:41,922 INFO L186 FreeRefinementEngine]: Found 2 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:32:41,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [10, 10] total 26 [2021-11-23 02:32:41,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017152774] [2021-11-23 02:32:41,923 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:32:41,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-23 02:32:41,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:32:41,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-23 02:32:41,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=566, Unknown=22, NotChecked=0, Total=702 [2021-11-23 02:32:41,926 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-23 02:32:41,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:32:41,967 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2021-11-23 02:32:41,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 02:32:41,974 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2021-11-23 02:32:41,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:32:41,977 INFO L225 Difference]: With dead ends: 135 [2021-11-23 02:32:41,977 INFO L226 Difference]: Without dead ends: 135 [2021-11-23 02:32:41,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 54.5s TimeCoverageRelationStatistics Valid=114, Invalid=566, Unknown=22, NotChecked=0, Total=702 [2021-11-23 02:32:41,980 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 17 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:32:41,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 408 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 124 Unchecked, 0.0s Time] [2021-11-23 02:32:41,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-11-23 02:32:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2021-11-23 02:32:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 125 states have internal predecessors, (134), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:32:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2021-11-23 02:32:41,992 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 37 [2021-11-23 02:32:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:32:41,993 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2021-11-23 02:32:41,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-23 02:32:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2021-11-23 02:32:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 02:32:41,996 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:32:41,996 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:32:42,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2021-11-23 02:32:42,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-23 02:32:42,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:32:42,401 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:32:42,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:32:42,401 INFO L85 PathProgramCache]: Analyzing trace with hash 512234272, now seen corresponding path program 1 times [2021-11-23 02:32:42,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:32:42,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116381701] [2021-11-23 02:32:42,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:32:42,402 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:32:42,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:32:42,404 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:32:42,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-23 02:32:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:32:42,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 02:32:42,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:32:42,696 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:32:42,712 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:32:42,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, 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:32:42,799 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:32:43,137 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:32:43,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-11-23 02:32:43,155 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:32:43,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-11-23 02:32:43,378 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:32:43,379 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:32:43,899 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 02:32:43,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2021-11-23 02:32:45,212 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-23 02:32:45,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 32 [2021-11-23 02:32:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:32:45,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:32:49,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_103| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_2|))) (or (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_103| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|)) (not (bvule |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_2| .cse0)) (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_2|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|))))))) is different from false [2021-11-23 02:32:53,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_106| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|))))) is different from false [2021-11-23 02:33:20,728 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_106| (_ BitVec 32))) (or (not (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|)) (exists ((|v_node_create_~temp~0#1.base_106| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_110| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_110|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_110| (_ bv8 32)) |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))) (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))))) is different from true [2021-11-23 02:34:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 20 not checked. [2021-11-23 02:34:22,658 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:34:22,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116381701] [2021-11-23 02:34:22,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116381701] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:34:22,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1657985257] [2021-11-23 02:34:22,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:34:22,659 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:34:22,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:34:22,668 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:34:22,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2021-11-23 02:34:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:34:23,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-23 02:34:23,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:34:23,158 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:34:25,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:34:25,383 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:34:25,384 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:34:27,510 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:34:27,510 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:34:30,047 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 02:34:30,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2021-11-23 02:34:31,330 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:34:31,330 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:34:31,718 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 02:34:31,718 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:34:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 02:34:32,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 21 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:37:23,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1657985257] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:37:23,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:37:23,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 12, 10] total 35 [2021-11-23 02:37:23,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934827366] [2021-11-23 02:37:23,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:37:23,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 02:37:23,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:37:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 02:37:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=831, Unknown=73, NotChecked=192, Total=1260 [2021-11-23 02:37:23,457 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:37:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:24,114 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2021-11-23 02:37:24,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 02:37:24,116 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-11-23 02:37:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:24,118 INFO L225 Difference]: With dead ends: 134 [2021-11-23 02:37:24,118 INFO L226 Difference]: Without dead ends: 134 [2021-11-23 02:37:24,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 212.7s TimeCoverageRelationStatistics Valid=164, Invalid=831, Unknown=73, NotChecked=192, Total=1260 [2021-11-23 02:37:24,120 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:24,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 440 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 202 Unchecked, 0.6s Time] [2021-11-23 02:37:24,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-23 02:37:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2021-11-23 02:37:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.6219512195121952) internal successors, (133), 124 states have internal predecessors, (133), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:37:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2021-11-23 02:37:24,132 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 37 [2021-11-23 02:37:24,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:24,133 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2021-11-23 02:37:24,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:37:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2021-11-23 02:37:24,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 02:37:24,136 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:24,136 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:37:24,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:24,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:24,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt [2021-11-23 02:37:24,550 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:37:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1664104416, now seen corresponding path program 1 times [2021-11-23 02:37:24,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:37:24,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920614490] [2021-11-23 02:37:24,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:24,552 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:37:24,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:37:24,553 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:37:24,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-23 02:37:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:24,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 02:37:24,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 02:37:24,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 02:37:24,887 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:37:24,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920614490] [2021-11-23 02:37:24,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920614490] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:37:24,888 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:37:24,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-23 02:37:24,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664784766] [2021-11-23 02:37:24,888 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:37:24,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:37:24,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:37:24,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:37:24,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:37:24,891 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:37:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:25,238 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2021-11-23 02:37:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:37:25,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2021-11-23 02:37:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:25,240 INFO L225 Difference]: With dead ends: 146 [2021-11-23 02:37:25,241 INFO L226 Difference]: Without dead ends: 146 [2021-11-23 02:37:25,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:37:25,242 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 79 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:25,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 100 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:37:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-23 02:37:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2021-11-23 02:37:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.5609756097560976) internal successors, (128), 119 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:37:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2021-11-23 02:37:25,253 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 39 [2021-11-23 02:37:25,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:25,254 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2021-11-23 02:37:25,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:37:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2021-11-23 02:37:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 02:37:25,257 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:25,258 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:37:25,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:25,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:37:25,474 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:37:25,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1664104415, now seen corresponding path program 1 times [2021-11-23 02:37:25,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:37:25,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817939641] [2021-11-23 02:37:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:25,478 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:37:25,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:37:25,479 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:37:25,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-23 02:37:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:25,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:37:25,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 02:37:25,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:26,105 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:37:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 02:37:26,401 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:37:26,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817939641] [2021-11-23 02:37:26,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817939641] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:37:26,401 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:37:26,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-23 02:37:26,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486003259] [2021-11-23 02:37:26,402 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:37:26,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 02:37:26,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:37:26,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 02:37:26,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-23 02:37:26,404 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-23 02:37:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:26,877 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2021-11-23 02:37:26,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:37:26,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2021-11-23 02:37:26,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:26,882 INFO L225 Difference]: With dead ends: 123 [2021-11-23 02:37:26,882 INFO L226 Difference]: Without dead ends: 123 [2021-11-23 02:37:26,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-23 02:37:26,883 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 241 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:26,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 133 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:37:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-23 02:37:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-11-23 02:37:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 82 states have (on average 1.5) internal successors, (123), 114 states have internal predecessors, (123), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:37:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2021-11-23 02:37:26,893 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 39 [2021-11-23 02:37:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:26,894 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2021-11-23 02:37:26,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-23 02:37:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2021-11-23 02:37:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 02:37:26,896 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:26,896 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:37:26,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:27,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:37:27,112 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:37:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash -47629334, now seen corresponding path program 1 times [2021-11-23 02:37:27,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:37:27,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031242709] [2021-11-23 02:37:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:27,114 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:37:27,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:37:27,116 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:37:27,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-23 02:37:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:27,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:37:27,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:27,415 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:37:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:37:27,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:37:27,882 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:37:27,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031242709] [2021-11-23 02:37:27,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031242709] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:37:27,883 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:37:27,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-23 02:37:27,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425627228] [2021-11-23 02:37:27,883 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:37:27,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:37:27,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:37:27,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:37:27,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:37:27,885 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:37:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:29,152 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2021-11-23 02:37:29,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:37:29,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2021-11-23 02:37:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:29,154 INFO L225 Difference]: With dead ends: 139 [2021-11-23 02:37:29,154 INFO L226 Difference]: Without dead ends: 139 [2021-11-23 02:37:29,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:37:29,155 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 73 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:29,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 245 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-23 02:37:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-23 02:37:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 121. [2021-11-23 02:37:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.475609756097561) internal successors, (121), 112 states have internal predecessors, (121), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:37:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2021-11-23 02:37:29,164 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 40 [2021-11-23 02:37:29,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:29,165 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2021-11-23 02:37:29,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:37:29,166 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2021-11-23 02:37:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 02:37:29,167 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:29,167 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:37:29,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:29,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:37:29,378 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:37:29,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash -47629333, now seen corresponding path program 1 times [2021-11-23 02:37:29,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:37:29,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10650083] [2021-11-23 02:37:29,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:29,380 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:37:29,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:37:29,381 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:37:29,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-23 02:37:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:29,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 02:37:29,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:29,637 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:37:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:37:29,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:37:30,853 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:37:30,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10650083] [2021-11-23 02:37:30,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10650083] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 02:37:30,854 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:37:30,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-23 02:37:30,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850992514] [2021-11-23 02:37:30,857 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 02:37:30,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:37:30,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:37:30,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:37:30,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-23 02:37:30,859 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-23 02:37:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:32,917 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2021-11-23 02:37:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:37:32,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2021-11-23 02:37:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:32,922 INFO L225 Difference]: With dead ends: 119 [2021-11-23 02:37:32,923 INFO L226 Difference]: Without dead ends: 119 [2021-11-23 02:37:32,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:37:32,924 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 148 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:32,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 368 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-23 02:37:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-23 02:37:32,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-11-23 02:37:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.451219512195122) internal successors, (119), 110 states have internal predecessors, (119), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:37:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2021-11-23 02:37:32,934 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 40 [2021-11-23 02:37:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:32,935 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2021-11-23 02:37:32,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-23 02:37:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2021-11-23 02:37:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-23 02:37:32,937 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:32,937 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:37:32,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-11-23 02:37:33,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 02:37:33,150 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-23 02:37:33,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:33,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1476263067, now seen corresponding path program 1 times [2021-11-23 02:37:33,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 02:37:33,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985818950] [2021-11-23 02:37:33,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:33,152 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 02:37:33,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 02:37:33,154 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 02:37:33,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-23 02:37:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:33,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-23 02:37:33,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:33,555 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:37:34,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-23 02:37:37,095 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:37:37,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 50 [2021-11-23 02:37:37,187 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-23 02:37:37,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 58 [2021-11-23 02:37:37,850 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:37:37,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 36 [2021-11-23 02:37:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:37:38,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:47,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) is different from false [2021-11-23 02:37:49,761 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) is different from false [2021-11-23 02:37:51,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) is different from false [2021-11-23 02:38:13,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 138 [2021-11-23 02:38:22,945 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:38:22,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 107 [2021-11-23 02:38:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-23 02:38:26,305 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 02:38:26,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985818950] [2021-11-23 02:38:26,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985818950] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:38:26,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [781616283] [2021-11-23 02:38:26,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:38:26,306 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 02:38:26,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 02:38:26,308 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 02:38:26,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-11-23 02:38:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:38:26,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-23 02:38:26,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:38:28,883 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:38:38,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-23 02:38:38,798 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 02:38:38,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 51 [2021-11-23 02:38:38,876 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-23 02:38:38,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 59 [2021-11-23 02:38:39,826 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 02:38:39,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2021-11-23 02:38:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:38:40,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:38:48,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1))))) is different from false [2021-11-23 02:38:51,449 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))))))) (_ bv1 1)) (_ bv0 1)))) is different from false [2021-11-23 02:38:53,636 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))))))) (_ bv1 1))))) is different from false [2021-11-23 02:39:22,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 138 [2021-11-23 02:39:29,720 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:39:29,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 107 [2021-11-23 02:39:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-23 02:39:30,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [781616283] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:39:30,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125616625] [2021-11-23 02:39:30,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:39:30,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:39:30,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:39:30,381 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:39:30,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_faca00d0-ee70-4362-84e2-b012b833f57d/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-23 02:39:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:39:30,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-23 02:39:30,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:39:30,745 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:39:41,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:39:43,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2021-11-23 02:39:49,045 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-23 02:39:49,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 49 [2021-11-23 02:39:49,123 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 02:39:49,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 56 [2021-11-23 02:39:52,343 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:39:52,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2021-11-23 02:39:58,759 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:39:58,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2021-11-23 02:40:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:40:02,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:40:08,054 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:40:08,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 73 [2021-11-23 02:40:08,120 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-23 02:40:08,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 72 [2021-11-23 02:40:10,418 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_188| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) (_ bv1 1))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |v_node_create_~temp~0#1.base_188|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| (_ bv0 32))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_188|)))))))) is different from false [2021-11-23 02:40:13,380 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse0)))) (_ bv1 1))) (and (= .cse0 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32)))))) is different from true [2021-11-23 02:40:19,777 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse0)))) (_ bv1 1))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (and (= (_ bv0 32) .cse0) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32))))))) is different from false [2021-11-23 02:40:21,799 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| .cse0)))) (_ bv1 1))) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (and (= (_ bv0 32) .cse0) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32))))))) is different from true [2021-11-23 02:40:22,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 256 [2021-11-23 02:40:27,267 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))) (_ bv1 1))) (and (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))))) is different from false [2021-11-23 02:40:29,278 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))) (_ bv1 1))) (and (= |c_node_create_~temp~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |c_node_create_~temp~0#1.base|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))))) is different from true [2021-11-23 02:40:38,657 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (and (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_189|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_189| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_189|)))))) is different from false [2021-11-23 02:40:40,674 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_189| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (and (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32)) (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_189|)) (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_188| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_188| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_188|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_188|)))))))) (or (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12| (_ bv0 32))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14| |v_node_create_~temp~0#1.base_188|))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_189| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_189|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_12|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_189|)))))) is different from true [2021-11-23 02:40:40,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 134 [2021-11-23 02:41:19,125 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 02:41:19,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2021-11-23 02:41:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-23 02:41:34,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125616625] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:41:34,825 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-23 02:41:34,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17, 16, 18, 18] total 73 [2021-11-23 02:41:34,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392878983] [2021-11-23 02:41:34,825 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-23 02:41:34,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2021-11-23 02:41:34,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 02:41:34,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-11-23 02:41:34,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=3591, Unknown=60, NotChecked=1452, Total=5402 [2021-11-23 02:41:34,831 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 74 states, 68 states have (on average 2.088235294117647) internal successors, (142), 65 states have internal predecessors, (142), 10 states have call successors, (15), 6 states have call predecessors, (15), 11 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) [2021-11-23 02:41:36,992 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))))))) (_ bv1 1))))) (= (_ bv0 1) (bvneg .cse0)) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= (_ bv0 1) .cse0))) is different from false [2021-11-23 02:41:39,024 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (and (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (store (select |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset|) (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (_ bv1 1))))) (= (_ bv0 1) (bvneg .cse0)) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) .cse0))) is different from false [2021-11-23 02:41:41,057 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1)))))) is different from false [2021-11-23 02:41:43,084 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_8|))))))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_156| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_166| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_166| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_166|) |v_node_create_~temp~0#1.offset_156| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_156|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|)))))))))) (bvult |v_node_create_~temp~0#1.base_166| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_166|)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_10|))))) (_ bv1 1)))))) is different from false