./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:01:46,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:01:46,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:01:46,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:01:46,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:01:46,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:01:46,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:01:46,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:01:46,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:01:46,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:01:46,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:01:46,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:01:46,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:01:46,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:01:46,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:01:46,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:01:46,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:01:46,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:01:46,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:01:46,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:01:46,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:01:46,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:01:46,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:01:46,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:01:46,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:01:46,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:01:46,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:01:46,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:01:46,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:01:46,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:01:46,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:01:46,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:01:46,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:01:46,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:01:46,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:01:46,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:01:46,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:01:46,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:01:46,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:01:46,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:01:46,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:01:46,293 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-21 01:01:46,359 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:01:46,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:01:46,361 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:01:46,361 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:01:46,362 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:01:46,362 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:01:46,363 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:01:46,363 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:01:46,363 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:01:46,364 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:01:46,365 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:01:46,365 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:01:46,366 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:01:46,366 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:01:46,366 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:01:46,367 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:01:46,367 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:01:46,367 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:01:46,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 01:01:46,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 01:01:46,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:01:46,369 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:01:46,369 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 01:01:46,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:01:46,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:01:46,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:01:46,372 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 01:01:46,372 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 01:01:46,373 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 01:01:46,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:01:46,373 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 01:01:46,374 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:01:46,374 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:01:46,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:01:46,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:01:46,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:01:46,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:01:46,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:01:46,376 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:01:46,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:01:46,376 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:01:46,377 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:01:46,377 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_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2021-11-21 01:01:46,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:01:46,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:01:46,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:01:46,795 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:01:46,796 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:01:46,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2021-11-21 01:01:46,881 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/data/f83127a11/e6eb85f714e94509a027a5ba2b87f8b1/FLAG4bb87b6cb [2021-11-21 01:01:47,595 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:01:47,596 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2021-11-21 01:01:47,620 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/data/f83127a11/e6eb85f714e94509a027a5ba2b87f8b1/FLAG4bb87b6cb [2021-11-21 01:01:47,818 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/data/f83127a11/e6eb85f714e94509a027a5ba2b87f8b1 [2021-11-21 01:01:47,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:01:47,824 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:01:47,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:01:47,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:01:47,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:01:47,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:01:47" (1/1) ... [2021-11-21 01:01:47,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252fc23b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:47, skipping insertion in model container [2021-11-21 01:01:47,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:01:47" (1/1) ... [2021-11-21 01:01:47,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:01:47,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:01:48,336 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_34c0df25-1007-4116-a9e0-03f877b828fb/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2021-11-21 01:01:48,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:01:48,351 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:01:48,458 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_34c0df25-1007-4116-a9e0-03f877b828fb/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2021-11-21 01:01:48,460 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:01:48,498 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:01:48,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:48 WrapperNode [2021-11-21 01:01:48,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:01:48,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:01:48,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:01:48,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:01:48,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:48" (1/1) ... [2021-11-21 01:01:48,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:48" (1/1) ... [2021-11-21 01:01:48,559 INFO L137 Inliner]: procedures = 127, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2021-11-21 01:01:48,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:01:48,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:01:48,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:01:48,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:01:48,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:48" (1/1) ... [2021-11-21 01:01:48,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:48" (1/1) ... [2021-11-21 01:01:48,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:48" (1/1) ... [2021-11-21 01:01:48,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:48" (1/1) ... [2021-11-21 01:01:48,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:48" (1/1) ... [2021-11-21 01:01:48,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:48" (1/1) ... [2021-11-21 01:01:48,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:48" (1/1) ... [2021-11-21 01:01:48,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:01:48,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:01:48,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:01:48,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:01:48,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:48" (1/1) ... [2021-11-21 01:01:48,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:01:48,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:01:48,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:01:48,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:01:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 01:01:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 01:01:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 01:01:48,706 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 01:01:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 01:01:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:01:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 01:01:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 01:01:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 01:01:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 01:01:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 01:01:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:01:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:01:48,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:01:48,884 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:01:48,891 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:01:49,376 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:01:49,450 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:01:49,450 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 01:01:49,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:01:49 BoogieIcfgContainer [2021-11-21 01:01:49,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:01:49,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:01:49,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:01:49,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:01:49,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:01:47" (1/3) ... [2021-11-21 01:01:49,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdaef7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:01:49, skipping insertion in model container [2021-11-21 01:01:49,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:48" (2/3) ... [2021-11-21 01:01:49,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdaef7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:01:49, skipping insertion in model container [2021-11-21 01:01:49,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:01:49" (3/3) ... [2021-11-21 01:01:49,467 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2021-11-21 01:01:49,474 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:01:49,475 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2021-11-21 01:01:49,535 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:01:49,544 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:01:49,544 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2021-11-21 01:01:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 77 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:01:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 01:01:49,574 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:01:49,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 01:01:49,575 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:01:49,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:01:49,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1731606218, now seen corresponding path program 1 times [2021-11-21 01:01:49,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:01:49,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589378148] [2021-11-21 01:01:49,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:01:49,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:01:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:01:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:01:49,814 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:01:49,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589378148] [2021-11-21 01:01:49,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589378148] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:01:49,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:01:49,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:01:49,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848045624] [2021-11-21 01:01:49,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:01:49,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:01:49,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:01:49,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:01:49,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:01:49,879 INFO L87 Difference]: Start difference. First operand has 81 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 77 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:01:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:01:50,068 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2021-11-21 01:01:50,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:01:50,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 01:01:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:01:50,081 INFO L225 Difference]: With dead ends: 79 [2021-11-21 01:01:50,082 INFO L226 Difference]: Without dead ends: 77 [2021-11-21 01:01:50,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:01:50,089 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:01:50,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 112 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:01:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-21 01:01:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-11-21 01:01:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 37 states have (on average 2.189189189189189) internal successors, (81), 73 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:01:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2021-11-21 01:01:50,146 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 6 [2021-11-21 01:01:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:01:50,146 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2021-11-21 01:01:50,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:01:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2021-11-21 01:01:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 01:01:50,148 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:01:50,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 01:01:50,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:01:50,150 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:01:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:01:50,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1731606219, now seen corresponding path program 1 times [2021-11-21 01:01:50,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:01:50,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330085301] [2021-11-21 01:01:50,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:01:50,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:01:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:01:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:01:50,290 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:01:50,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330085301] [2021-11-21 01:01:50,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330085301] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:01:50,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:01:50,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:01:50,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525387787] [2021-11-21 01:01:50,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:01:50,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:01:50,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:01:50,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:01:50,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:01:50,296 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:01:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:01:50,406 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2021-11-21 01:01:50,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:01:50,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 01:01:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:01:50,409 INFO L225 Difference]: With dead ends: 75 [2021-11-21 01:01:50,409 INFO L226 Difference]: Without dead ends: 75 [2021-11-21 01:01:50,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:01:50,411 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:01:50,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 114 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:01:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-21 01:01:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-11-21 01:01:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 37 states have (on average 2.135135135135135) internal successors, (79), 71 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:01:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2021-11-21 01:01:50,455 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 6 [2021-11-21 01:01:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:01:50,456 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2021-11-21 01:01:50,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:01:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2021-11-21 01:01:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:01:50,459 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:01:50,459 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:01:50,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 01:01:50,460 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:01:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:01:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash -527582553, now seen corresponding path program 1 times [2021-11-21 01:01:50,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:01:50,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726805204] [2021-11-21 01:01:50,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:01:50,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:01:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:01:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:01:50,581 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:01:50,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726805204] [2021-11-21 01:01:50,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726805204] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:01:50,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:01:50,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:01:50,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745075324] [2021-11-21 01:01:50,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:01:50,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:01:50,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:01:50,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:01:50,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:01:50,586 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:01:50,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:01:50,805 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2021-11-21 01:01:50,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:01:50,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-21 01:01:50,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:01:50,808 INFO L225 Difference]: With dead ends: 77 [2021-11-21 01:01:50,809 INFO L226 Difference]: Without dead ends: 77 [2021-11-21 01:01:50,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:01:50,811 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:01:50,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 231 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:01:50,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-21 01:01:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2021-11-21 01:01:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 37 states have (on average 2.108108108108108) internal successors, (78), 70 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:01:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2021-11-21 01:01:50,839 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 10 [2021-11-21 01:01:50,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:01:50,840 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2021-11-21 01:01:50,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:01:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2021-11-21 01:01:50,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:01:50,841 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:01:50,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:01:50,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 01:01:50,843 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:01:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:01:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash -527582552, now seen corresponding path program 1 times [2021-11-21 01:01:50,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:01:50,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745764491] [2021-11-21 01:01:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:01:50,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:01:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:01:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:01:51,005 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:01:51,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745764491] [2021-11-21 01:01:51,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745764491] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:01:51,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:01:51,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:01:51,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156575145] [2021-11-21 01:01:51,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:01:51,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:01:51,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:01:51,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:01:51,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:01:51,010 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:01:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:01:51,213 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2021-11-21 01:01:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:01:51,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-21 01:01:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:01:51,215 INFO L225 Difference]: With dead ends: 76 [2021-11-21 01:01:51,216 INFO L226 Difference]: Without dead ends: 76 [2021-11-21 01:01:51,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:01:51,218 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:01:51,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 243 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:01:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-21 01:01:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2021-11-21 01:01:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 37 states have (on average 2.081081081081081) internal successors, (77), 69 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:01:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2021-11-21 01:01:51,231 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 10 [2021-11-21 01:01:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:01:51,231 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2021-11-21 01:01:51,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:01:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2021-11-21 01:01:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:01:51,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:01:51,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:01:51,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 01:01:51,233 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:01:51,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:01:51,233 INFO L85 PathProgramCache]: Analyzing trace with hash -261215653, now seen corresponding path program 1 times [2021-11-21 01:01:51,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:01:51,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895212013] [2021-11-21 01:01:51,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:01:51,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:01:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:01:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:01:51,269 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:01:51,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895212013] [2021-11-21 01:01:51,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895212013] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:01:51,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:01:51,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 01:01:51,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062524791] [2021-11-21 01:01:51,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:01:51,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:01:51,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:01:51,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:01:51,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:01:51,272 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:01:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:01:51,299 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2021-11-21 01:01:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:01:51,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-21 01:01:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:01:51,300 INFO L225 Difference]: With dead ends: 77 [2021-11-21 01:01:51,301 INFO L226 Difference]: Without dead ends: 77 [2021-11-21 01:01:51,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:01:51,303 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:01:51,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 139 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:01:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-21 01:01:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2021-11-21 01:01:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 70 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:01:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2021-11-21 01:01:51,313 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 10 [2021-11-21 01:01:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:01:51,313 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2021-11-21 01:01:51,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:01:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2021-11-21 01:01:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-21 01:01:51,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:01:51,315 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:01:51,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-21 01:01:51,315 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:01:51,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:01:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash 435882560, now seen corresponding path program 1 times [2021-11-21 01:01:51,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:01:51,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934165077] [2021-11-21 01:01:51,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:01:51,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:01:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:01:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 01:01:51,394 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:01:51,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934165077] [2021-11-21 01:01:51,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934165077] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:01:51,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853286990] [2021-11-21 01:01:51,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:01:51,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:01:51,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:01:51,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:01:51,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 01:01:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:01:51,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 01:01:51,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:01:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:01:51,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:01:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 01:01:51,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853286990] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:01:51,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1107062211] [2021-11-21 01:01:51,818 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-21 01:01:51,819 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:01:51,824 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:01:51,839 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:01:51,840 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:01:52,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:01:52,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:01:52,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-21 01:01:52,380 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 01:01:52,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-21 01:01:52,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-21 01:01:52,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:01:52,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-21 01:01:52,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-21 01:01:52,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-21 01:01:52,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:01:52,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-21 01:01:52,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-21 01:01:52,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:01:52,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-21 01:01:52,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:01:52,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:01:52,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 01:01:52,903 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 01:01:52,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-21 01:01:53,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:01:53,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:01:53,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 01:01:53,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:01:53,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 01:01:53,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:01:53,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-21 01:01:53,488 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:01:53,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 01:01:53,753 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:01:53,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:01:53,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:01:53,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 01:01:53,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:01:53,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:01:53,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 01:01:54,032 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:01:54,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:01:54,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:01:54,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 01:01:54,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:01:54,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 01:01:54,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:01:54,838 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-21 01:01:54,839 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 1 case distinctions, treesize of input 229 treesize of output 209 [2021-11-21 01:01:54,856 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 01:01:54,856 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 1 case distinctions, treesize of input 210 treesize of output 198 [2021-11-21 01:01:54,874 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 01:01:54,874 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 1 case distinctions, treesize of input 207 treesize of output 195 [2021-11-21 01:01:55,342 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:01:55,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:01:55,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:01:55,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 01:01:55,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 01:01:55,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:01:55,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:01:55,648 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:01:55,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:01:55,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:01:55,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 01:01:55,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-21 01:01:55,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:01:55,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:01:56,339 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-21 01:01:56,340 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 1 case distinctions, treesize of input 229 treesize of output 209 [2021-11-21 01:01:56,355 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 01:01:56,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 198 [2021-11-21 01:01:56,370 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 01:01:56,371 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 1 case distinctions, treesize of input 201 treesize of output 189 [2021-11-21 01:01:57,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:01:57,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:01:57,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:01:57,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:01:58,373 INFO L354 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2021-11-21 01:01:58,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 360 treesize of output 365 [2021-11-21 01:01:59,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:01:59,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:01:59,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 01:02:00,392 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 103 for LOIs [2021-11-21 01:02:06,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:02:06,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:02:06,839 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Some non-self update cases but no top-level DER relation at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:340) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:278) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-21 01:02:06,845 INFO L158 Benchmark]: Toolchain (without parser) took 19020.97ms. Allocated memory was 132.1MB in the beginning and 195.0MB in the end (delta: 62.9MB). Free memory was 96.2MB in the beginning and 67.1MB in the end (delta: 29.1MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2021-11-21 01:02:06,845 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 88.1MB. Free memory was 58.7MB in the beginning and 58.7MB in the end (delta: 32.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:02:06,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.24ms. Allocated memory is still 132.1MB. Free memory was 96.0MB in the beginning and 101.0MB in the end (delta: -5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 01:02:06,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.32ms. Allocated memory is still 132.1MB. Free memory was 101.0MB in the beginning and 98.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:02:06,847 INFO L158 Benchmark]: Boogie Preprocessor took 37.54ms. Allocated memory is still 132.1MB. Free memory was 98.9MB in the beginning and 97.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:02:06,847 INFO L158 Benchmark]: RCFGBuilder took 855.69ms. Allocated memory is still 132.1MB. Free memory was 97.1MB in the beginning and 76.5MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-21 01:02:06,848 INFO L158 Benchmark]: TraceAbstraction took 17387.71ms. Allocated memory was 132.1MB in the beginning and 195.0MB in the end (delta: 62.9MB). Free memory was 76.2MB in the beginning and 67.1MB in the end (delta: 9.1MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2021-11-21 01:02:06,850 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.23ms. Allocated memory is still 88.1MB. Free memory was 58.7MB in the beginning and 58.7MB in the end (delta: 32.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.24ms. Allocated memory is still 132.1MB. Free memory was 96.0MB in the beginning and 101.0MB in the end (delta: -5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.32ms. Allocated memory is still 132.1MB. Free memory was 101.0MB in the beginning and 98.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.54ms. Allocated memory is still 132.1MB. Free memory was 98.9MB in the beginning and 97.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 855.69ms. Allocated memory is still 132.1MB. Free memory was 97.1MB in the beginning and 76.5MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17387.71ms. Allocated memory was 132.1MB in the beginning and 195.0MB in the end (delta: 62.9MB). Free memory was 76.2MB in the beginning and 67.1MB in the end (delta: 9.1MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Some non-self update cases but no top-level DER relation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Some non-self update cases but no top-level DER relation: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-21 01:02:06,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:02:09,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:02:09,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:02:09,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:02:09,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:02:09,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:02:09,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:02:09,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:02:09,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:02:09,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:02:09,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:02:09,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:02:09,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:02:09,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:02:09,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:02:09,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:02:09,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:02:09,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:02:09,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:02:09,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:02:09,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:02:09,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:02:09,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:02:09,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:02:09,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:02:09,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:02:09,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:02:09,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:02:09,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:02:09,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:02:09,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:02:09,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:02:09,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:02:09,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:02:09,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:02:09,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:02:09,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:02:09,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:02:09,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:02:09,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:02:09,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:02:09,854 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-21 01:02:09,919 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:02:09,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:02:09,920 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:02:09,920 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:02:09,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:02:09,922 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:02:09,922 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:02:09,923 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:02:09,923 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:02:09,923 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:02:09,925 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:02:09,925 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:02:09,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 01:02:09,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 01:02:09,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:02:09,928 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:02:09,928 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 01:02:09,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:02:09,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:02:09,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:02:09,929 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 01:02:09,930 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 01:02:09,930 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 01:02:09,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:02:09,930 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 01:02:09,931 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 01:02:09,931 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 01:02:09,931 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:02:09,932 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:02:09,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:02:09,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 01:02:09,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:02:09,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:02:09,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:02:09,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:02:09,935 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 01:02:09,935 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 01:02:09,935 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:02:09,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:02:09,936 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_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2021-11-21 01:02:10,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:02:10,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:02:10,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:02:10,391 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:02:10,392 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:02:10,394 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2021-11-21 01:02:10,482 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/data/4bd42dc27/87bd7180942643e69c8ddff1d00f8897/FLAGbc74d792c [2021-11-21 01:02:11,258 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:02:11,259 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2021-11-21 01:02:11,275 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/data/4bd42dc27/87bd7180942643e69c8ddff1d00f8897/FLAGbc74d792c [2021-11-21 01:02:11,548 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/data/4bd42dc27/87bd7180942643e69c8ddff1d00f8897 [2021-11-21 01:02:11,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:02:11,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:02:11,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:02:11,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:02:11,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:02:11,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:02:11" (1/1) ... [2021-11-21 01:02:11,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e31dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:11, skipping insertion in model container [2021-11-21 01:02:11,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:02:11" (1/1) ... [2021-11-21 01:02:11,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:02:11,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:02:12,067 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_34c0df25-1007-4116-a9e0-03f877b828fb/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2021-11-21 01:02:12,076 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:02:12,096 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:02:12,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2021-11-21 01:02:12,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:02:12,198 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:02:12,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:12 WrapperNode [2021-11-21 01:02:12,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:02:12,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:02:12,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:02:12,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:02:12,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:12" (1/1) ... [2021-11-21 01:02:12,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:12" (1/1) ... [2021-11-21 01:02:12,267 INFO L137 Inliner]: procedures = 130, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2021-11-21 01:02:12,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:02:12,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:02:12,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:02:12,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:02:12,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:12" (1/1) ... [2021-11-21 01:02:12,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:12" (1/1) ... [2021-11-21 01:02:12,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:12" (1/1) ... [2021-11-21 01:02:12,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:12" (1/1) ... [2021-11-21 01:02:12,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:12" (1/1) ... [2021-11-21 01:02:12,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:12" (1/1) ... [2021-11-21 01:02:12,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:12" (1/1) ... [2021-11-21 01:02:12,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:02:12,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:02:12,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:02:12,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:02:12,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:12" (1/1) ... [2021-11-21 01:02:12,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:02:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:02:12,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:02:12,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:02:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-21 01:02:12,445 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 01:02:12,445 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 01:02:12,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 01:02:12,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:02:12,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 01:02:12,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 01:02:12,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 01:02:12,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 01:02:12,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-21 01:02:12,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 01:02:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 01:02:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:02:12,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:02:12,592 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:02:12,594 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:02:13,163 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:02:13,182 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:02:13,182 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 01:02:13,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:02:13 BoogieIcfgContainer [2021-11-21 01:02:13,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:02:13,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:02:13,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:02:13,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:02:13,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:02:11" (1/3) ... [2021-11-21 01:02:13,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20072aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:02:13, skipping insertion in model container [2021-11-21 01:02:13,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:02:12" (2/3) ... [2021-11-21 01:02:13,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20072aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:02:13, skipping insertion in model container [2021-11-21 01:02:13,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:02:13" (3/3) ... [2021-11-21 01:02:13,193 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2021-11-21 01:02:13,198 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:02:13,199 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2021-11-21 01:02:13,243 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:02:13,250 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:02:13,251 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2021-11-21 01:02:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:02:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 01:02:13,277 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:02:13,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:02:13,278 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:02:13,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:02:13,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520441, now seen corresponding path program 1 times [2021-11-21 01:02:13,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:02:13,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843695316] [2021-11-21 01:02:13,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:02:13,298 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:02:13,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:02:13,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:02:13,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 01:02:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:02:13,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 01:02:13,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:02:13,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:02:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:02:13,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:02:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:02:13,579 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:02:13,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843695316] [2021-11-21 01:02:13,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843695316] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:02:13,580 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:02:13,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 01:02:13,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066122361] [2021-11-21 01:02:13,584 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:02:13,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:02:13,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:02:13,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:02:13,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:02:13,628 INFO L87 Difference]: Start difference. First operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:02:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:02:13,847 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2021-11-21 01:02:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:02:13,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-21 01:02:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:02:13,858 INFO L225 Difference]: With dead ends: 94 [2021-11-21 01:02:13,859 INFO L226 Difference]: Without dead ends: 91 [2021-11-21 01:02:13,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:02:13,864 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:02:13,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:02:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-11-21 01:02:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-11-21 01:02:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:02:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2021-11-21 01:02:13,908 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 7 [2021-11-21 01:02:13,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:02:13,909 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2021-11-21 01:02:13,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:02:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2021-11-21 01:02:13,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 01:02:13,910 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:02:13,911 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:02:13,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:02:14,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:02:14,123 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:02:14,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:02:14,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520442, now seen corresponding path program 1 times [2021-11-21 01:02:14,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:02:14,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556749646] [2021-11-21 01:02:14,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:02:14,126 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:02:14,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:02:14,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:02:14,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 01:02:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:02:14,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 01:02:14,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:02:14,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:02:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:02:14,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:02:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:02:14,388 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:02:14,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556749646] [2021-11-21 01:02:14,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556749646] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:02:14,394 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:02:14,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-21 01:02:14,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693829819] [2021-11-21 01:02:14,396 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:02:14,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:02:14,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:02:14,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:02:14,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:02:14,402 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:02:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:02:14,803 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2021-11-21 01:02:14,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:02:14,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-21 01:02:14,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:02:14,807 INFO L225 Difference]: With dead ends: 89 [2021-11-21 01:02:14,807 INFO L226 Difference]: Without dead ends: 89 [2021-11-21 01:02:14,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:02:14,809 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-21 01:02:14,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-21 01:02:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-21 01:02:14,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-11-21 01:02:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:02:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2021-11-21 01:02:14,823 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 7 [2021-11-21 01:02:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:02:14,823 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2021-11-21 01:02:14,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:02:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2021-11-21 01:02:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:02:14,825 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:02:14,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:02:14,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:02:15,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:02:15,039 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:02:15,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:02:15,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468992, now seen corresponding path program 1 times [2021-11-21 01:02:15,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:02:15,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144287435] [2021-11-21 01:02:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:02:15,042 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:02:15,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:02:15,043 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:02:15,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 01:02:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:02:15,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 01:02:15,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:02:15,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:02:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:02:15,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:02:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:02:15,370 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:02:15,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144287435] [2021-11-21 01:02:15,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144287435] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:02:15,371 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:02:15,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-21 01:02:15,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743118455] [2021-11-21 01:02:15,371 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:02:15,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:02:15,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:02:15,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:02:15,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:02:15,374 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:02:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:02:15,892 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2021-11-21 01:02:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:02:15,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-11-21 01:02:15,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:02:15,897 INFO L225 Difference]: With dead ends: 93 [2021-11-21 01:02:15,897 INFO L226 Difference]: Without dead ends: 93 [2021-11-21 01:02:15,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:02:15,899 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 10 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-21 01:02:15,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 309 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-21 01:02:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-21 01:02:15,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2021-11-21 01:02:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:02:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2021-11-21 01:02:15,930 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 13 [2021-11-21 01:02:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:02:15,931 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2021-11-21 01:02:15,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:02:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2021-11-21 01:02:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:02:15,932 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:02:15,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:02:15,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 01:02:16,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:02:16,150 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:02:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:02:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468991, now seen corresponding path program 1 times [2021-11-21 01:02:16,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:02:16,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291133483] [2021-11-21 01:02:16,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:02:16,152 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:02:16,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:02:16,154 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:02:16,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 01:02:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:02:16,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 01:02:16,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:02:16,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:02:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:02:16,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:02:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:02:16,976 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:02:16,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291133483] [2021-11-21 01:02:16,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291133483] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:02:16,976 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:02:16,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-21 01:02:16,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988188730] [2021-11-21 01:02:16,977 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:02:16,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 01:02:16,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:02:16,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 01:02:16,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-21 01:02:16,979 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:02:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:02:18,001 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2021-11-21 01:02:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:02:18,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-11-21 01:02:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:02:18,005 INFO L225 Difference]: With dead ends: 92 [2021-11-21 01:02:18,005 INFO L226 Difference]: Without dead ends: 92 [2021-11-21 01:02:18,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-21 01:02:18,007 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 18 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:02:18,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 383 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-21 01:02:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-21 01:02:18,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2021-11-21 01:02:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:02:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-11-21 01:02:18,020 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 13 [2021-11-21 01:02:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:02:18,020 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-11-21 01:02:18,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:02:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-11-21 01:02:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 01:02:18,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:02:18,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:02:18,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 01:02:18,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:02:18,235 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:02:18,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:02:18,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295936, now seen corresponding path program 1 times [2021-11-21 01:02:18,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:02:18,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645926825] [2021-11-21 01:02:18,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:02:18,237 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:02:18,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:02:18,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:02:18,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-21 01:02:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:02:18,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 01:02:18,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:02:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:02:18,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:02:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:02:18,459 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:02:18,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645926825] [2021-11-21 01:02:18,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645926825] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:02:18,459 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:02:18,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 01:02:18,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600875849] [2021-11-21 01:02:18,460 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:02:18,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:02:18,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:02:18,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:02:18,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:02:18,462 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:02:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:02:18,483 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2021-11-21 01:02:18,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 01:02:18,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-11-21 01:02:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:02:18,485 INFO L225 Difference]: With dead ends: 94 [2021-11-21 01:02:18,485 INFO L226 Difference]: Without dead ends: 94 [2021-11-21 01:02:18,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:02:18,487 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 8 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:02:18,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 271 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:02:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-21 01:02:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-11-21 01:02:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:02:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-11-21 01:02:18,499 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 15 [2021-11-21 01:02:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:02:18,500 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-11-21 01:02:18,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:02:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2021-11-21 01:02:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-21 01:02:18,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:02:18,503 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:02:18,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-21 01:02:18,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:02:18,710 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:02:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:02:18,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092864, now seen corresponding path program 1 times [2021-11-21 01:02:18,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:02:18,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840955407] [2021-11-21 01:02:18,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:02:18,712 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:02:18,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:02:18,718 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:02:18,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-21 01:02:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:02:18,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-21 01:02:18,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:02:18,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:02:18,984 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 16 treesize of output 14 [2021-11-21 01:02:19,253 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 01:02:19,254 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 25 treesize of output 32 [2021-11-21 01:02:19,573 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:02:19,573 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-21 01:02:19,878 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 01:02:19,878 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-21 01:02:21,003 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 01:02:21,004 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 59 treesize of output 70 [2021-11-21 01:02:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:02:21,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:03:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 6 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:03:11,119 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:03:11,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840955407] [2021-11-21 01:03:11,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840955407] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:03:11,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1850717616] [2021-11-21 01:03:11,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:03:11,120 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:03:11,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:03:11,135 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:03:11,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-21 01:03:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:03:11,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-21 01:03:11,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:03:11,536 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-21 01:03:11,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2021-11-21 01:03:11,764 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:03:11,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2021-11-21 01:03:16,240 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 01:03:16,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 37 [2021-11-21 01:03:16,816 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-21 01:03:16,817 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-21 01:03:29,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:03:29,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:03:29,573 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-21 01:03:29,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2021-11-21 01:03:30,789 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-21 01:03:30,790 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 38 treesize of output 32 [2021-11-21 01:03:35,385 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-21 01:03:35,386 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 57 treesize of output 74 [2021-11-21 01:03:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-21 01:03:38,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:04:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-21 01:04:19,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1850717616] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 01:04:19,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:04:19,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 10, 11] total 33 [2021-11-21 01:04:19,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418435813] [2021-11-21 01:04:19,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:04:19,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 01:04:19,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:04:19,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 01:04:19,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=915, Unknown=36, NotChecked=0, Total=1122 [2021-11-21 01:04:19,158 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:04:19,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:04:19,385 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-11-21 01:04:19,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 01:04:19,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2021-11-21 01:04:19,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:04:19,387 INFO L225 Difference]: With dead ends: 103 [2021-11-21 01:04:19,388 INFO L226 Difference]: Without dead ends: 103 [2021-11-21 01:04:19,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 117 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 108.6s TimeCoverageRelationStatistics Valid=171, Invalid=915, Unknown=36, NotChecked=0, Total=1122 [2021-11-21 01:04:19,390 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 69 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:04:19,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 169 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 98 Unchecked, 0.2s Time] [2021-11-21 01:04:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-21 01:04:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2021-11-21 01:04:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 86 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:04:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2021-11-21 01:04:19,400 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 41 [2021-11-21 01:04:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:04:19,401 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2021-11-21 01:04:19,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:04:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2021-11-21 01:04:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-21 01:04:19,403 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:04:19,403 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:04:19,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-21 01:04:19,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-21 01:04:19,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt [2021-11-21 01:04:19,819 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:04:19,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:04:19,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092863, now seen corresponding path program 1 times [2021-11-21 01:04:19,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:04:19,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33972061] [2021-11-21 01:04:19,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:04:19,821 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:04:19,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:04:19,824 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:04:19,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-21 01:04:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:04:20,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 01:04:20,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:04:20,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:04:20,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:04:20,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-11-21 01:04:20,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-21 01:04:20,515 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:04:20,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-11-21 01:04:20,530 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:04:20,531 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 23 [2021-11-21 01:04:20,829 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 01:04:20,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-11-21 01:04:21,251 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 01:04:21,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2021-11-21 01:04:22,529 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-21 01:04:22,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 36 [2021-11-21 01:04:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:04:22,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:04:30,761 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_55| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)))) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| .cse0))))) is different from false [2021-11-21 01:04:34,168 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) is different from false [2021-11-21 01:04:57,434 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) is different from true [2021-11-21 01:05:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 20 not checked. [2021-11-21 01:05:58,461 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:05:58,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33972061] [2021-11-21 01:05:58,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33972061] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:05:58,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1686995336] [2021-11-21 01:05:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:05:58,462 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:05:58,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:05:58,463 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:05:58,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-21 01:05:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:05:58,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 01:05:58,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:05:58,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:06:00,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-21 01:06:05,213 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:06:05,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 17 [2021-11-21 01:06:06,141 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:06:06,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2021-11-21 01:06:12,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:06:12,860 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-21 01:06:12,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 25 [2021-11-21 01:06:14,206 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:06:14,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2021-11-21 01:06:18,634 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 01:06:18,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 37 [2021-11-21 01:06:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-21 01:06:19,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:08:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 15 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-21 01:08:46,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1686995336] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:08:46,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439157620] [2021-11-21 01:08:46,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:08:46,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:08:46,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:08:46,654 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:08:46,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-21 01:08:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:08:46,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-21 01:08:46,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:08:46,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:08:46,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:08:52,629 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:08:52,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-11-21 01:08:52,639 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:08:52,639 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 23 [2021-11-21 01:09:00,169 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-11-21 01:09:00,169 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 17 treesize of output 30 [2021-11-21 01:09:03,490 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-11-21 01:09:03,491 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 30 treesize of output 50 [2021-11-21 01:09:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:09:04,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:09:06,949 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|)) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|))))))) is different from false [2021-11-21 01:09:09,502 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_81| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (or (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_81| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|)) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|))))))) is different from false [2021-11-21 01:09:12,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) is different from false [2021-11-21 01:10:10,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))))) is different from false [2021-11-21 01:10:16,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_89| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_89| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_89|))))) is different from false [2021-11-21 01:10:18,037 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_89| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_89| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_89|))))) is different from true [2021-11-21 01:10:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 21 not checked. [2021-11-21 01:10:18,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439157620] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:10:18,131 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 01:10:18,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11, 10, 12, 11] total 56 [2021-11-21 01:10:18,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809621692] [2021-11-21 01:10:18,132 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 01:10:18,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-11-21 01:10:18,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:10:18,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-11-21 01:10:18,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1955, Unknown=101, NotChecked=808, Total=3192 [2021-11-21 01:10:18,137 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 57 states, 52 states have (on average 3.2884615384615383) internal successors, (171), 41 states have internal predecessors, (171), 16 states have call successors, (18), 14 states have call predecessors, (18), 16 states have return successors, (18), 13 states have call predecessors, (18), 16 states have call successors, (18) [2021-11-21 01:10:20,192 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_63| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_63| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_63|))) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_89| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_89| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_89|)))))) is different from false [2021-11-21 01:10:22,217 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|)))) is different from false [2021-11-21 01:10:24,270 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|))) (= (store |c_old(#length)| |c_node_create_#res#1.base| (_ bv8 32)) |c_#length|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|)))) is different from false [2021-11-21 01:10:26,350 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_63| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_63| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_63|))) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= |c_#length| |c_old(#length)|) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_89| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_89| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_89|)))))) is different from false [2021-11-21 01:10:28,396 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|)))) is different from false [2021-11-21 01:10:30,453 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#length)| |c_node_create_#res#1.base| (_ bv8 32)) |c_#length|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|)))) is different from false [2021-11-21 01:11:36,159 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|)) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| .cse0)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_6| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|))))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_54| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| .cse1)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#length)| |c_node_create_#res#1.base| (_ bv8 32)) |c_#length|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|)))) is different from false [2021-11-21 01:11:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:11:36,708 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2021-11-21 01:11:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-21 01:11:36,710 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 52 states have (on average 3.2884615384615383) internal successors, (171), 41 states have internal predecessors, (171), 16 states have call successors, (18), 14 states have call predecessors, (18), 16 states have return successors, (18), 13 states have call predecessors, (18), 16 states have call successors, (18) Word has length 41 [2021-11-21 01:11:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:11:36,711 INFO L225 Difference]: With dead ends: 105 [2021-11-21 01:11:36,711 INFO L226 Difference]: Without dead ends: 105 [2021-11-21 01:11:36,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 180 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 357.3s TimeCoverageRelationStatistics Valid=397, Invalid=2296, Unknown=123, NotChecked=1740, Total=4556 [2021-11-21 01:11:36,715 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 75 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1092 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-21 01:11:36,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 894 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 1092 Unchecked, 0.5s Time] [2021-11-21 01:11:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-21 01:11:36,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2021-11-21 01:11:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 97 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:11:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2021-11-21 01:11:36,724 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 41 [2021-11-21 01:11:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:11:36,725 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2021-11-21 01:11:36,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 52 states have (on average 3.2884615384615383) internal successors, (171), 41 states have internal predecessors, (171), 16 states have call successors, (18), 14 states have call predecessors, (18), 16 states have return successors, (18), 13 states have call predecessors, (18), 16 states have call successors, (18) [2021-11-21 01:11:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2021-11-21 01:11:36,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-21 01:11:36,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:11:36,727 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:11:36,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-21 01:11:36,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-21 01:11:37,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-21 01:11:37,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:11:37,354 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:11:37,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:11:37,355 INFO L85 PathProgramCache]: Analyzing trace with hash 483750338, now seen corresponding path program 1 times [2021-11-21 01:11:37,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:11:37,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489439336] [2021-11-21 01:11:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:11:37,355 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:11:37,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:11:37,356 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:11:37,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-21 01:11:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:11:37,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 01:11:37,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:11:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 01:11:37,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:11:37,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-11-21 01:11:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 01:11:38,098 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:11:38,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489439336] [2021-11-21 01:11:38,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489439336] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:11:38,099 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:11:38,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-21 01:11:38,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139527969] [2021-11-21 01:11:38,100 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:11:38,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 01:11:38,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:11:38,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 01:11:38,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-21 01:11:38,101 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 01:11:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:11:38,327 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2021-11-21 01:11:38,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:11:38,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2021-11-21 01:11:38,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:11:38,329 INFO L225 Difference]: With dead ends: 102 [2021-11-21 01:11:38,330 INFO L226 Difference]: Without dead ends: 102 [2021-11-21 01:11:38,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-21 01:11:38,331 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 404 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:11:38,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 92 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:11:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-11-21 01:11:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-11-21 01:11:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:11:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2021-11-21 01:11:38,339 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 43 [2021-11-21 01:11:38,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:11:38,340 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2021-11-21 01:11:38,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 01:11:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2021-11-21 01:11:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:11:38,342 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:11:38,342 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:11:38,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-21 01:11:38,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:11:38,578 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:11:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:11:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1027607010, now seen corresponding path program 1 times [2021-11-21 01:11:38,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:11:38,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103633972] [2021-11-21 01:11:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:11:38,579 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:11:38,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:11:38,580 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:11:38,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-21 01:11:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:11:38,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 01:11:38,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:11:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 01:11:38,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:11:38,860 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-21 01:11:38,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-11-21 01:11:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 01:11:38,937 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:11:38,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103633972] [2021-11-21 01:11:38,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103633972] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:11:38,937 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:11:38,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-21 01:11:38,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748414066] [2021-11-21 01:11:38,938 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:11:38,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:11:38,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:11:38,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:11:38,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:11:38,939 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:11:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:11:39,194 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2021-11-21 01:11:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-21 01:11:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2021-11-21 01:11:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:11:39,196 INFO L225 Difference]: With dead ends: 112 [2021-11-21 01:11:39,196 INFO L226 Difference]: Without dead ends: 112 [2021-11-21 01:11:39,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-21 01:11:39,197 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 135 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:11:39,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 98 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:11:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-21 01:11:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2021-11-21 01:11:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.463768115942029) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:11:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2021-11-21 01:11:39,205 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 45 [2021-11-21 01:11:39,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:11:39,206 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2021-11-21 01:11:39,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:11:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2021-11-21 01:11:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:11:39,208 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:11:39,208 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:11:39,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-21 01:11:39,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:11:39,418 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:11:39,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:11:39,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1027607011, now seen corresponding path program 1 times [2021-11-21 01:11:39,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:11:39,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489378274] [2021-11-21 01:11:39,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:11:39,419 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:11:39,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:11:39,420 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:11:39,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-21 01:11:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:11:39,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-21 01:11:39,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:11:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 01:11:39,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:11:40,101 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 01:11:40,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2021-11-21 01:11:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 01:11:40,533 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:11:40,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489378274] [2021-11-21 01:11:40,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489378274] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:11:40,533 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:11:40,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-21 01:11:40,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204432970] [2021-11-21 01:11:40,533 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:11:40,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 01:11:40,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:11:40,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 01:11:40,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-21 01:11:40,534 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 01:11:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:11:40,838 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2021-11-21 01:11:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:11:40,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 45 [2021-11-21 01:11:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:11:40,840 INFO L225 Difference]: With dead ends: 98 [2021-11-21 01:11:40,840 INFO L226 Difference]: Without dead ends: 98 [2021-11-21 01:11:40,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-11-21 01:11:40,841 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 133 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 01:11:40,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 104 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-21 01:11:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-21 01:11:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-11-21 01:11:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.434782608695652) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:11:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2021-11-21 01:11:40,852 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 45 [2021-11-21 01:11:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:11:40,853 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2021-11-21 01:11:40,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 01:11:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2021-11-21 01:11:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:11:40,855 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:11:40,855 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:11:40,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-21 01:11:41,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:11:41,062 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 35 more)] === [2021-11-21 01:11:41,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:11:41,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1027760007, now seen corresponding path program 1 times [2021-11-21 01:11:41,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:11:41,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322871214] [2021-11-21 01:11:41,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:11:41,063 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:11:41,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:11:41,064 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:11:41,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-21 01:11:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:11:41,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-21 01:11:41,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:11:41,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:11:41,768 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 13 treesize of output 9 [2021-11-21 01:11:41,786 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 13 treesize of output 9 [2021-11-21 01:11:42,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-11-21 01:11:42,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-21 01:11:47,235 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 01:11:47,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 67 [2021-11-21 01:11:47,291 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-21 01:11:47,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2021-11-21 01:11:47,416 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 01:11:47,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 55 [2021-11-21 01:11:48,193 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 01:11:48,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 46 [2021-11-21 01:11:48,211 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 01:11:48,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2021-11-21 01:11:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 01:11:49,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:12:05,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (let ((.cse3 (bvadd (_ bv8 32) .cse2))) (and (bvule (bvadd (_ bv4 32) .cse2) .cse3) (bvule .cse3 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))))) is different from false [2021-11-21 01:12:11,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))) (and (forall ((v_DerPreprocessor_4 (_ BitVec 32))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))) (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))))))) is different from false [2021-11-21 01:12:14,449 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))))) (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))))) is different from false [2021-11-21 01:12:20,829 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_120| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120|) .cse1 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_#length| |v_node_create_~temp~0#1.base_120| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_120| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_120|) .cse1 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))) (not (bvult |v_node_create_~temp~0#1.base_120| |c_#StackHeapBarrier|)))) is different from true [2021-11-21 01:12:29,408 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 4521 treesize of output 4485 [2021-11-21 01:12:29,443 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 62652 treesize of output 61616 [2021-11-21 01:12:30,268 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:12:30,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322871214] [2021-11-21 01:12:30,269 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-21 01:12:30,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [584554251] [2021-11-21 01:12:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:12:30,269 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:12:30,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:12:30,270 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:12:30,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-11-21 01:12:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:12:30,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-21 01:12:30,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:12:30,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:12:30,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:12:35,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-11-21 01:12:35,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-21 01:12:51,253 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 01:12:51,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 89 [2021-11-21 01:12:51,385 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 01:12:51,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 82 [2021-11-21 01:12:51,430 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-21 01:12:51,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 79 [2021-11-21 01:12:51,487 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-21 01:12:51,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 63 [2021-11-21 01:12:52,958 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 01:12:52,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 50 [2021-11-21 01:12:52,983 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 01:12:52,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2021-11-21 01:12:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 01:12:54,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:13:10,180 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (let ((.cse1 (bvadd .cse0 (_ bv8 32)))) (and (bvule (bvadd .cse0 (_ bv4 32)) .cse1) (bvule .cse1 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((|v_node_create_~temp~0#1.base_123| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_123| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_123|)))) (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_115| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_115|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_115| (_ BitVec 32))) (not (let ((.cse3 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_115|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_123| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))))))))))) is different from false [2021-11-21 01:13:17,217 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (exists ((|v_node_create_~temp~0#1.base_123| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_123| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_123|)))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) .cse1 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_123| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123|) .cse1 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_115| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_115|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))))))))) is different from false [2021-11-21 01:13:19,227 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (exists ((|v_node_create_~temp~0#1.base_123| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_123| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_123|)))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) .cse1 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_123| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123|) .cse1 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_115| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_115|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))))))))) is different from true [2021-11-21 01:13:22,791 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (exists ((|v_node_create_~temp~0#1.base_123| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_123| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_123|)))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) .cse2 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_123| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123|) .cse2 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_115| (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_115|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))))))) is different from false [2021-11-21 01:13:24,803 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (exists ((|v_node_create_~temp~0#1.base_123| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_123| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_123|)))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) .cse2 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_123| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123|) .cse2 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_115| (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_115|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))))))) is different from true [2021-11-21 01:13:32,740 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_124| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_124| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_124|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_#length| |v_node_create_~temp~0#1.base_124| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_124| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_124|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_124| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_124|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (not (bvult |v_node_create_~temp~0#1.base_124| |c_#StackHeapBarrier|)) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_124|))) (exists ((|v_node_create_~temp~0#1.base_123| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_123| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_123|)))) (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) .cse2 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_123| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_123|) .cse2 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_115| (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_123|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_115|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_115| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))))))) is different from true [2021-11-21 01:13:32,759 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 239 treesize of output 231 [2021-11-21 01:13:32,771 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 567 treesize of output 539 [2021-11-21 01:13:45,891 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 16 treesize of output 14 [2021-11-21 01:13:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2021-11-21 01:13:48,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [584554251] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:13:48,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235433232] [2021-11-21 01:13:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:13:48,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:13:48,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:13:48,663 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:13:48,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34c0df25-1007-4116-a9e0-03f877b828fb/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-21 01:13:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:13:48,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 47 conjunts are in the unsatisfiable core [2021-11-21 01:13:48,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:13:48,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:13:49,950 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 01:13:49,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-11-21 01:13:50,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:13:51,698 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-11-21 01:13:51,699 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 5 case distinctions, treesize of input 45 treesize of output 62 [2021-11-21 01:13:59,231 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset|))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= |c_#memory_$Pointer$.base| (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|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset|))))))) is different from true [2021-11-21 01:13:59,562 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 01:13:59,563 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 150 treesize of output 130 [2021-11-21 01:13:59,683 INFO L354 Elim1Store]: treesize reduction 44, result has 27.9 percent of original size [2021-11-21 01:13:59,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 143 [2021-11-21 01:13:59,753 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-21 01:13:59,754 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 72 treesize of output 74 [2021-11-21 01:13:59,858 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 01:13:59,858 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 71 treesize of output 63 [2021-11-21 01:14:00,770 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 01:14:00,770 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 74 treesize of output 52 [2021-11-21 01:14:00,780 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 01:14:00,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2021-11-21 01:14:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-21 01:14:04,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:14:07,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_135| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_135|))))) (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_126| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_126|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_135| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_135|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_10)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (select (store |c_#length| |v_node_create_~temp~0#1.base_135| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_135| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_135|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_9)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_126| (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_135| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_135|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_126|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_10)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))))) is different from false [2021-11-21 01:14:10,403 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_135| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_126| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_126|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_135| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_126| (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_126|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_135|))))))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (let ((.cse3 (bvadd .cse2 (_ bv8 32)))) (and (bvule (bvadd .cse2 (_ bv4 32)) .cse3) (bvule .cse3 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)))))))) is different from false [2021-11-21 01:14:16,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)))) (forall ((v_DerPreprocessor_11 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (exists ((|v_node_create_~temp~0#1.base_135| (_ BitVec 32))) (and (or (exists ((v_prenex_10 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) (bvadd (_ bv4 32) v_prenex_10) (_ bv0 32)) v_prenex_10 v_prenex_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_126| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_126|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_135| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_135|))))))))) is different from false [2021-11-21 01:14:18,232 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)))) (forall ((v_DerPreprocessor_11 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (exists ((|v_node_create_~temp~0#1.base_135| (_ BitVec 32))) (and (or (exists ((v_prenex_10 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) (bvadd (_ bv4 32) v_prenex_10) (_ bv0 32)) v_prenex_10 v_prenex_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_126| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_126|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_135| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_135|))))))))) is different from true [2021-11-21 01:14:21,394 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse1 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse1 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)))))) (exists ((|v_node_create_~temp~0#1.base_135| (_ BitVec 32))) (and (or (exists ((v_prenex_10 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) (bvadd (_ bv4 32) v_prenex_10) (_ bv0 32)) v_prenex_10 v_prenex_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_126| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (not (let ((.cse3 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_126|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_135| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_135|))))))))) is different from false [2021-11-21 01:14:23,411 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse1 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse1 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)))))) (exists ((|v_node_create_~temp~0#1.base_135| (_ BitVec 32))) (and (or (exists ((v_prenex_10 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) (bvadd (_ bv4 32) v_prenex_10) (_ bv0 32)) v_prenex_10 v_prenex_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_126| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (not (let ((.cse3 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_126|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_135| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_135|))))))))) is different from true [2021-11-21 01:14:29,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_136| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_135| (_ BitVec 32))) (and (or (exists ((v_prenex_10 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32))) (not (let ((.cse0 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) (bvadd (_ bv4 32) v_prenex_10) (_ bv0 32)) v_prenex_10 v_prenex_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_126| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_126|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) .cse1 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_135| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135|) .cse1 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_135|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_136|)))) (and (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_136| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_136|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))) (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse3 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_136| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_136|) .cse3 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_#length| |v_node_create_~temp~0#1.base_136| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_136| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_136|) .cse3 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)))))))) is different from false [2021-11-21 01:14:31,870 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_136| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_135| (_ BitVec 32))) (and (or (exists ((v_prenex_10 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32))) (not (let ((.cse0 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) (bvadd (_ bv4 32) v_prenex_10) (_ bv0 32)) v_prenex_10 v_prenex_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (exists ((v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_126| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_126|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_135|) .cse1 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_135| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_135|) .cse1 (_ bv0 32)) |v_node_create_~temp~0#1.offset_126| v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_135|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_136|)))) (and (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_136| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_136|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))) (forall ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse3 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_136| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_136|) .cse3 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_11)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)) (select (store |c_#length| |v_node_create_~temp~0#1.base_136| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_136| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_136|) .cse3 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_12)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_16|)))))))) is different from true [2021-11-21 01:14:31,886 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 237 treesize of output 229 [2021-11-21 01:14:31,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 1069 treesize of output 1025