./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8 --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 b6c3d2366b1caeb6e7a3192ace7ebb6cdc580141 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8 --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 b6c3d2366b1caeb6e7a3192ace7ebb6cdc580141 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 06:47:04,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 06:47:04,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 06:47:04,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 06:47:04,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 06:47:04,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 06:47:04,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 06:47:04,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 06:47:04,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 06:47:04,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 06:47:04,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 06:47:04,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 06:47:04,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 06:47:04,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 06:47:04,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 06:47:04,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 06:47:04,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 06:47:04,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 06:47:04,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 06:47:04,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 06:47:04,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 06:47:04,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 06:47:04,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 06:47:04,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 06:47:04,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 06:47:04,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 06:47:04,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 06:47:04,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 06:47:04,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 06:47:04,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 06:47:04,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 06:47:04,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 06:47:04,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 06:47:04,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 06:47:04,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 06:47:04,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 06:47:04,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 06:47:04,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 06:47:04,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 06:47:04,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 06:47:04,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 06:47:04,387 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-13 06:47:04,413 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 06:47:04,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 06:47:04,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 06:47:04,414 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 06:47:04,415 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 06:47:04,415 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 06:47:04,415 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 06:47:04,415 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 06:47:04,416 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 06:47:04,416 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 06:47:04,416 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 06:47:04,416 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 06:47:04,416 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 06:47:04,417 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 06:47:04,417 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 06:47:04,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 06:47:04,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 06:47:04,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 06:47:04,418 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 06:47:04,419 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 06:47:04,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 06:47:04,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 06:47:04,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 06:47:04,420 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 06:47:04,420 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 06:47:04,420 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 06:47:04,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 06:47:04,420 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 06:47:04,421 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 06:47:04,421 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 06:47:04,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 06:47:04,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 06:47:04,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:47:04,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 06:47:04,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 06:47:04,422 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 06:47:04,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 06:47:04,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 06:47:04,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 06:47:04,423 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_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/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_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8 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 -> b6c3d2366b1caeb6e7a3192ace7ebb6cdc580141 [2021-10-13 06:47:04,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 06:47:04,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 06:47:04,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 06:47:04,735 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 06:47:04,736 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 06:47:04,737 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2021-10-13 06:47:04,829 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/data/e57d1e4fa/e62935288d2a49cc95e5d7abe7499850/FLAG0383bde9a [2021-10-13 06:47:05,438 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 06:47:05,449 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2021-10-13 06:47:05,471 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/data/e57d1e4fa/e62935288d2a49cc95e5d7abe7499850/FLAG0383bde9a [2021-10-13 06:47:05,763 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/data/e57d1e4fa/e62935288d2a49cc95e5d7abe7499850 [2021-10-13 06:47:05,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 06:47:05,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 06:47:05,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 06:47:05,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 06:47:05,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 06:47:05,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:47:05" (1/1) ... [2021-10-13 06:47:05,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122e70ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:05, skipping insertion in model container [2021-10-13 06:47:05,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:47:05" (1/1) ... [2021-10-13 06:47:05,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 06:47:05,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 06:47:06,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:47:06,352 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 06:47:06,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:47:06,470 INFO L208 MainTranslator]: Completed translation [2021-10-13 06:47:06,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:06 WrapperNode [2021-10-13 06:47:06,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 06:47:06,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 06:47:06,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 06:47:06,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 06:47:06,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:06" (1/1) ... [2021-10-13 06:47:06,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:06" (1/1) ... [2021-10-13 06:47:06,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 06:47:06,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 06:47:06,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 06:47:06,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 06:47:06,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:06" (1/1) ... [2021-10-13 06:47:06,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:06" (1/1) ... [2021-10-13 06:47:06,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:06" (1/1) ... [2021-10-13 06:47:06,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:06" (1/1) ... [2021-10-13 06:47:06,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:06" (1/1) ... [2021-10-13 06:47:06,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:06" (1/1) ... [2021-10-13 06:47:06,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:06" (1/1) ... [2021-10-13 06:47:06,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 06:47:06,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 06:47:06,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 06:47:06,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 06:47:06,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:06" (1/1) ... [2021-10-13 06:47:06,732 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:47:06,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:47:06,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 06:47:06,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 06:47:06,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 06:47:06,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 06:47:06,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 06:47:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 06:47:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 06:47:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 06:47:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 06:47:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 06:47:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 06:47:06,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 06:47:09,072 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 06:47:09,073 INFO L299 CfgBuilder]: Removed 47 assume(true) statements. [2021-10-13 06:47:09,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:47:09 BoogieIcfgContainer [2021-10-13 06:47:09,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 06:47:09,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 06:47:09,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 06:47:09,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 06:47:09,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:47:05" (1/3) ... [2021-10-13 06:47:09,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4984e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:47:09, skipping insertion in model container [2021-10-13 06:47:09,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:47:06" (2/3) ... [2021-10-13 06:47:09,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4984e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:47:09, skipping insertion in model container [2021-10-13 06:47:09,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:47:09" (3/3) ... [2021-10-13 06:47:09,090 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2021-10-13 06:47:09,096 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 06:47:09,096 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 485 error locations. [2021-10-13 06:47:09,155 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 06:47:09,164 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, mConcurrency=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-10-13 06:47:09,165 INFO L340 AbstractCegarLoop]: Starting to check reachability of 485 error locations. [2021-10-13 06:47:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 820 states, 334 states have (on average 2.6167664670658684) internal successors, (874), 819 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 06:47:09,212 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:09,213 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 06:47:09,213 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:09,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:09,220 INFO L82 PathProgramCache]: Analyzing trace with hash 40428, now seen corresponding path program 1 times [2021-10-13 06:47:09,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:09,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107793506] [2021-10-13 06:47:09,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:09,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:47:09,373 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:09,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107793506] [2021-10-13 06:47:09,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107793506] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:09,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:09,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 06:47:09,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130091114] [2021-10-13 06:47:09,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:47:09,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:09,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:47:09,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:47:09,405 INFO L87 Difference]: Start difference. First operand has 820 states, 334 states have (on average 2.6167664670658684) internal successors, (874), 819 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:10,350 INFO L93 Difference]: Finished difference Result 1022 states and 1086 transitions. [2021-10-13 06:47:10,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:47:10,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-13 06:47:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:10,377 INFO L225 Difference]: With dead ends: 1022 [2021-10-13 06:47:10,377 INFO L226 Difference]: Without dead ends: 1021 [2021-10-13 06:47:10,379 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:47:10,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2021-10-13 06:47:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 890. [2021-10-13 06:47:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 408 states have (on average 2.549019607843137) internal successors, (1040), 889 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1040 transitions. [2021-10-13 06:47:10,490 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1040 transitions. Word has length 2 [2021-10-13 06:47:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:10,490 INFO L470 AbstractCegarLoop]: Abstraction has 890 states and 1040 transitions. [2021-10-13 06:47:10,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1040 transitions. [2021-10-13 06:47:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 06:47:10,491 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:10,491 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 06:47:10,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 06:47:10,492 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:10,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:10,493 INFO L82 PathProgramCache]: Analyzing trace with hash 40429, now seen corresponding path program 1 times [2021-10-13 06:47:10,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:10,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722357284] [2021-10-13 06:47:10,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:10,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:47:10,589 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:10,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722357284] [2021-10-13 06:47:10,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722357284] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:10,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:10,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 06:47:10,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149637461] [2021-10-13 06:47:10,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:47:10,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:10,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:47:10,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:47:10,593 INFO L87 Difference]: Start difference. First operand 890 states and 1040 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:11,251 INFO L93 Difference]: Finished difference Result 890 states and 1041 transitions. [2021-10-13 06:47:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:47:11,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-13 06:47:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:11,257 INFO L225 Difference]: With dead ends: 890 [2021-10-13 06:47:11,258 INFO L226 Difference]: Without dead ends: 890 [2021-10-13 06:47:11,258 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:47:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2021-10-13 06:47:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2021-10-13 06:47:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 408 states have (on average 2.5441176470588234) internal successors, (1038), 887 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1038 transitions. [2021-10-13 06:47:11,299 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1038 transitions. Word has length 2 [2021-10-13 06:47:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:11,300 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1038 transitions. [2021-10-13 06:47:11,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1038 transitions. [2021-10-13 06:47:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 06:47:11,300 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:11,300 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 06:47:11,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 06:47:11,301 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1282379395, now seen corresponding path program 1 times [2021-10-13 06:47:11,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:11,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145802642] [2021-10-13 06:47:11,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:11,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:11,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-10-13 06:47:11,387 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:11,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145802642] [2021-10-13 06:47:11,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145802642] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:11,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:11,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:47:11,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223749753] [2021-10-13 06:47:11,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:47:11,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:47:11,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:47:11,389 INFO L87 Difference]: Start difference. First operand 888 states and 1038 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:12,167 INFO L93 Difference]: Finished difference Result 951 states and 1016 transitions. [2021-10-13 06:47:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:47:12,168 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-13 06:47:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:12,173 INFO L225 Difference]: With dead ends: 951 [2021-10-13 06:47:12,174 INFO L226 Difference]: Without dead ends: 951 [2021-10-13 06:47:12,174 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:47:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2021-10-13 06:47:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 818. [2021-10-13 06:47:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 408 states have (on average 2.372549019607843) internal successors, (968), 817 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 968 transitions. [2021-10-13 06:47:12,198 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 968 transitions. Word has length 6 [2021-10-13 06:47:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:12,198 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 968 transitions. [2021-10-13 06:47:12,199 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 968 transitions. [2021-10-13 06:47:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 06:47:12,200 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:12,200 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 06:47:12,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 06:47:12,201 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:12,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1282379394, now seen corresponding path program 1 times [2021-10-13 06:47:12,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:12,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739970673] [2021-10-13 06:47:12,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:12,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:47:12,294 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:12,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739970673] [2021-10-13 06:47:12,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739970673] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:12,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:12,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:47:12,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367462280] [2021-10-13 06:47:12,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:47:12,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:12,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:47:12,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:47:12,301 INFO L87 Difference]: Start difference. First operand 818 states and 968 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:12,893 INFO L93 Difference]: Finished difference Result 750 states and 901 transitions. [2021-10-13 06:47:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:47:12,893 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-13 06:47:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:12,897 INFO L225 Difference]: With dead ends: 750 [2021-10-13 06:47:12,897 INFO L226 Difference]: Without dead ends: 750 [2021-10-13 06:47:12,898 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:47:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-10-13 06:47:12,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2021-10-13 06:47:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 408 states have (on average 2.200980392156863) internal successors, (898), 747 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 898 transitions. [2021-10-13 06:47:12,916 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 898 transitions. Word has length 6 [2021-10-13 06:47:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:12,916 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 898 transitions. [2021-10-13 06:47:12,916 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 898 transitions. [2021-10-13 06:47:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 06:47:12,917 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:12,917 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:47:12,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 06:47:12,918 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:12,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1099055580, now seen corresponding path program 1 times [2021-10-13 06:47:12,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:12,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829497407] [2021-10-13 06:47:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:12,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:47:12,998 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:12,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829497407] [2021-10-13 06:47:12,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829497407] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:12,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:12,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:47:12,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359328457] [2021-10-13 06:47:12,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:47:13,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:13,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:47:13,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:47:13,001 INFO L87 Difference]: Start difference. First operand 748 states and 898 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:14,129 INFO L93 Difference]: Finished difference Result 780 states and 845 transitions. [2021-10-13 06:47:14,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:47:14,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 06:47:14,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:14,135 INFO L225 Difference]: With dead ends: 780 [2021-10-13 06:47:14,135 INFO L226 Difference]: Without dead ends: 780 [2021-10-13 06:47:14,135 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:47:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-10-13 06:47:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 648. [2021-10-13 06:47:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 408 states have (on average 1.9534313725490196) internal successors, (797), 647 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 797 transitions. [2021-10-13 06:47:14,152 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 797 transitions. Word has length 7 [2021-10-13 06:47:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:14,153 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 797 transitions. [2021-10-13 06:47:14,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 797 transitions. [2021-10-13 06:47:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 06:47:14,154 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:14,154 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:47:14,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 06:47:14,154 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:14,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:14,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1099055581, now seen corresponding path program 1 times [2021-10-13 06:47:14,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:14,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295441976] [2021-10-13 06:47:14,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:14,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:47:14,259 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:14,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295441976] [2021-10-13 06:47:14,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295441976] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:14,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:14,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:47:14,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641554052] [2021-10-13 06:47:14,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:47:14,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:14,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:47:14,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:47:14,269 INFO L87 Difference]: Start difference. First operand 648 states and 797 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:14,995 INFO L93 Difference]: Finished difference Result 682 states and 747 transitions. [2021-10-13 06:47:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:47:14,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 06:47:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:14,999 INFO L225 Difference]: With dead ends: 682 [2021-10-13 06:47:14,999 INFO L226 Difference]: Without dead ends: 682 [2021-10-13 06:47:14,999 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:47:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-10-13 06:47:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 550. [2021-10-13 06:47:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 408 states have (on average 1.713235294117647) internal successors, (699), 549 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 699 transitions. [2021-10-13 06:47:15,014 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 699 transitions. Word has length 7 [2021-10-13 06:47:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:15,014 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 699 transitions. [2021-10-13 06:47:15,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 699 transitions. [2021-10-13 06:47:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 06:47:15,015 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:15,015 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:47:15,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 06:47:15,016 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash 542418554, now seen corresponding path program 1 times [2021-10-13 06:47:15,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:15,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024108263] [2021-10-13 06:47:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:15,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:47:15,142 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:15,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024108263] [2021-10-13 06:47:15,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024108263] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:15,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:15,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 06:47:15,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338610786] [2021-10-13 06:47:15,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 06:47:15,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 06:47:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:47:15,144 INFO L87 Difference]: Start difference. First operand 550 states and 699 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:15,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:15,963 INFO L93 Difference]: Finished difference Result 565 states and 716 transitions. [2021-10-13 06:47:15,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 06:47:15,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-13 06:47:15,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:15,968 INFO L225 Difference]: With dead ends: 565 [2021-10-13 06:47:15,968 INFO L226 Difference]: Without dead ends: 565 [2021-10-13 06:47:15,969 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 61.3ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-10-13 06:47:15,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-10-13 06:47:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 555. [2021-10-13 06:47:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 413 states have (on average 1.7070217917675545) internal successors, (705), 554 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 705 transitions. [2021-10-13 06:47:15,985 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 705 transitions. Word has length 14 [2021-10-13 06:47:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:15,985 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 705 transitions. [2021-10-13 06:47:15,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:15,986 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 705 transitions. [2021-10-13 06:47:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 06:47:15,987 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:15,988 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:47:15,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 06:47:15,988 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:15,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:15,989 INFO L82 PathProgramCache]: Analyzing trace with hash 987317716, now seen corresponding path program 1 times [2021-10-13 06:47:15,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:15,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413092176] [2021-10-13 06:47:15,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:15,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:47:16,191 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:16,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413092176] [2021-10-13 06:47:16,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413092176] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:16,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:16,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 06:47:16,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200798323] [2021-10-13 06:47:16,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 06:47:16,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:16,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 06:47:16,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 06:47:16,196 INFO L87 Difference]: Start difference. First operand 555 states and 705 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:17,439 INFO L93 Difference]: Finished difference Result 689 states and 754 transitions. [2021-10-13 06:47:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 06:47:17,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-13 06:47:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:17,443 INFO L225 Difference]: With dead ends: 689 [2021-10-13 06:47:17,444 INFO L226 Difference]: Without dead ends: 689 [2021-10-13 06:47:17,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 90.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 06:47:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-10-13 06:47:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 557. [2021-10-13 06:47:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 415 states have (on average 1.7036144578313253) internal successors, (707), 556 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 707 transitions. [2021-10-13 06:47:17,458 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 707 transitions. Word has length 15 [2021-10-13 06:47:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:17,458 INFO L470 AbstractCegarLoop]: Abstraction has 557 states and 707 transitions. [2021-10-13 06:47:17,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 707 transitions. [2021-10-13 06:47:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 06:47:17,460 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:17,460 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:47:17,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 06:47:17,460 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1209667245, now seen corresponding path program 1 times [2021-10-13 06:47:17,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:17,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875038873] [2021-10-13 06:47:17,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:17,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:47:17,922 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:17,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875038873] [2021-10-13 06:47:17,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875038873] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:17,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:17,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-13 06:47:17,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828960938] [2021-10-13 06:47:17,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-13 06:47:17,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:17,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-13 06:47:17,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-10-13 06:47:17,924 INFO L87 Difference]: Start difference. First operand 557 states and 707 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:19,990 INFO L93 Difference]: Finished difference Result 885 states and 964 transitions. [2021-10-13 06:47:19,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 06:47:19,991 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 06:47:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:19,996 INFO L225 Difference]: With dead ends: 885 [2021-10-13 06:47:19,996 INFO L226 Difference]: Without dead ends: 885 [2021-10-13 06:47:19,996 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 266.8ms TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2021-10-13 06:47:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2021-10-13 06:47:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 543. [2021-10-13 06:47:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 415 states have (on average 1.6698795180722892) internal successors, (693), 542 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 693 transitions. [2021-10-13 06:47:20,012 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 693 transitions. Word has length 26 [2021-10-13 06:47:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:20,015 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 693 transitions. [2021-10-13 06:47:20,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 693 transitions. [2021-10-13 06:47:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 06:47:20,016 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:20,017 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:47:20,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 06:47:20,017 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:20,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1209667244, now seen corresponding path program 1 times [2021-10-13 06:47:20,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:20,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185851720] [2021-10-13 06:47:20,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:20,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:47:20,516 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:20,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185851720] [2021-10-13 06:47:20,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185851720] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:20,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:20,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 06:47:20,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985403466] [2021-10-13 06:47:20,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 06:47:20,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:20,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 06:47:20,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-13 06:47:20,518 INFO L87 Difference]: Start difference. First operand 543 states and 693 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:22,537 INFO L93 Difference]: Finished difference Result 661 states and 726 transitions. [2021-10-13 06:47:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 06:47:22,537 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 06:47:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:22,541 INFO L225 Difference]: With dead ends: 661 [2021-10-13 06:47:22,541 INFO L226 Difference]: Without dead ends: 661 [2021-10-13 06:47:22,542 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 283.7ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-10-13 06:47:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-10-13 06:47:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 529. [2021-10-13 06:47:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 415 states have (on average 1.636144578313253) internal successors, (679), 528 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 679 transitions. [2021-10-13 06:47:22,555 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 679 transitions. Word has length 26 [2021-10-13 06:47:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:22,556 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 679 transitions. [2021-10-13 06:47:22,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 679 transitions. [2021-10-13 06:47:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-10-13 06:47:22,561 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:22,562 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:47:22,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 06:47:22,562 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:22,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:22,563 INFO L82 PathProgramCache]: Analyzing trace with hash 23661925, now seen corresponding path program 1 times [2021-10-13 06:47:22,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:22,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654198962] [2021-10-13 06:47:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:22,564 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:47:22,686 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:22,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654198962] [2021-10-13 06:47:22,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654198962] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:22,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:22,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:47:22,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492848145] [2021-10-13 06:47:22,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:47:22,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:22,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:47:22,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:47:22,691 INFO L87 Difference]: Start difference. First operand 529 states and 679 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:22,801 INFO L93 Difference]: Finished difference Result 543 states and 693 transitions. [2021-10-13 06:47:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:47:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2021-10-13 06:47:22,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:22,805 INFO L225 Difference]: With dead ends: 543 [2021-10-13 06:47:22,805 INFO L226 Difference]: Without dead ends: 543 [2021-10-13 06:47:22,805 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:47:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-10-13 06:47:22,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2021-10-13 06:47:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 429 states have (on average 1.6153846153846154) internal successors, (693), 542 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 693 transitions. [2021-10-13 06:47:22,818 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 693 transitions. Word has length 141 [2021-10-13 06:47:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:22,820 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 693 transitions. [2021-10-13 06:47:22,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 693 transitions. [2021-10-13 06:47:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-10-13 06:47:22,824 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:22,825 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:47:22,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 06:47:22,825 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:22,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:22,826 INFO L82 PathProgramCache]: Analyzing trace with hash 369862224, now seen corresponding path program 1 times [2021-10-13 06:47:22,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:22,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411398292] [2021-10-13 06:47:22,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:22,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:47:23,179 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:23,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411398292] [2021-10-13 06:47:23,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411398292] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:23,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:23,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-13 06:47:23,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40199754] [2021-10-13 06:47:23,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-13 06:47:23,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:23,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-13 06:47:23,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-13 06:47:23,181 INFO L87 Difference]: Start difference. First operand 543 states and 693 transitions. Second operand has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:24,351 INFO L93 Difference]: Finished difference Result 598 states and 637 transitions. [2021-10-13 06:47:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 06:47:24,352 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2021-10-13 06:47:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:24,355 INFO L225 Difference]: With dead ends: 598 [2021-10-13 06:47:24,356 INFO L226 Difference]: Without dead ends: 598 [2021-10-13 06:47:24,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 153.7ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-10-13 06:47:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-10-13 06:47:24,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 463. [2021-10-13 06:47:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 349 states have (on average 1.67621776504298) internal successors, (585), 462 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 585 transitions. [2021-10-13 06:47:24,368 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 585 transitions. Word has length 154 [2021-10-13 06:47:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:24,369 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 585 transitions. [2021-10-13 06:47:24,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 585 transitions. [2021-10-13 06:47:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-13 06:47:24,371 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:24,371 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:47:24,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 06:47:24,371 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:24,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:24,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1863193678, now seen corresponding path program 1 times [2021-10-13 06:47:24,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:24,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278459289] [2021-10-13 06:47:24,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:24,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:47:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:47:36,112 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:47:36,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278459289] [2021-10-13 06:47:36,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278459289] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:47:36,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:47:36,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-10-13 06:47:36,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563277239] [2021-10-13 06:47:36,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-10-13 06:47:36,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:36,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-10-13 06:47:36,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2021-10-13 06:47:36,116 INFO L87 Difference]: Start difference. First operand 463 states and 585 transitions. Second operand has 33 states, 32 states have (on average 5.21875) internal successors, (167), 32 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:47:37,802 INFO L93 Difference]: Finished difference Result 584 states and 622 transitions. [2021-10-13 06:47:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 06:47:37,803 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 5.21875) internal successors, (167), 32 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2021-10-13 06:47:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:47:37,807 INFO L225 Difference]: With dead ends: 584 [2021-10-13 06:47:37,807 INFO L226 Difference]: Without dead ends: 584 [2021-10-13 06:47:37,808 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 53 SyntacticMatches, 29 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 1165.5ms TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2021-10-13 06:47:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-10-13 06:47:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 462. [2021-10-13 06:47:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 354 states have (on average 1.6638418079096045) internal successors, (589), 461 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 589 transitions. [2021-10-13 06:47:37,819 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 589 transitions. Word has length 167 [2021-10-13 06:47:37,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:47:37,819 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 589 transitions. [2021-10-13 06:47:37,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 5.21875) internal successors, (167), 32 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:47:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 589 transitions. [2021-10-13 06:47:37,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-13 06:47:37,822 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:47:37,822 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:47:37,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 06:47:37,823 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr371REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:47:37,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:47:37,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1863193677, now seen corresponding path program 1 times [2021-10-13 06:47:37,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:47:37,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898803515] [2021-10-13 06:47:37,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:47:37,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:47:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:49:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:49:26,541 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:49:26,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898803515] [2021-10-13 06:49:26,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898803515] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:49:26,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:49:26,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-10-13 06:49:26,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279427421] [2021-10-13 06:49:26,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-10-13 06:49:26,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:49:26,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-10-13 06:49:26,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=2415, Unknown=0, NotChecked=0, Total=2970 [2021-10-13 06:49:26,547 INFO L87 Difference]: Start difference. First operand 462 states and 589 transitions. Second operand has 55 states, 54 states have (on average 3.0925925925925926) internal successors, (167), 54 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:49:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:49:31,073 INFO L93 Difference]: Finished difference Result 576 states and 614 transitions. [2021-10-13 06:49:31,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 06:49:31,073 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.0925925925925926) internal successors, (167), 54 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2021-10-13 06:49:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:49:31,078 INFO L225 Difference]: With dead ends: 576 [2021-10-13 06:49:31,078 INFO L226 Difference]: Without dead ends: 576 [2021-10-13 06:49:31,080 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 27 SyntacticMatches, 33 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2613 ImplicationChecksByTransitivity, 3204.7ms TimeCoverageRelationStatistics Valid=710, Invalid=2712, Unknown=0, NotChecked=0, Total=3422 [2021-10-13 06:49:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-10-13 06:49:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 466. [2021-10-13 06:49:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 359 states have (on average 1.6378830083565459) internal successors, (588), 465 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:49:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 588 transitions. [2021-10-13 06:49:31,093 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 588 transitions. Word has length 167 [2021-10-13 06:49:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:49:31,094 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 588 transitions. [2021-10-13 06:49:31,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.0925925925925926) internal successors, (167), 54 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:49:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 588 transitions. [2021-10-13 06:49:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-10-13 06:49:31,097 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:49:31,099 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:49:31,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 06:49:31,099 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:49:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:49:31,100 INFO L82 PathProgramCache]: Analyzing trace with hash 472631344, now seen corresponding path program 1 times [2021-10-13 06:49:31,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:49:31,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461806913] [2021-10-13 06:49:31,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:49:31,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:49:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:49:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:49:31,299 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:49:31,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461806913] [2021-10-13 06:49:31,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461806913] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:49:31,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:49:31,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:49:31,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500317034] [2021-10-13 06:49:31,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:49:31,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:49:31,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:49:31,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:49:31,303 INFO L87 Difference]: Start difference. First operand 466 states and 588 transitions. Second operand has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:49:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:49:31,993 INFO L93 Difference]: Finished difference Result 656 states and 702 transitions. [2021-10-13 06:49:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:49:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2021-10-13 06:49:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:49:32,002 INFO L225 Difference]: With dead ends: 656 [2021-10-13 06:49:32,002 INFO L226 Difference]: Without dead ends: 656 [2021-10-13 06:49:32,005 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:49:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2021-10-13 06:49:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 461. [2021-10-13 06:49:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 359 states have (on average 1.607242339832869) internal successors, (577), 460 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:49:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 577 transitions. [2021-10-13 06:49:32,024 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 577 transitions. Word has length 169 [2021-10-13 06:49:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:49:32,024 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 577 transitions. [2021-10-13 06:49:32,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:49:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 577 transitions. [2021-10-13 06:49:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-10-13 06:49:32,028 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:49:32,028 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:49:32,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 06:49:32,028 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:49:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:49:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash 472631345, now seen corresponding path program 1 times [2021-10-13 06:49:32,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:49:32,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579486883] [2021-10-13 06:49:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:49:32,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:49:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:49:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:49:38,943 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:49:38,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579486883] [2021-10-13 06:49:38,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579486883] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:49:38,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:49:38,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-10-13 06:49:38,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518571662] [2021-10-13 06:49:38,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-10-13 06:49:38,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:49:38,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-10-13 06:49:38,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2021-10-13 06:49:38,947 INFO L87 Difference]: Start difference. First operand 461 states and 577 transitions. Second operand has 35 states, 34 states have (on average 4.970588235294118) internal successors, (169), 34 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:49:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:49:40,767 INFO L93 Difference]: Finished difference Result 678 states and 722 transitions. [2021-10-13 06:49:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 06:49:40,768 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.970588235294118) internal successors, (169), 34 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2021-10-13 06:49:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:49:40,773 INFO L225 Difference]: With dead ends: 678 [2021-10-13 06:49:40,774 INFO L226 Difference]: Without dead ends: 678 [2021-10-13 06:49:40,775 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 19 SyntacticMatches, 62 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1864 ImplicationChecksByTransitivity, 1406.6ms TimeCoverageRelationStatistics Valid=460, Invalid=1346, Unknown=0, NotChecked=0, Total=1806 [2021-10-13 06:49:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-10-13 06:49:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 461. [2021-10-13 06:49:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 359 states have (on average 1.6044568245125348) internal successors, (576), 460 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:49:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 576 transitions. [2021-10-13 06:49:40,790 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 576 transitions. Word has length 169 [2021-10-13 06:49:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:49:40,791 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 576 transitions. [2021-10-13 06:49:40,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.970588235294118) internal successors, (169), 34 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:49:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 576 transitions. [2021-10-13 06:49:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-10-13 06:49:40,794 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:49:40,794 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:49:40,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 06:49:40,795 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr375REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:49:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:49:40,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1067434434, now seen corresponding path program 1 times [2021-10-13 06:49:40,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:49:40,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252451373] [2021-10-13 06:49:40,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:49:40,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:49:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:49:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:49:40,981 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:49:40,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252451373] [2021-10-13 06:49:40,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252451373] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:49:40,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:49:40,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:49:40,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281690109] [2021-10-13 06:49:40,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:49:40,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:49:40,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:49:40,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:49:40,986 INFO L87 Difference]: Start difference. First operand 461 states and 576 transitions. Second operand has 5 states, 4 states have (on average 42.75) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:49:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:49:42,058 INFO L93 Difference]: Finished difference Result 810 states and 867 transitions. [2021-10-13 06:49:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 06:49:42,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 42.75) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2021-10-13 06:49:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:49:42,065 INFO L225 Difference]: With dead ends: 810 [2021-10-13 06:49:42,065 INFO L226 Difference]: Without dead ends: 810 [2021-10-13 06:49:42,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:49:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2021-10-13 06:49:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 461. [2021-10-13 06:49:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 359 states have (on average 1.5905292479108635) internal successors, (571), 460 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:49:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 571 transitions. [2021-10-13 06:49:42,082 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 571 transitions. Word has length 171 [2021-10-13 06:49:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:49:42,082 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 571 transitions. [2021-10-13 06:49:42,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 42.75) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:49:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 571 transitions. [2021-10-13 06:49:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-10-13 06:49:42,086 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:49:42,086 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:49:42,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 06:49:42,086 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:49:42,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:49:42,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1269271748, now seen corresponding path program 1 times [2021-10-13 06:49:42,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:49:42,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203482116] [2021-10-13 06:49:42,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:49:42,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:49:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:49:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:49:59,514 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:49:59,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203482116] [2021-10-13 06:49:59,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203482116] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:49:59,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:49:59,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-10-13 06:49:59,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355615560] [2021-10-13 06:49:59,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-10-13 06:49:59,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:49:59,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-10-13 06:49:59,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=2271, Unknown=0, NotChecked=0, Total=2652 [2021-10-13 06:49:59,519 INFO L87 Difference]: Start difference. First operand 461 states and 571 transitions. Second operand has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 51 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:50:08,925 INFO L93 Difference]: Finished difference Result 694 states and 739 transitions. [2021-10-13 06:50:08,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-13 06:50:08,926 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 51 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2021-10-13 06:50:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:50:08,930 INFO L225 Difference]: With dead ends: 694 [2021-10-13 06:50:08,931 INFO L226 Difference]: Without dead ends: 694 [2021-10-13 06:50:08,933 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 15 SyntacticMatches, 53 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2623 ImplicationChecksByTransitivity, 7297.7ms TimeCoverageRelationStatistics Valid=905, Invalid=4351, Unknown=0, NotChecked=0, Total=5256 [2021-10-13 06:50:08,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2021-10-13 06:50:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 459. [2021-10-13 06:50:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 357 states have (on average 1.5854341736694677) internal successors, (566), 458 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 566 transitions. [2021-10-13 06:50:08,947 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 566 transitions. Word has length 172 [2021-10-13 06:50:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:50:08,948 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 566 transitions. [2021-10-13 06:50:08,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 51 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 566 transitions. [2021-10-13 06:50:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-13 06:50:08,951 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:50:08,951 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:50:08,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 06:50:08,952 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr380REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:50:08,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:50:08,953 INFO L82 PathProgramCache]: Analyzing trace with hash 8085008, now seen corresponding path program 1 times [2021-10-13 06:50:08,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:50:08,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747288575] [2021-10-13 06:50:08,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:50:08,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:50:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:50:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:50:09,112 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:50:09,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747288575] [2021-10-13 06:50:09,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747288575] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:50:09,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:50:09,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:50:09,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378682840] [2021-10-13 06:50:09,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:50:09,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:50:09,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:50:09,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:50:09,117 INFO L87 Difference]: Start difference. First operand 459 states and 566 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:50:09,143 INFO L93 Difference]: Finished difference Result 556 states and 664 transitions. [2021-10-13 06:50:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:50:09,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2021-10-13 06:50:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:50:09,149 INFO L225 Difference]: With dead ends: 556 [2021-10-13 06:50:09,149 INFO L226 Difference]: Without dead ends: 556 [2021-10-13 06:50:09,149 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:50:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-10-13 06:50:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 458. [2021-10-13 06:50:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 356 states have (on average 1.5730337078651686) internal successors, (560), 457 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 560 transitions. [2021-10-13 06:50:09,162 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 560 transitions. Word has length 174 [2021-10-13 06:50:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:50:09,162 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 560 transitions. [2021-10-13 06:50:09,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 560 transitions. [2021-10-13 06:50:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-10-13 06:50:09,165 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:50:09,166 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:50:09,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 06:50:09,166 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr387REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:50:09,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:50:09,167 INFO L82 PathProgramCache]: Analyzing trace with hash -808731296, now seen corresponding path program 1 times [2021-10-13 06:50:09,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:50:09,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401743687] [2021-10-13 06:50:09,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:50:09,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:50:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:50:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:50:09,321 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:50:09,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401743687] [2021-10-13 06:50:09,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401743687] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:50:09,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:50:09,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:50:09,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361628949] [2021-10-13 06:50:09,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:50:09,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:50:09,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:50:09,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:50:09,324 INFO L87 Difference]: Start difference. First operand 458 states and 560 transitions. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:50:09,350 INFO L93 Difference]: Finished difference Result 528 states and 627 transitions. [2021-10-13 06:50:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:50:09,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-10-13 06:50:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:50:09,354 INFO L225 Difference]: With dead ends: 528 [2021-10-13 06:50:09,355 INFO L226 Difference]: Without dead ends: 528 [2021-10-13 06:50:09,355 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:50:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-10-13 06:50:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 456. [2021-10-13 06:50:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 354 states have (on average 1.5564971751412429) internal successors, (551), 455 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 551 transitions. [2021-10-13 06:50:09,367 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 551 transitions. Word has length 176 [2021-10-13 06:50:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:50:09,368 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 551 transitions. [2021-10-13 06:50:09,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 551 transitions. [2021-10-13 06:50:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-13 06:50:09,371 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:50:09,371 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:50:09,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 06:50:09,372 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr394REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:50:09,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:50:09,372 INFO L82 PathProgramCache]: Analyzing trace with hash 212678225, now seen corresponding path program 1 times [2021-10-13 06:50:09,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:50:09,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114075791] [2021-10-13 06:50:09,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:50:09,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:50:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:50:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:50:09,536 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:50:09,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114075791] [2021-10-13 06:50:09,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114075791] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:50:09,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:50:09,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:50:09,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655289539] [2021-10-13 06:50:09,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:50:09,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:50:09,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:50:09,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:50:09,543 INFO L87 Difference]: Start difference. First operand 456 states and 551 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:50:09,568 INFO L93 Difference]: Finished difference Result 493 states and 581 transitions. [2021-10-13 06:50:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:50:09,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2021-10-13 06:50:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:50:09,572 INFO L225 Difference]: With dead ends: 493 [2021-10-13 06:50:09,572 INFO L226 Difference]: Without dead ends: 493 [2021-10-13 06:50:09,573 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:50:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-10-13 06:50:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 453. [2021-10-13 06:50:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 351 states have (on average 1.5356125356125356) internal successors, (539), 452 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:09,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 539 transitions. [2021-10-13 06:50:09,584 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 539 transitions. Word has length 178 [2021-10-13 06:50:09,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:50:09,585 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 539 transitions. [2021-10-13 06:50:09,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 539 transitions. [2021-10-13 06:50:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-10-13 06:50:09,588 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:50:09,588 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:50:09,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 06:50:09,588 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr404REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:50:09,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:50:09,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1757418362, now seen corresponding path program 1 times [2021-10-13 06:50:09,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:50:09,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011309083] [2021-10-13 06:50:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:50:09,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:50:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:50:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:50:09,794 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:50:09,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011309083] [2021-10-13 06:50:09,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011309083] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:50:09,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:50:09,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:50:09,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842024739] [2021-10-13 06:50:09,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:50:09,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:50:09,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:50:09,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:50:09,798 INFO L87 Difference]: Start difference. First operand 453 states and 539 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:50:09,820 INFO L93 Difference]: Finished difference Result 451 states and 526 transitions. [2021-10-13 06:50:09,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:50:09,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-10-13 06:50:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:50:09,825 INFO L225 Difference]: With dead ends: 451 [2021-10-13 06:50:09,825 INFO L226 Difference]: Without dead ends: 451 [2021-10-13 06:50:09,828 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:50:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-10-13 06:50:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2021-10-13 06:50:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 347 states have (on average 1.5100864553314122) internal successors, (524), 448 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 524 transitions. [2021-10-13 06:50:09,840 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 524 transitions. Word has length 180 [2021-10-13 06:50:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:50:09,841 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 524 transitions. [2021-10-13 06:50:09,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 524 transitions. [2021-10-13 06:50:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-13 06:50:09,844 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:50:09,844 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:50:09,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 06:50:09,845 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr417ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:50:09,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:50:09,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1273810777, now seen corresponding path program 1 times [2021-10-13 06:50:09,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:50:09,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045834666] [2021-10-13 06:50:09,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:50:09,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:50:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:50:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:50:16,888 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:50:16,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045834666] [2021-10-13 06:50:16,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045834666] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:50:16,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:50:16,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-13 06:50:16,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507660480] [2021-10-13 06:50:16,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-13 06:50:16,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:50:16,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-13 06:50:16,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2021-10-13 06:50:16,892 INFO L87 Difference]: Start difference. First operand 449 states and 524 transitions. Second operand has 31 states, 30 states have (on average 6.1) internal successors, (183), 30 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:50:18,859 INFO L93 Difference]: Finished difference Result 511 states and 543 transitions. [2021-10-13 06:50:18,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 06:50:18,859 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 6.1) internal successors, (183), 30 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2021-10-13 06:50:18,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:50:18,863 INFO L225 Difference]: With dead ends: 511 [2021-10-13 06:50:18,863 INFO L226 Difference]: Without dead ends: 511 [2021-10-13 06:50:18,864 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 45 SyntacticMatches, 39 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 1426.2ms TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2021-10-13 06:50:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-10-13 06:50:18,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 454. [2021-10-13 06:50:18,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 352 states have (on average 1.5028409090909092) internal successors, (529), 453 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 529 transitions. [2021-10-13 06:50:18,875 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 529 transitions. Word has length 183 [2021-10-13 06:50:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:50:18,876 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 529 transitions. [2021-10-13 06:50:18,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 6.1) internal successors, (183), 30 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 529 transitions. [2021-10-13 06:50:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-10-13 06:50:18,879 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:50:18,880 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:50:18,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 06:50:18,880 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr424REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:50:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:50:18,881 INFO L82 PathProgramCache]: Analyzing trace with hash 823717848, now seen corresponding path program 1 times [2021-10-13 06:50:18,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:50:18,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811306243] [2021-10-13 06:50:18,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:50:18,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:50:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:50:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:50:19,034 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:50:19,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811306243] [2021-10-13 06:50:19,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811306243] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:50:19,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:50:19,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:50:19,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885527331] [2021-10-13 06:50:19,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:50:19,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:50:19,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:50:19,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:50:19,037 INFO L87 Difference]: Start difference. First operand 454 states and 529 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:50:19,055 INFO L93 Difference]: Finished difference Result 424 states and 447 transitions. [2021-10-13 06:50:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:50:19,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-10-13 06:50:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:50:19,059 INFO L225 Difference]: With dead ends: 424 [2021-10-13 06:50:19,060 INFO L226 Difference]: Without dead ends: 424 [2021-10-13 06:50:19,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:50:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-10-13 06:50:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 408. [2021-10-13 06:50:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 306 states have (on average 1.408496732026144) internal successors, (431), 407 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 431 transitions. [2021-10-13 06:50:19,071 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 431 transitions. Word has length 184 [2021-10-13 06:50:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:50:19,071 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 431 transitions. [2021-10-13 06:50:19,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 431 transitions. [2021-10-13 06:50:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-10-13 06:50:19,075 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:50:19,075 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:50:19,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 06:50:19,076 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr484ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:50:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:50:19,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2061825509, now seen corresponding path program 1 times [2021-10-13 06:50:19,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:50:19,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310144221] [2021-10-13 06:50:19,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:50:19,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:50:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:50:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:50:21,464 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:50:21,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310144221] [2021-10-13 06:50:21,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310144221] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:50:21,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:50:21,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 06:50:21,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406116659] [2021-10-13 06:50:21,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 06:50:21,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:50:21,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 06:50:21,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-10-13 06:50:21,467 INFO L87 Difference]: Start difference. First operand 408 states and 431 transitions. Second operand has 13 states, 13 states have (on average 14.307692307692308) internal successors, (186), 13 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:50:22,472 INFO L93 Difference]: Finished difference Result 411 states and 434 transitions. [2021-10-13 06:50:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 06:50:22,473 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.307692307692308) internal successors, (186), 13 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2021-10-13 06:50:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:50:22,475 INFO L225 Difference]: With dead ends: 411 [2021-10-13 06:50:22,475 INFO L226 Difference]: Without dead ends: 411 [2021-10-13 06:50:22,475 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 317.1ms TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2021-10-13 06:50:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-10-13 06:50:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 410. [2021-10-13 06:50:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 308 states have (on average 1.405844155844156) internal successors, (433), 409 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 433 transitions. [2021-10-13 06:50:22,484 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 433 transitions. Word has length 186 [2021-10-13 06:50:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:50:22,484 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 433 transitions. [2021-10-13 06:50:22,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.307692307692308) internal successors, (186), 13 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:50:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 433 transitions. [2021-10-13 06:50:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-13 06:50:22,487 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:50:22,488 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:50:22,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 06:50:22,488 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:50:22,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:50:22,489 INFO L82 PathProgramCache]: Analyzing trace with hash -507926207, now seen corresponding path program 1 times [2021-10-13 06:50:22,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:50:22,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897566249] [2021-10-13 06:50:22,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:50:22,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:50:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:50:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:50:37,754 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:50:37,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897566249] [2021-10-13 06:50:37,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897566249] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:50:37,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021342095] [2021-10-13 06:50:37,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:50:37,755 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:50:37,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:50:37,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:50:37,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 06:50:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:50:40,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 358 conjunts are in the unsatisfiable core [2021-10-13 06:50:40,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:50:40,731 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-10-13 06:50:40,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2021-10-13 06:50:40,781 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-10-13 06:50:41,081 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-10-13 06:50:41,084 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 17 treesize of output 21 [2021-10-13 06:50:41,122 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 14 [2021-10-13 06:50:41,579 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 06:50:41,580 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2021-10-13 06:50:41,720 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-10-13 06:50:41,791 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-10-13 06:50:41,817 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 22 treesize of output 17 [2021-10-13 06:50:41,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 18 [2021-10-13 06:50:41,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:41,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:41,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:41,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:41,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 34 [2021-10-13 06:50:41,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:41,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:41,945 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 23 treesize of output 22 [2021-10-13 06:50:42,280 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:50:42,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 74 [2021-10-13 06:50:42,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:42,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:42,291 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:50:42,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 90 treesize of output 88 [2021-10-13 06:50:42,582 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-10-13 06:50:42,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-10-13 06:50:42,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:42,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:42,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:42,800 INFO L354 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2021-10-13 06:50:42,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 87 [2021-10-13 06:50:42,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:42,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:42,832 INFO L354 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2021-10-13 06:50:42,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 90 [2021-10-13 06:50:43,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:43,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:43,350 INFO L354 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2021-10-13 06:50:43,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 112 [2021-10-13 06:50:43,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:43,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:43,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:43,395 INFO L354 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2021-10-13 06:50:43,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 94 treesize of output 81 [2021-10-13 06:50:43,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:43,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:43,522 INFO L354 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2021-10-13 06:50:43,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 112 [2021-10-13 06:50:43,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:43,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:43,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:43,555 INFO L354 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2021-10-13 06:50:43,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 103 treesize of output 90 [2021-10-13 06:50:43,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 06:50:43,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 25 [2021-10-13 06:50:44,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:44,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 06:50:44,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:44,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:44,179 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-10-13 06:50:44,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 93 treesize of output 71 [2021-10-13 06:50:44,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:44,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:44,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:44,424 INFO L354 Elim1Store]: treesize reduction 93, result has 8.8 percent of original size [2021-10-13 06:50:44,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 108 treesize of output 72 [2021-10-13 06:50:44,644 INFO L354 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-10-13 06:50:44,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-10-13 06:50:44,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:44,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:44,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:44,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:44,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:44,972 INFO L354 Elim1Store]: treesize reduction 138, result has 19.8 percent of original size [2021-10-13 06:50:44,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 114 treesize of output 86 [2021-10-13 06:50:45,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:45,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:45,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:45,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:45,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:45,880 INFO L354 Elim1Store]: treesize reduction 138, result has 19.8 percent of original size [2021-10-13 06:50:45,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 116 treesize of output 99 [2021-10-13 06:50:46,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:46,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:46,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:46,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:46,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:46,072 INFO L354 Elim1Store]: treesize reduction 140, result has 18.6 percent of original size [2021-10-13 06:50:46,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 116 treesize of output 97 [2021-10-13 06:50:46,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:46,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 06:50:46,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:46,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:46,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:46,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:46,781 INFO L354 Elim1Store]: treesize reduction 276, result has 18.1 percent of original size [2021-10-13 06:50:46,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 138 treesize of output 117 [2021-10-13 06:50:47,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:47,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:47,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:47,201 INFO L354 Elim1Store]: treesize reduction 200, result has 8.7 percent of original size [2021-10-13 06:50:47,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 202 treesize of output 106 [2021-10-13 06:50:47,535 INFO L354 Elim1Store]: treesize reduction 148, result has 33.0 percent of original size [2021-10-13 06:50:47,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 93 [2021-10-13 06:50:47,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:47,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:47,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:47,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:47,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:47,882 INFO L354 Elim1Store]: treesize reduction 256, result has 11.4 percent of original size [2021-10-13 06:50:47,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 206 treesize of output 118 [2021-10-13 06:50:48,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:48,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:48,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:48,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:48,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:48,954 INFO L354 Elim1Store]: treesize reduction 256, result has 11.4 percent of original size [2021-10-13 06:50:48,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 204 treesize of output 127 [2021-10-13 06:50:49,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:49,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:49,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:49,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:49,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:49,387 INFO L354 Elim1Store]: treesize reduction 256, result has 11.4 percent of original size [2021-10-13 06:50:49,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 204 treesize of output 127 [2021-10-13 06:50:50,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:50,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 06:50:50,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:50,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:50,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:50,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:50,489 INFO L354 Elim1Store]: treesize reduction 388, result has 17.4 percent of original size [2021-10-13 06:50:50,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 30 case distinctions, treesize of input 284 treesize of output 171 [2021-10-13 06:50:51,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:51,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:51,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:51,906 INFO L354 Elim1Store]: treesize reduction 324, result has 8.0 percent of original size [2021-10-13 06:50:51,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 295 treesize of output 143 [2021-10-13 06:50:52,547 INFO L354 Elim1Store]: treesize reduction 270, result has 32.8 percent of original size [2021-10-13 06:50:52,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 187 treesize of output 273 [2021-10-13 06:50:52,878 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: No corresponding IProgramVar for |v_ULTIMATE.start_append_#t~mem62.offset_135| [2021-10-13 06:50:52,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [203771639] [2021-10-13 06:50:52,926 INFO L159 IcfgInterpreter]: Started Sifa with 186 locations of interest [2021-10-13 06:50:52,926 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:50:52,934 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-13 06:50:52,942 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-13 06:50:52,942 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-13 06:50:53,697 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:50:53,698 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 06:50:53,699 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:50:53,700 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-13 06:50:53,700 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 06:50:53,701 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:50:53,701 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-13 06:50:53,703 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-13 06:50:53,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:53,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:53,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:50:53,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-10-13 06:50:53,737 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:50:53,738 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 06:50:53,739 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:50:53,740 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 06:50:53,740 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-13 06:50:53,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:50:53,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:50:53,754 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:50:53,756 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-13 06:50:53,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-13 06:50:53,757 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:113 [2021-10-13 06:50:53,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 06:50:53,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-10-13 06:50:53,974 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#valid_706| at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.constructTermVarsProc(BasicPredicateFactory.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:81) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.predicate(SymbolicTools.java:174) 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:608) 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:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) 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-10-13 06:50:53,978 INFO L168 Benchmark]: Toolchain (without parser) took 228211.60 ms. Allocated memory was 117.4 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 75.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 90.3 MB. Max. memory is 16.1 GB. [2021-10-13 06:50:53,980 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 117.4 MB. Free memory is still 92.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 06:50:53,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.33 ms. Allocated memory is still 117.4 MB. Free memory was 74.9 MB in the beginning and 81.2 MB in the end (delta: -6.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 06:50:53,982 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.72 ms. Allocated memory is still 117.4 MB. Free memory was 81.2 MB in the beginning and 76.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 06:50:53,982 INFO L168 Benchmark]: Boogie Preprocessor took 130.51 ms. Allocated memory is still 117.4 MB. Free memory was 76.1 MB in the beginning and 71.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 06:50:53,983 INFO L168 Benchmark]: RCFGBuilder took 2355.41 ms. Allocated memory was 117.4 MB in the beginning and 174.1 MB in the end (delta: 56.6 MB). Free memory was 71.2 MB in the beginning and 122.1 MB in the end (delta: -50.9 MB). Peak memory consumption was 63.8 MB. Max. memory is 16.1 GB. [2021-10-13 06:50:53,983 INFO L168 Benchmark]: TraceAbstraction took 224894.39 ms. Allocated memory was 174.1 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 122.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 81.1 MB. Max. memory is 16.1 GB. [2021-10-13 06:50:53,988 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.30 ms. Allocated memory is still 117.4 MB. Free memory is still 92.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 695.33 ms. Allocated memory is still 117.4 MB. Free memory was 74.9 MB in the beginning and 81.2 MB in the end (delta: -6.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 118.72 ms. Allocated memory is still 117.4 MB. Free memory was 81.2 MB in the beginning and 76.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 130.51 ms. Allocated memory is still 117.4 MB. Free memory was 76.1 MB in the beginning and 71.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2355.41 ms. Allocated memory was 117.4 MB in the beginning and 174.1 MB in the end (delta: 56.6 MB). Free memory was 71.2 MB in the beginning and 122.1 MB in the end (delta: -50.9 MB). Peak memory consumption was 63.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 224894.39 ms. Allocated memory was 174.1 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 122.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 81.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#valid_706| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#valid_706|: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-13 06:50:54,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 06:50:57,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 06:50:57,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 06:50:57,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 06:50:57,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 06:50:57,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 06:50:57,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 06:50:57,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 06:50:57,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 06:50:57,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 06:50:57,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 06:50:57,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 06:50:57,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 06:50:57,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 06:50:57,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 06:50:57,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 06:50:57,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 06:50:57,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 06:50:57,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 06:50:57,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 06:50:57,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 06:50:57,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 06:50:57,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 06:50:57,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 06:50:57,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 06:50:57,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 06:50:57,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 06:50:57,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 06:50:57,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 06:50:57,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 06:50:57,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 06:50:57,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 06:50:57,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 06:50:57,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 06:50:57,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 06:50:57,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 06:50:57,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 06:50:57,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 06:50:57,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 06:50:57,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 06:50:57,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 06:50:57,186 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-10-13 06:50:57,230 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 06:50:57,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 06:50:57,239 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 06:50:57,240 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 06:50:57,240 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 06:50:57,241 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 06:50:57,241 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 06:50:57,241 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 06:50:57,242 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 06:50:57,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 06:50:57,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 06:50:57,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 06:50:57,247 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 06:50:57,247 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 06:50:57,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 06:50:57,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 06:50:57,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 06:50:57,248 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 06:50:57,248 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 06:50:57,249 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 06:50:57,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 06:50:57,249 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 06:50:57,249 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 06:50:57,250 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 06:50:57,250 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 06:50:57,250 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 06:50:57,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 06:50:57,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 06:50:57,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 06:50:57,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:50:57,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 06:50:57,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 06:50:57,253 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 06:50:57,253 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 06:50:57,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 06:50:57,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 06:50:57,254 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_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/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_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8 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 -> b6c3d2366b1caeb6e7a3192ace7ebb6cdc580141 [2021-10-13 06:50:57,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 06:50:57,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 06:50:57,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 06:50:57,826 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 06:50:57,827 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 06:50:57,828 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2021-10-13 06:50:57,925 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/data/89ba39049/48f856a1845a4a6aa928bbf32ac11e54/FLAG524282310 [2021-10-13 06:50:58,807 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 06:50:58,807 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2021-10-13 06:50:58,823 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/data/89ba39049/48f856a1845a4a6aa928bbf32ac11e54/FLAG524282310 [2021-10-13 06:50:58,987 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/data/89ba39049/48f856a1845a4a6aa928bbf32ac11e54 [2021-10-13 06:50:58,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 06:50:58,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 06:50:58,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 06:50:58,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 06:50:58,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 06:50:59,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:50:58" (1/1) ... [2021-10-13 06:50:59,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b57f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59, skipping insertion in model container [2021-10-13 06:50:59,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:50:58" (1/1) ... [2021-10-13 06:50:59,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 06:50:59,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 06:50:59,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:50:59,554 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 06:50:59,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:50:59,731 INFO L208 MainTranslator]: Completed translation [2021-10-13 06:50:59,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59 WrapperNode [2021-10-13 06:50:59,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 06:50:59,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 06:50:59,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 06:50:59,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 06:50:59,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59" (1/1) ... [2021-10-13 06:50:59,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59" (1/1) ... [2021-10-13 06:50:59,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 06:50:59,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 06:50:59,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 06:50:59,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 06:50:59,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59" (1/1) ... [2021-10-13 06:50:59,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59" (1/1) ... [2021-10-13 06:50:59,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59" (1/1) ... [2021-10-13 06:50:59,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59" (1/1) ... [2021-10-13 06:50:59,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59" (1/1) ... [2021-10-13 06:50:59,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59" (1/1) ... [2021-10-13 06:51:00,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59" (1/1) ... [2021-10-13 06:51:00,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 06:51:00,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 06:51:00,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 06:51:00,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 06:51:00,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59" (1/1) ... [2021-10-13 06:51:00,035 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:51:00,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:51:00,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 06:51:00,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 06:51:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-10-13 06:51:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 06:51:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 06:51:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 06:51:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 06:51:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-10-13 06:51:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 06:51:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 06:51:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 06:51:00,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 06:51:04,804 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 06:51:04,804 INFO L299 CfgBuilder]: Removed 47 assume(true) statements. [2021-10-13 06:51:04,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:51:04 BoogieIcfgContainer [2021-10-13 06:51:04,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 06:51:04,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 06:51:04,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 06:51:04,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 06:51:04,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:50:58" (1/3) ... [2021-10-13 06:51:04,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77181d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:51:04, skipping insertion in model container [2021-10-13 06:51:04,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:50:59" (2/3) ... [2021-10-13 06:51:04,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77181d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:51:04, skipping insertion in model container [2021-10-13 06:51:04,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:51:04" (3/3) ... [2021-10-13 06:51:04,824 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2021-10-13 06:51:04,831 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 06:51:04,831 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 485 error locations. [2021-10-13 06:51:04,905 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 06:51:04,912 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, mConcurrency=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-10-13 06:51:04,913 INFO L340 AbstractCegarLoop]: Starting to check reachability of 485 error locations. [2021-10-13 06:51:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 902 states, 416 states have (on average 2.3125) internal successors, (962), 901 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 06:51:04,987 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:51:04,987 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 06:51:04,988 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:51:04,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:51:04,995 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-10-13 06:51:05,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:51:05,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9282417] [2021-10-13 06:51:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:51:05,012 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:51:05,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:51:05,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:51:05,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 06:51:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:51:05,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:51:05,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:51:05,308 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-10-13 06:51:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:51:05,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:51:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:51:05,361 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:51:05,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9282417] [2021-10-13 06:51:05,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9282417] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:51:05,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:51:05,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 06:51:05,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73605925] [2021-10-13 06:51:05,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:51:05,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:51:05,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:51:05,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:51:05,411 INFO L87 Difference]: Start difference. First operand has 902 states, 416 states have (on average 2.3125) internal successors, (962), 901 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:51:08,359 INFO L93 Difference]: Finished difference Result 1123 states and 1187 transitions. [2021-10-13 06:51:08,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:51:08,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-13 06:51:08,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:51:08,387 INFO L225 Difference]: With dead ends: 1123 [2021-10-13 06:51:08,388 INFO L226 Difference]: Without dead ends: 1121 [2021-10-13 06:51:08,389 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:51:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-10-13 06:51:08,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 985. [2021-10-13 06:51:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 503 states have (on average 2.256461232604374) internal successors, (1135), 984 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1135 transitions. [2021-10-13 06:51:08,504 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1135 transitions. Word has length 3 [2021-10-13 06:51:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:51:08,505 INFO L470 AbstractCegarLoop]: Abstraction has 985 states and 1135 transitions. [2021-10-13 06:51:08,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1135 transitions. [2021-10-13 06:51:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 06:51:08,507 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:51:08,507 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 06:51:08,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 06:51:08,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:51:08,708 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:51:08,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:51:08,709 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-10-13 06:51:08,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:51:08,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366452359] [2021-10-13 06:51:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:51:08,711 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:51:08,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:51:08,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:51:08,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 06:51:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:51:08,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 06:51:08,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:51:08,808 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-10-13 06:51:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:51:08,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:51:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:51:08,891 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:51:08,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366452359] [2021-10-13 06:51:08,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366452359] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:51:08,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:51:08,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 06:51:08,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288629247] [2021-10-13 06:51:08,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:51:08,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:51:08,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:51:08,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:51:08,895 INFO L87 Difference]: Start difference. First operand 985 states and 1135 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:51:13,531 INFO L93 Difference]: Finished difference Result 1036 states and 1191 transitions. [2021-10-13 06:51:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:51:13,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-13 06:51:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:51:13,545 INFO L225 Difference]: With dead ends: 1036 [2021-10-13 06:51:13,545 INFO L226 Difference]: Without dead ends: 1036 [2021-10-13 06:51:13,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:51:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-10-13 06:51:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 983. [2021-10-13 06:51:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 503 states have (on average 2.2524850894632205) internal successors, (1133), 982 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1133 transitions. [2021-10-13 06:51:13,583 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1133 transitions. Word has length 3 [2021-10-13 06:51:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:51:13,583 INFO L470 AbstractCegarLoop]: Abstraction has 983 states and 1133 transitions. [2021-10-13 06:51:13,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1133 transitions. [2021-10-13 06:51:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 06:51:13,584 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:51:13,585 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:51:13,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 06:51:13,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:51:13,798 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:51:13,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:51:13,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1837144844, now seen corresponding path program 1 times [2021-10-13 06:51:13,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:51:13,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709993508] [2021-10-13 06:51:13,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:51:13,801 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:51:13,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:51:13,804 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:51:13,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 06:51:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:51:13,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:51:13,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:51:13,936 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-10-13 06:51:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:51:13,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:51:13,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-10-13 06:51:13,975 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:51:13,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709993508] [2021-10-13 06:51:13,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709993508] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:51:13,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:51:13,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 06:51:13,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594694228] [2021-10-13 06:51:13,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:51:13,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:51:13,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:51:13,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:51:13,983 INFO L87 Difference]: Start difference. First operand 983 states and 1133 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:51:16,576 INFO L93 Difference]: Finished difference Result 1052 states and 1117 transitions. [2021-10-13 06:51:16,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:51:16,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 06:51:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:51:16,583 INFO L225 Difference]: With dead ends: 1052 [2021-10-13 06:51:16,584 INFO L226 Difference]: Without dead ends: 1052 [2021-10-13 06:51:16,584 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:51:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2021-10-13 06:51:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 913. [2021-10-13 06:51:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 503 states have (on average 2.113320079522863) internal successors, (1063), 912 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1063 transitions. [2021-10-13 06:51:16,613 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1063 transitions. Word has length 9 [2021-10-13 06:51:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:51:16,614 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 1063 transitions. [2021-10-13 06:51:16,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1063 transitions. [2021-10-13 06:51:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 06:51:16,615 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:51:16,615 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:51:16,628 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-10-13 06:51:16,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:51:16,830 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:51:16,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:51:16,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1837144845, now seen corresponding path program 1 times [2021-10-13 06:51:16,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:51:16,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980646781] [2021-10-13 06:51:16,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:51:16,836 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:51:16,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:51:16,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:51:16,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 06:51:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:51:16,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 06:51:16,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:51:16,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-10-13 06:51:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:51:17,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:51:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:51:17,102 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:51:17,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980646781] [2021-10-13 06:51:17,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980646781] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:51:17,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:51:17,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 06:51:17,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298955031] [2021-10-13 06:51:17,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:51:17,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:51:17,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:51:17,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:51:17,105 INFO L87 Difference]: Start difference. First operand 913 states and 1063 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:51:20,049 INFO L93 Difference]: Finished difference Result 846 states and 997 transitions. [2021-10-13 06:51:20,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:51:20,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 06:51:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:51:20,057 INFO L225 Difference]: With dead ends: 846 [2021-10-13 06:51:20,057 INFO L226 Difference]: Without dead ends: 846 [2021-10-13 06:51:20,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:51:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-10-13 06:51:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 843. [2021-10-13 06:51:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 503 states have (on average 1.974155069582505) internal successors, (993), 842 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 993 transitions. [2021-10-13 06:51:20,083 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 993 transitions. Word has length 9 [2021-10-13 06:51:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:51:20,084 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 993 transitions. [2021-10-13 06:51:20,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 993 transitions. [2021-10-13 06:51:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 06:51:20,085 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:51:20,085 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:51:20,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-13 06:51:20,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:51:20,299 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:51:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:51:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1116915317, now seen corresponding path program 1 times [2021-10-13 06:51:20,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:51:20,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113678710] [2021-10-13 06:51:20,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:51:20,302 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:51:20,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:51:20,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:51:20,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-13 06:51:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:51:20,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 06:51:20,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:51:20,469 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-10-13 06:51:20,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, 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-10-13 06:51:20,647 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-13 06:51:20,647 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-10-13 06:51:20,656 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-13 06:51:20,657 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-10-13 06:51:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:51:20,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:51:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:51:21,445 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:51:21,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113678710] [2021-10-13 06:51:21,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113678710] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:51:21,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:51:21,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-10-13 06:51:21,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472475976] [2021-10-13 06:51:21,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 06:51:21,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:51:21,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 06:51:21,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:51:21,455 INFO L87 Difference]: Start difference. First operand 843 states and 993 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:51:38,091 INFO L93 Difference]: Finished difference Result 1112 states and 1192 transitions. [2021-10-13 06:51:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:51:38,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 06:51:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:51:38,099 INFO L225 Difference]: With dead ends: 1112 [2021-10-13 06:51:38,100 INFO L226 Difference]: Without dead ends: 1112 [2021-10-13 06:51:38,100 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 453.5ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-13 06:51:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2021-10-13 06:51:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 744. [2021-10-13 06:51:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 503 states have (on average 1.7753479125248508) internal successors, (893), 743 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 893 transitions. [2021-10-13 06:51:38,123 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 893 transitions. Word has length 10 [2021-10-13 06:51:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:51:38,124 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 893 transitions. [2021-10-13 06:51:38,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 893 transitions. [2021-10-13 06:51:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 06:51:38,125 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:51:38,125 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:51:38,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 06:51:38,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:51:38,339 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:51:38,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:51:38,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1116915316, now seen corresponding path program 1 times [2021-10-13 06:51:38,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:51:38,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714483195] [2021-10-13 06:51:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:51:38,341 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:51:38,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:51:38,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:51:38,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-13 06:51:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:51:38,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 06:51:38,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:51:38,510 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-10-13 06:51:38,609 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 06:51:38,610 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-10-13 06:51:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:51:38,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:51:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:51:40,920 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:51:40,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714483195] [2021-10-13 06:51:40,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714483195] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:51:40,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:51:40,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-10-13 06:51:40,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873401440] [2021-10-13 06:51:40,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 06:51:40,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:51:40,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 06:51:40,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=18, Unknown=1, NotChecked=0, Total=30 [2021-10-13 06:51:40,924 INFO L87 Difference]: Start difference. First operand 744 states and 893 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:51:44,474 INFO L93 Difference]: Finished difference Result 784 states and 849 transitions. [2021-10-13 06:51:44,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:51:44,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 06:51:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:51:44,480 INFO L225 Difference]: With dead ends: 784 [2021-10-13 06:51:44,480 INFO L226 Difference]: Without dead ends: 784 [2021-10-13 06:51:44,481 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2098.1ms TimeCoverageRelationStatistics Valid=17, Invalid=24, Unknown=1, NotChecked=0, Total=42 [2021-10-13 06:51:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-10-13 06:51:44,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 646. [2021-10-13 06:51:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 503 states have (on average 1.58051689860835) internal successors, (795), 645 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 795 transitions. [2021-10-13 06:51:44,500 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 795 transitions. Word has length 10 [2021-10-13 06:51:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:51:44,501 INFO L470 AbstractCegarLoop]: Abstraction has 646 states and 795 transitions. [2021-10-13 06:51:44,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:51:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 795 transitions. [2021-10-13 06:51:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 06:51:44,502 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:51:44,503 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:51:44,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-13 06:51:44,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:51:44,716 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:51:44,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:51:44,717 INFO L82 PathProgramCache]: Analyzing trace with hash 94393608, now seen corresponding path program 1 times [2021-10-13 06:51:44,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:51:44,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536129530] [2021-10-13 06:51:44,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:51:44,718 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:51:44,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:51:44,720 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:51:44,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-13 06:51:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:51:44,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 06:51:44,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:51:44,983 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-10-13 06:51:45,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 06:51:45,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 06:51:45,121 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-10-13 06:51:45,121 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 21 treesize of output 20 [2021-10-13 06:51:45,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:51:45,146 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 20 [2021-10-13 06:51:45,395 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 06:51:45,395 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 17 [2021-10-13 06:51:45,567 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-10-13 06:51:45,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 67 treesize of output 58 [2021-10-13 06:51:45,624 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-10-13 06:51:45,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 43 [2021-10-13 06:51:45,727 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-13 06:51:45,727 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 47 treesize of output 33 [2021-10-13 06:51:45,735 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-13 06:51:45,736 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 27 treesize of output 13 [2021-10-13 06:51:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:51:45,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:51:45,965 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:51:45,967 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-10-13 06:51:45,970 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:51:45,971 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-10-13 06:51:57,825 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_299 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_299)))) (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| v_ULTIMATE.start_append_~node~0.base_299 (store (select |c_#memory_$Pointer$.offset| v_ULTIMATE.start_append_~node~0.base_299) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_2)) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_299 (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_299) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_1)) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)))))) is different from false [2021-10-13 06:52:00,105 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_299 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_299)))) (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_299 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_299) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_1))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_299 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_299) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_2))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)))))) is different from false [2021-10-13 06:52:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:52:00,162 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:52:00,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536129530] [2021-10-13 06:52:00,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536129530] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:52:00,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:52:00,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 13 [2021-10-13 06:52:00,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227851478] [2021-10-13 06:52:00,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 06:52:00,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:52:00,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 06:52:00,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2021-10-13 06:52:00,164 INFO L87 Difference]: Start difference. First operand 646 states and 795 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:52:02,226 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_append_~node~0.base_299 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_299)))) (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_299 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_299) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_1))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_299 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_299) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_2))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)))))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~list~0.base))) (_ bv1 1)))) is different from false [2021-10-13 06:52:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:52:11,298 INFO L93 Difference]: Finished difference Result 800 states and 866 transitions. [2021-10-13 06:52:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 06:52:11,299 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 06:52:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:52:11,303 INFO L225 Difference]: With dead ends: 800 [2021-10-13 06:52:11,303 INFO L226 Difference]: Without dead ends: 800 [2021-10-13 06:52:11,304 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 16374.4ms TimeCoverageRelationStatistics Valid=75, Invalid=172, Unknown=5, NotChecked=90, Total=342 [2021-10-13 06:52:11,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-10-13 06:52:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 653. [2021-10-13 06:52:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 510 states have (on average 1.5745098039215686) internal successors, (803), 652 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:52:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 803 transitions. [2021-10-13 06:52:11,330 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 803 transitions. Word has length 19 [2021-10-13 06:52:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:52:11,330 INFO L470 AbstractCegarLoop]: Abstraction has 653 states and 803 transitions. [2021-10-13 06:52:11,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:52:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 803 transitions. [2021-10-13 06:52:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 06:52:11,332 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:52:11,332 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:52:11,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-13 06:52:11,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:52:11,545 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:52:11,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:52:11,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1351113909, now seen corresponding path program 1 times [2021-10-13 06:52:11,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:52:11,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066051812] [2021-10-13 06:52:11,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:52:11,546 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:52:11,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:52:11,547 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:52:11,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-13 06:52:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:52:11,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 06:52:11,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:52:11,744 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-10-13 06:52:11,767 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-10-13 06:52:11,778 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-10-13 06:52:11,898 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 06:52:11,898 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 19 [2021-10-13 06:52:12,000 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-10-13 06:52:12,000 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 53 treesize of output 41 [2021-10-13 06:52:12,029 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-10-13 06:52:12,029 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 38 treesize of output 26 [2021-10-13 06:52:12,122 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 37 treesize of output 25 [2021-10-13 06:52:12,129 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 22 treesize of output 10 [2021-10-13 06:52:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:52:12,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:52:12,302 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:52:12,303 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-10-13 06:52:12,306 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:52:12,307 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-10-13 06:52:25,322 WARN L207 SmtUtils]: Spent 6.06 s on a formula simplification that was a NOOP. DAG size: 26 [2021-10-13 06:52:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:52:29,732 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:52:29,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066051812] [2021-10-13 06:52:29,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066051812] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:52:29,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:52:29,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2021-10-13 06:52:29,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815467735] [2021-10-13 06:52:29,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 06:52:29,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:52:29,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 06:52:29,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=63, Unknown=5, NotChecked=0, Total=90 [2021-10-13 06:52:29,734 INFO L87 Difference]: Start difference. First operand 653 states and 803 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:52:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:52:38,262 INFO L93 Difference]: Finished difference Result 793 states and 858 transitions. [2021-10-13 06:52:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 06:52:38,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 06:52:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:52:38,269 INFO L225 Difference]: With dead ends: 793 [2021-10-13 06:52:38,270 INFO L226 Difference]: Without dead ends: 793 [2021-10-13 06:52:38,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 17884.5ms TimeCoverageRelationStatistics Valid=61, Invalid=144, Unknown=5, NotChecked=0, Total=210 [2021-10-13 06:52:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2021-10-13 06:52:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 656. [2021-10-13 06:52:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 513 states have (on average 1.571150097465887) internal successors, (806), 655 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:52:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 806 transitions. [2021-10-13 06:52:38,286 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 806 transitions. Word has length 21 [2021-10-13 06:52:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:52:38,287 INFO L470 AbstractCegarLoop]: Abstraction has 656 states and 806 transitions. [2021-10-13 06:52:38,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:52:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 806 transitions. [2021-10-13 06:52:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 06:52:38,289 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:52:38,290 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:52:38,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-13 06:52:38,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:52:38,504 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-13 06:52:38,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:52:38,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1113089128, now seen corresponding path program 1 times [2021-10-13 06:52:38,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:52:38,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504450425] [2021-10-13 06:52:38,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:52:38,506 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:52:38,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:52:38,508 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:52:38,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-13 06:52:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:52:38,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-13 06:52:38,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:52:38,850 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-10-13 06:52:38,943 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 06:52:38,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-10-13 06:52:39,394 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-10-13 06:52:39,468 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 23 treesize of output 22 [2021-10-13 06:52:39,633 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 06:52:39,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 45 [2021-10-13 06:52:39,862 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-13 06:52:39,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 76 [2021-10-13 06:52:40,086 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 06:52:40,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 62 [2021-10-13 06:52:40,688 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 06:52:40,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 73 [2021-10-13 06:52:40,950 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 06:52:40,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 82 [2021-10-13 06:52:41,157 INFO L354 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2021-10-13 06:52:41,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 76 [2021-10-13 06:52:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:52:41,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:52:41,846 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:52:41,847 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-10-13 06:52:53,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_301 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_301)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_301 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_301 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_301) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))))))))) (_ bv1 1))))) is different from false [2021-10-13 06:52:55,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_235 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_301 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_301)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_301 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd c_ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_301 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_301) v_ULTIMATE.start_append_~node~0.offset_235 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_235 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_235 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))))))))) (_ bv1 1))))) is different from false [2021-10-13 06:52:57,451 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_235 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_301 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_301 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) (_ bv0 32)) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_301 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_301) v_ULTIMATE.start_append_~node~0.offset_235 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_235 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_235 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_301)))))) is different from false [2021-10-13 06:52:57,474 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 172397 treesize of output 172013 [2021-10-13 06:52:58,457 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:52:58,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504450425] [2021-10-13 06:52:58,458 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 06:52:58,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [26305803] [2021-10-13 06:52:58,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:52:58,458 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 06:52:58,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 06:52:58,461 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 06:52:58,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-10-13 06:52:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:52:58,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjunts are in the unsatisfiable core [2021-10-13 06:52:58,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:52:58,977 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-10-13 06:52:59,187 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 06:52:59,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-10-13 06:52:59,778 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-10-13 06:52:59,978 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 23 treesize of output 22 [2021-10-13 06:53:00,185 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 06:53:00,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 45 [2021-10-13 06:53:00,452 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-13 06:53:00,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 63 [2021-10-13 06:53:00,763 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 06:53:00,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 69 [2021-10-13 06:53:01,447 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 06:53:01,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 74 [2021-10-13 06:53:01,846 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 06:53:01,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 89 [2021-10-13 06:53:02,130 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-13 06:53:02,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 72 [2021-10-13 06:53:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:53:02,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:53:02,414 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:53:02,416 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-10-13 06:53:08,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_302 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_302 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_302 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_302) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_302))))))))) is different from false [2021-10-13 06:53:11,020 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_240 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_302 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_302 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd c_ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_302 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_302) v_ULTIMATE.start_append_~node~0.offset_240 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_240 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_240 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_302))))))))) is different from false [2021-10-13 06:53:13,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_240 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_302 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_302 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) (_ bv0 32)) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_302 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_302) v_ULTIMATE.start_append_~node~0.offset_240 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_240 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_240 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_302))))))))) is different from false [2021-10-13 06:53:13,122 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 45648 treesize of output 45552 [2021-10-13 06:53:13,338 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 06:53:13,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370257054] [2021-10-13 06:53:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:53:13,339 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:53:13,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:53:13,345 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:53:13,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-13 06:53:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:53:13,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-13 06:53:13,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:53:13,784 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 06:53:13,784 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 16 treesize of output 16 [2021-10-13 06:53:14,288 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-10-13 06:53:14,327 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 23 treesize of output 22 [2021-10-13 06:53:14,427 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 06:53:14,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 45 [2021-10-13 06:53:14,582 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-13 06:53:14,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 60 [2021-10-13 06:53:14,811 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 06:53:14,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 69 [2021-10-13 06:53:15,401 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 06:53:15,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 76 [2021-10-13 06:53:15,743 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 06:53:15,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 85 [2021-10-13 06:53:15,994 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-13 06:53:15,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 72 [2021-10-13 06:53:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:53:16,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:53:16,328 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:53:16,329 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-10-13 06:53:23,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_303 (_ BitVec 32)) (ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_303)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_303 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_303 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_303) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))))))))) (_ bv1 1))))) is different from false [2021-10-13 06:53:25,094 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_303 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_245 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_303)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_303 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd c_ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_303 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_303) v_ULTIMATE.start_append_~node~0.offset_245 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_245 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_245 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))))))))) (_ bv1 1))))) is different from false [2021-10-13 06:53:27,179 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_303 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_245 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_303 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) (_ bv0 32)) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_303 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_303) v_ULTIMATE.start_append_~node~0.offset_245 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_245 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_245 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_303)))))) is different from false [2021-10-13 06:53:27,231 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 50297833 treesize of output 50199529 [2021-10-13 06:55:23,141 WARN L207 SmtUtils]: Spent 1.93 m on a formula simplification that was a NOOP. DAG size: 1944 [2021-10-13 06:55:23,672 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 06:55:23,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:55:23,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-10-13 06:55:23,673 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-10-13 06:55:23,673 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-10-13 06:55:23,682 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-13 06:55:23,684 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-13 06:55:23,684 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-13 06:55:23,684 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-13 06:55:23,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-13 06:55:23,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-13 06:55:23,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-13 06:55:23,685 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-13 06:55:23,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-13 06:55:23,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-13 06:55:23,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-13 06:55:23,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-13 06:55:23,686 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-13 06:55:23,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-13 06:55:23,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-13 06:55:23,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-13 06:55:23,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-13 06:55:23,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-13 06:55:23,687 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-13 06:55:23,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-13 06:55:23,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-13 06:55:23,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-13 06:55:23,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-13 06:55:23,688 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-13 06:55:23,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-13 06:55:23,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-13 06:55:23,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-13 06:55:23,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-13 06:55:23,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-13 06:55:23,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-13 06:55:23,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-13 06:55:23,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-13 06:55:23,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-13 06:55:23,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-13 06:55:23,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-13 06:55:23,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-13 06:55:23,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-13 06:55:23,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-13 06:55:23,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-13 06:55:23,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-13 06:55:23,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-13 06:55:23,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-13 06:55:23,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-13 06:55:23,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-13 06:55:23,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-13 06:55:23,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-13 06:55:23,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-13 06:55:23,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-13 06:55:23,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-13 06:55:23,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-13 06:55:23,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-13 06:55:23,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-13 06:55:23,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-13 06:55:23,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-13 06:55:23,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-13 06:55:23,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-13 06:55:23,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-13 06:55:23,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-13 06:55:23,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-13 06:55:23,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-13 06:55:23,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-13 06:55:23,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-13 06:55:23,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-13 06:55:23,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-13 06:55:23,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-13 06:55:23,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-13 06:55:23,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-10-13 06:55:23,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-10-13 06:55:23,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-10-13 06:55:23,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-10-13 06:55:23,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-10-13 06:55:23,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-13 06:55:23,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-10-13 06:55:23,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-10-13 06:55:23,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-13 06:55:23,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-10-13 06:55:23,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-10-13 06:55:23,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-10-13 06:55:23,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-10-13 06:55:23,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-10-13 06:55:23,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION [2021-10-13 06:55:23,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATION [2021-10-13 06:55:23,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-10-13 06:55:23,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-10-13 06:55:23,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION [2021-10-13 06:55:23,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-10-13 06:55:23,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-10-13 06:55:23,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-10-13 06:55:23,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-10-13 06:55:23,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-10-13 06:55:23,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-10-13 06:55:23,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-10-13 06:55:23,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-10-13 06:55:23,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-10-13 06:55:23,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-10-13 06:55:23,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-10-13 06:55:23,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-10-13 06:55:23,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-10-13 06:55:23,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-10-13 06:55:23,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99REQUIRES_VIOLATION [2021-10-13 06:55:23,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100REQUIRES_VIOLATION [2021-10-13 06:55:23,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101REQUIRES_VIOLATION [2021-10-13 06:55:23,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-10-13 06:55:23,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103REQUIRES_VIOLATION [2021-10-13 06:55:23,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104REQUIRES_VIOLATION [2021-10-13 06:55:23,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATION [2021-10-13 06:55:23,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-10-13 06:55:23,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-10-13 06:55:23,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-10-13 06:55:23,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-10-13 06:55:23,706 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110REQUIRES_VIOLATION [2021-10-13 06:55:23,706 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111REQUIRES_VIOLATION [2021-10-13 06:55:23,706 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-10-13 06:55:23,706 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-10-13 06:55:23,707 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114REQUIRES_VIOLATION [2021-10-13 06:55:23,707 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-10-13 06:55:23,707 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-10-13 06:55:23,707 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-10-13 06:55:23,707 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-10-13 06:55:23,708 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119REQUIRES_VIOLATION [2021-10-13 06:55:23,708 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATION [2021-10-13 06:55:23,708 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-10-13 06:55:23,708 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-10-13 06:55:23,708 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-10-13 06:55:23,708 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-10-13 06:55:23,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125REQUIRES_VIOLATION [2021-10-13 06:55:23,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126REQUIRES_VIOLATION [2021-10-13 06:55:23,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127REQUIRES_VIOLATION [2021-10-13 06:55:23,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128REQUIRES_VIOLATION [2021-10-13 06:55:23,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129REQUIRES_VIOLATION [2021-10-13 06:55:23,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130REQUIRES_VIOLATION [2021-10-13 06:55:23,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131REQUIRES_VIOLATION [2021-10-13 06:55:23,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132REQUIRES_VIOLATION [2021-10-13 06:55:23,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133REQUIRES_VIOLATION [2021-10-13 06:55:23,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134REQUIRES_VIOLATION [2021-10-13 06:55:23,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135REQUIRES_VIOLATION [2021-10-13 06:55:23,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136REQUIRES_VIOLATION [2021-10-13 06:55:23,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137REQUIRES_VIOLATION [2021-10-13 06:55:23,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138REQUIRES_VIOLATION [2021-10-13 06:55:23,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139REQUIRES_VIOLATION [2021-10-13 06:55:23,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140REQUIRES_VIOLATION [2021-10-13 06:55:23,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141REQUIRES_VIOLATION [2021-10-13 06:55:23,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142REQUIRES_VIOLATION [2021-10-13 06:55:23,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143REQUIRES_VIOLATION [2021-10-13 06:55:23,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144REQUIRES_VIOLATION [2021-10-13 06:55:23,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145REQUIRES_VIOLATION [2021-10-13 06:55:23,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146REQUIRES_VIOLATION [2021-10-13 06:55:23,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147REQUIRES_VIOLATION [2021-10-13 06:55:23,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148REQUIRES_VIOLATION [2021-10-13 06:55:23,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149REQUIRES_VIOLATION [2021-10-13 06:55:23,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150REQUIRES_VIOLATION [2021-10-13 06:55:23,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151REQUIRES_VIOLATION [2021-10-13 06:55:23,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152REQUIRES_VIOLATION [2021-10-13 06:55:23,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153REQUIRES_VIOLATION [2021-10-13 06:55:23,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154REQUIRES_VIOLATION [2021-10-13 06:55:23,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155REQUIRES_VIOLATION [2021-10-13 06:55:23,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156REQUIRES_VIOLATION [2021-10-13 06:55:23,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157REQUIRES_VIOLATION [2021-10-13 06:55:23,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158REQUIRES_VIOLATION [2021-10-13 06:55:23,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159REQUIRES_VIOLATION [2021-10-13 06:55:23,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160REQUIRES_VIOLATION [2021-10-13 06:55:23,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161REQUIRES_VIOLATION [2021-10-13 06:55:23,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162REQUIRES_VIOLATION [2021-10-13 06:55:23,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163REQUIRES_VIOLATION [2021-10-13 06:55:23,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164REQUIRES_VIOLATION [2021-10-13 06:55:23,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165REQUIRES_VIOLATION [2021-10-13 06:55:23,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166REQUIRES_VIOLATION [2021-10-13 06:55:23,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167REQUIRES_VIOLATION [2021-10-13 06:55:23,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168REQUIRES_VIOLATION [2021-10-13 06:55:23,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169REQUIRES_VIOLATION [2021-10-13 06:55:23,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170REQUIRES_VIOLATION [2021-10-13 06:55:23,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171REQUIRES_VIOLATION [2021-10-13 06:55:23,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172REQUIRES_VIOLATION [2021-10-13 06:55:23,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173REQUIRES_VIOLATION [2021-10-13 06:55:23,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174REQUIRES_VIOLATION [2021-10-13 06:55:23,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175REQUIRES_VIOLATION [2021-10-13 06:55:23,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176REQUIRES_VIOLATION [2021-10-13 06:55:23,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177REQUIRES_VIOLATION [2021-10-13 06:55:23,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178REQUIRES_VIOLATION [2021-10-13 06:55:23,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179REQUIRES_VIOLATION [2021-10-13 06:55:23,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180REQUIRES_VIOLATION [2021-10-13 06:55:23,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181REQUIRES_VIOLATION [2021-10-13 06:55:23,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182REQUIRES_VIOLATION [2021-10-13 06:55:23,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183REQUIRES_VIOLATION [2021-10-13 06:55:23,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184REQUIRES_VIOLATION [2021-10-13 06:55:23,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185REQUIRES_VIOLATION [2021-10-13 06:55:23,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186REQUIRES_VIOLATION [2021-10-13 06:55:23,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187REQUIRES_VIOLATION [2021-10-13 06:55:23,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188REQUIRES_VIOLATION [2021-10-13 06:55:23,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189REQUIRES_VIOLATION [2021-10-13 06:55:23,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190REQUIRES_VIOLATION [2021-10-13 06:55:23,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191REQUIRES_VIOLATION [2021-10-13 06:55:23,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192REQUIRES_VIOLATION [2021-10-13 06:55:23,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193REQUIRES_VIOLATION [2021-10-13 06:55:23,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr194REQUIRES_VIOLATION [2021-10-13 06:55:23,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr195REQUIRES_VIOLATION [2021-10-13 06:55:23,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr196REQUIRES_VIOLATION [2021-10-13 06:55:23,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr197REQUIRES_VIOLATION [2021-10-13 06:55:23,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr198REQUIRES_VIOLATION [2021-10-13 06:55:23,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr199REQUIRES_VIOLATION [2021-10-13 06:55:23,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr200REQUIRES_VIOLATION [2021-10-13 06:55:23,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr201REQUIRES_VIOLATION [2021-10-13 06:55:23,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr202REQUIRES_VIOLATION [2021-10-13 06:55:23,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr203REQUIRES_VIOLATION [2021-10-13 06:55:23,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr204REQUIRES_VIOLATION [2021-10-13 06:55:23,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr205REQUIRES_VIOLATION [2021-10-13 06:55:23,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr206REQUIRES_VIOLATION [2021-10-13 06:55:23,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr207REQUIRES_VIOLATION [2021-10-13 06:55:23,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr208REQUIRES_VIOLATION [2021-10-13 06:55:23,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr209REQUIRES_VIOLATION [2021-10-13 06:55:23,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr210REQUIRES_VIOLATION [2021-10-13 06:55:23,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr211REQUIRES_VIOLATION [2021-10-13 06:55:23,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr212REQUIRES_VIOLATION [2021-10-13 06:55:23,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr213REQUIRES_VIOLATION [2021-10-13 06:55:23,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr214REQUIRES_VIOLATION [2021-10-13 06:55:23,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr215REQUIRES_VIOLATION [2021-10-13 06:55:23,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr216REQUIRES_VIOLATION [2021-10-13 06:55:23,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr217REQUIRES_VIOLATION [2021-10-13 06:55:23,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr218REQUIRES_VIOLATION [2021-10-13 06:55:23,728 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr219REQUIRES_VIOLATION [2021-10-13 06:55:23,729 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr220REQUIRES_VIOLATION [2021-10-13 06:55:23,729 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr221REQUIRES_VIOLATION [2021-10-13 06:55:23,729 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr222REQUIRES_VIOLATION [2021-10-13 06:55:23,729 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr223REQUIRES_VIOLATION [2021-10-13 06:55:23,729 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr224REQUIRES_VIOLATION [2021-10-13 06:55:23,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr225REQUIRES_VIOLATION [2021-10-13 06:55:23,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr226REQUIRES_VIOLATION [2021-10-13 06:55:23,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr227REQUIRES_VIOLATION [2021-10-13 06:55:23,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr228REQUIRES_VIOLATION [2021-10-13 06:55:23,730 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr229REQUIRES_VIOLATION [2021-10-13 06:55:23,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr230REQUIRES_VIOLATION [2021-10-13 06:55:23,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr231REQUIRES_VIOLATION [2021-10-13 06:55:23,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr232REQUIRES_VIOLATION [2021-10-13 06:55:23,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr233REQUIRES_VIOLATION [2021-10-13 06:55:23,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr234REQUIRES_VIOLATION [2021-10-13 06:55:23,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr235REQUIRES_VIOLATION [2021-10-13 06:55:23,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr236REQUIRES_VIOLATION [2021-10-13 06:55:23,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr237REQUIRES_VIOLATION [2021-10-13 06:55:23,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr238REQUIRES_VIOLATION [2021-10-13 06:55:23,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr239REQUIRES_VIOLATION [2021-10-13 06:55:23,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr240REQUIRES_VIOLATION [2021-10-13 06:55:23,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr241REQUIRES_VIOLATION [2021-10-13 06:55:23,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr242REQUIRES_VIOLATION [2021-10-13 06:55:23,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr243REQUIRES_VIOLATION [2021-10-13 06:55:23,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr244REQUIRES_VIOLATION [2021-10-13 06:55:23,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr245REQUIRES_VIOLATION [2021-10-13 06:55:23,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr246REQUIRES_VIOLATION [2021-10-13 06:55:23,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr247REQUIRES_VIOLATION [2021-10-13 06:55:23,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr248REQUIRES_VIOLATION [2021-10-13 06:55:23,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr249REQUIRES_VIOLATION [2021-10-13 06:55:23,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr250REQUIRES_VIOLATION [2021-10-13 06:55:23,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr251REQUIRES_VIOLATION [2021-10-13 06:55:23,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr252REQUIRES_VIOLATION [2021-10-13 06:55:23,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr253REQUIRES_VIOLATION [2021-10-13 06:55:23,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr254REQUIRES_VIOLATION [2021-10-13 06:55:23,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr255REQUIRES_VIOLATION [2021-10-13 06:55:23,740 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr256REQUIRES_VIOLATION [2021-10-13 06:55:23,740 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr257REQUIRES_VIOLATION [2021-10-13 06:55:23,740 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr258REQUIRES_VIOLATION [2021-10-13 06:55:23,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr259REQUIRES_VIOLATION [2021-10-13 06:55:23,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr260REQUIRES_VIOLATION [2021-10-13 06:55:23,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr261REQUIRES_VIOLATION [2021-10-13 06:55:23,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr262REQUIRES_VIOLATION [2021-10-13 06:55:23,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr263REQUIRES_VIOLATION [2021-10-13 06:55:23,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr264REQUIRES_VIOLATION [2021-10-13 06:55:23,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr265REQUIRES_VIOLATION [2021-10-13 06:55:23,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr266REQUIRES_VIOLATION [2021-10-13 06:55:23,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr267REQUIRES_VIOLATION [2021-10-13 06:55:23,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr268REQUIRES_VIOLATION [2021-10-13 06:55:23,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr269REQUIRES_VIOLATION [2021-10-13 06:55:23,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr270REQUIRES_VIOLATION [2021-10-13 06:55:23,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr271REQUIRES_VIOLATION [2021-10-13 06:55:23,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr272REQUIRES_VIOLATION [2021-10-13 06:55:23,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr273REQUIRES_VIOLATION [2021-10-13 06:55:23,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr274REQUIRES_VIOLATION [2021-10-13 06:55:23,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr275REQUIRES_VIOLATION [2021-10-13 06:55:23,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr276REQUIRES_VIOLATION [2021-10-13 06:55:23,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr277REQUIRES_VIOLATION [2021-10-13 06:55:23,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr278REQUIRES_VIOLATION [2021-10-13 06:55:23,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr279REQUIRES_VIOLATION [2021-10-13 06:55:23,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr280REQUIRES_VIOLATION [2021-10-13 06:55:23,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr281REQUIRES_VIOLATION [2021-10-13 06:55:23,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr282REQUIRES_VIOLATION [2021-10-13 06:55:23,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr283REQUIRES_VIOLATION [2021-10-13 06:55:23,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr284REQUIRES_VIOLATION [2021-10-13 06:55:23,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr285REQUIRES_VIOLATION [2021-10-13 06:55:23,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr286REQUIRES_VIOLATION [2021-10-13 06:55:23,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr287REQUIRES_VIOLATION [2021-10-13 06:55:23,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr288REQUIRES_VIOLATION [2021-10-13 06:55:23,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr289REQUIRES_VIOLATION [2021-10-13 06:55:23,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr290REQUIRES_VIOLATION [2021-10-13 06:55:23,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr291REQUIRES_VIOLATION [2021-10-13 06:55:23,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr292REQUIRES_VIOLATION [2021-10-13 06:55:23,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr293REQUIRES_VIOLATION [2021-10-13 06:55:23,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr294REQUIRES_VIOLATION [2021-10-13 06:55:23,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr295REQUIRES_VIOLATION [2021-10-13 06:55:23,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr296REQUIRES_VIOLATION [2021-10-13 06:55:23,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr297REQUIRES_VIOLATION [2021-10-13 06:55:23,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr298REQUIRES_VIOLATION [2021-10-13 06:55:23,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr299REQUIRES_VIOLATION [2021-10-13 06:55:23,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr300REQUIRES_VIOLATION [2021-10-13 06:55:23,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr301REQUIRES_VIOLATION [2021-10-13 06:55:23,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr302REQUIRES_VIOLATION [2021-10-13 06:55:23,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr303REQUIRES_VIOLATION [2021-10-13 06:55:23,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr304REQUIRES_VIOLATION [2021-10-13 06:55:23,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr305REQUIRES_VIOLATION [2021-10-13 06:55:23,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr306REQUIRES_VIOLATION [2021-10-13 06:55:23,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr307REQUIRES_VIOLATION [2021-10-13 06:55:23,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr308REQUIRES_VIOLATION [2021-10-13 06:55:23,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr309REQUIRES_VIOLATION [2021-10-13 06:55:23,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr310REQUIRES_VIOLATION [2021-10-13 06:55:23,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr311REQUIRES_VIOLATION [2021-10-13 06:55:23,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr312REQUIRES_VIOLATION [2021-10-13 06:55:23,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr313REQUIRES_VIOLATION [2021-10-13 06:55:23,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr314REQUIRES_VIOLATION [2021-10-13 06:55:23,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr315REQUIRES_VIOLATION [2021-10-13 06:55:23,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr316REQUIRES_VIOLATION [2021-10-13 06:55:23,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr317REQUIRES_VIOLATION [2021-10-13 06:55:23,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr318REQUIRES_VIOLATION [2021-10-13 06:55:23,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr319REQUIRES_VIOLATION [2021-10-13 06:55:23,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr320REQUIRES_VIOLATION [2021-10-13 06:55:23,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr321REQUIRES_VIOLATION [2021-10-13 06:55:23,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr322REQUIRES_VIOLATION [2021-10-13 06:55:23,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr323REQUIRES_VIOLATION [2021-10-13 06:55:23,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr324REQUIRES_VIOLATION [2021-10-13 06:55:23,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr325REQUIRES_VIOLATION [2021-10-13 06:55:23,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr326REQUIRES_VIOLATION [2021-10-13 06:55:23,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr327REQUIRES_VIOLATION [2021-10-13 06:55:23,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr328REQUIRES_VIOLATION [2021-10-13 06:55:23,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr329REQUIRES_VIOLATION [2021-10-13 06:55:23,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr330REQUIRES_VIOLATION [2021-10-13 06:55:23,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr331REQUIRES_VIOLATION [2021-10-13 06:55:23,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr332REQUIRES_VIOLATION [2021-10-13 06:55:23,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr333REQUIRES_VIOLATION [2021-10-13 06:55:23,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr334REQUIRES_VIOLATION [2021-10-13 06:55:23,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr335REQUIRES_VIOLATION [2021-10-13 06:55:23,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr336REQUIRES_VIOLATION [2021-10-13 06:55:23,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr337REQUIRES_VIOLATION [2021-10-13 06:55:23,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr338REQUIRES_VIOLATION [2021-10-13 06:55:23,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr339REQUIRES_VIOLATION [2021-10-13 06:55:23,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr340REQUIRES_VIOLATION [2021-10-13 06:55:23,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr341REQUIRES_VIOLATION [2021-10-13 06:55:23,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr342REQUIRES_VIOLATION [2021-10-13 06:55:23,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr343REQUIRES_VIOLATION [2021-10-13 06:55:23,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr344REQUIRES_VIOLATION [2021-10-13 06:55:23,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr345REQUIRES_VIOLATION [2021-10-13 06:55:23,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr346REQUIRES_VIOLATION [2021-10-13 06:55:23,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr347REQUIRES_VIOLATION [2021-10-13 06:55:23,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr348REQUIRES_VIOLATION [2021-10-13 06:55:23,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr349REQUIRES_VIOLATION [2021-10-13 06:55:23,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr350REQUIRES_VIOLATION [2021-10-13 06:55:23,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr351REQUIRES_VIOLATION [2021-10-13 06:55:23,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr352REQUIRES_VIOLATION [2021-10-13 06:55:23,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr353REQUIRES_VIOLATION [2021-10-13 06:55:23,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr354REQUIRES_VIOLATION [2021-10-13 06:55:23,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr355REQUIRES_VIOLATION [2021-10-13 06:55:23,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr356REQUIRES_VIOLATION [2021-10-13 06:55:23,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr357REQUIRES_VIOLATION [2021-10-13 06:55:23,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr358REQUIRES_VIOLATION [2021-10-13 06:55:23,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr359REQUIRES_VIOLATION [2021-10-13 06:55:23,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr360REQUIRES_VIOLATION [2021-10-13 06:55:23,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr361REQUIRES_VIOLATION [2021-10-13 06:55:23,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr362REQUIRES_VIOLATION [2021-10-13 06:55:23,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr363REQUIRES_VIOLATION [2021-10-13 06:55:23,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr364REQUIRES_VIOLATION [2021-10-13 06:55:23,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr365REQUIRES_VIOLATION [2021-10-13 06:55:23,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr366REQUIRES_VIOLATION [2021-10-13 06:55:23,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr367REQUIRES_VIOLATION [2021-10-13 06:55:23,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr368REQUIRES_VIOLATION [2021-10-13 06:55:23,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr369REQUIRES_VIOLATION [2021-10-13 06:55:23,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr370REQUIRES_VIOLATION [2021-10-13 06:55:23,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr371REQUIRES_VIOLATION [2021-10-13 06:55:23,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr372REQUIRES_VIOLATION [2021-10-13 06:55:23,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr373REQUIRES_VIOLATION [2021-10-13 06:55:23,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr374REQUIRES_VIOLATION [2021-10-13 06:55:23,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr375REQUIRES_VIOLATION [2021-10-13 06:55:23,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr376REQUIRES_VIOLATION [2021-10-13 06:55:23,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr377REQUIRES_VIOLATION [2021-10-13 06:55:23,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr378REQUIRES_VIOLATION [2021-10-13 06:55:23,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr379REQUIRES_VIOLATION [2021-10-13 06:55:23,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr380REQUIRES_VIOLATION [2021-10-13 06:55:23,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr381REQUIRES_VIOLATION [2021-10-13 06:55:23,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr382REQUIRES_VIOLATION [2021-10-13 06:55:23,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr383REQUIRES_VIOLATION [2021-10-13 06:55:23,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr384REQUIRES_VIOLATION [2021-10-13 06:55:23,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr385REQUIRES_VIOLATION [2021-10-13 06:55:23,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr386REQUIRES_VIOLATION [2021-10-13 06:55:23,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr387REQUIRES_VIOLATION [2021-10-13 06:55:23,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr388REQUIRES_VIOLATION [2021-10-13 06:55:23,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr389REQUIRES_VIOLATION [2021-10-13 06:55:23,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr390REQUIRES_VIOLATION [2021-10-13 06:55:23,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr391REQUIRES_VIOLATION [2021-10-13 06:55:23,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr392REQUIRES_VIOLATION [2021-10-13 06:55:23,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr393REQUIRES_VIOLATION [2021-10-13 06:55:23,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr394REQUIRES_VIOLATION [2021-10-13 06:55:23,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr395REQUIRES_VIOLATION [2021-10-13 06:55:23,764 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr396REQUIRES_VIOLATION [2021-10-13 06:55:23,764 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr397REQUIRES_VIOLATION [2021-10-13 06:55:23,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr398REQUIRES_VIOLATION [2021-10-13 06:55:23,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr399REQUIRES_VIOLATION [2021-10-13 06:55:23,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr400REQUIRES_VIOLATION [2021-10-13 06:55:23,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr401REQUIRES_VIOLATION [2021-10-13 06:55:23,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr402REQUIRES_VIOLATION [2021-10-13 06:55:23,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr403REQUIRES_VIOLATION [2021-10-13 06:55:23,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr404REQUIRES_VIOLATION [2021-10-13 06:55:23,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr405REQUIRES_VIOLATION [2021-10-13 06:55:23,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr406REQUIRES_VIOLATION [2021-10-13 06:55:23,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr407REQUIRES_VIOLATION [2021-10-13 06:55:23,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr408REQUIRES_VIOLATION [2021-10-13 06:55:23,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr409REQUIRES_VIOLATION [2021-10-13 06:55:23,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr410REQUIRES_VIOLATION [2021-10-13 06:55:23,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr411REQUIRES_VIOLATION [2021-10-13 06:55:23,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr412REQUIRES_VIOLATION [2021-10-13 06:55:23,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr413REQUIRES_VIOLATION [2021-10-13 06:55:23,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr414REQUIRES_VIOLATION [2021-10-13 06:55:23,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr415REQUIRES_VIOLATION [2021-10-13 06:55:23,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr416ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr417ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr418ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr419REQUIRES_VIOLATION [2021-10-13 06:55:23,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr420REQUIRES_VIOLATION [2021-10-13 06:55:23,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr421ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr423ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr424REQUIRES_VIOLATION [2021-10-13 06:55:23,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr425REQUIRES_VIOLATION [2021-10-13 06:55:23,771 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr426REQUIRES_VIOLATION [2021-10-13 06:55:23,771 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr427REQUIRES_VIOLATION [2021-10-13 06:55:23,771 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr428REQUIRES_VIOLATION [2021-10-13 06:55:23,771 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr429REQUIRES_VIOLATION [2021-10-13 06:55:23,771 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr430REQUIRES_VIOLATION [2021-10-13 06:55:23,771 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr431REQUIRES_VIOLATION [2021-10-13 06:55:23,771 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr432REQUIRES_VIOLATION [2021-10-13 06:55:23,772 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr433REQUIRES_VIOLATION [2021-10-13 06:55:23,772 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr434REQUIRES_VIOLATION [2021-10-13 06:55:23,772 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr435REQUIRES_VIOLATION [2021-10-13 06:55:23,772 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr436REQUIRES_VIOLATION [2021-10-13 06:55:23,772 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr437REQUIRES_VIOLATION [2021-10-13 06:55:23,772 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr438REQUIRES_VIOLATION [2021-10-13 06:55:23,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr439REQUIRES_VIOLATION [2021-10-13 06:55:23,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr440REQUIRES_VIOLATION [2021-10-13 06:55:23,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr441REQUIRES_VIOLATION [2021-10-13 06:55:23,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr442REQUIRES_VIOLATION [2021-10-13 06:55:23,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr443REQUIRES_VIOLATION [2021-10-13 06:55:23,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr444REQUIRES_VIOLATION [2021-10-13 06:55:23,774 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr445REQUIRES_VIOLATION [2021-10-13 06:55:23,774 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr446REQUIRES_VIOLATION [2021-10-13 06:55:23,774 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr447REQUIRES_VIOLATION [2021-10-13 06:55:23,774 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr448REQUIRES_VIOLATION [2021-10-13 06:55:23,774 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr449REQUIRES_VIOLATION [2021-10-13 06:55:23,774 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr450REQUIRES_VIOLATION [2021-10-13 06:55:23,775 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr451REQUIRES_VIOLATION [2021-10-13 06:55:23,775 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr452REQUIRES_VIOLATION [2021-10-13 06:55:23,775 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr453REQUIRES_VIOLATION [2021-10-13 06:55:23,775 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr454REQUIRES_VIOLATION [2021-10-13 06:55:23,775 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr455REQUIRES_VIOLATION [2021-10-13 06:55:23,775 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr456REQUIRES_VIOLATION [2021-10-13 06:55:23,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr457REQUIRES_VIOLATION [2021-10-13 06:55:23,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr458REQUIRES_VIOLATION [2021-10-13 06:55:23,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr459REQUIRES_VIOLATION [2021-10-13 06:55:23,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr460REQUIRES_VIOLATION [2021-10-13 06:55:23,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr461REQUIRES_VIOLATION [2021-10-13 06:55:23,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr462REQUIRES_VIOLATION [2021-10-13 06:55:23,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr463REQUIRES_VIOLATION [2021-10-13 06:55:23,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr464REQUIRES_VIOLATION [2021-10-13 06:55:23,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr465REQUIRES_VIOLATION [2021-10-13 06:55:23,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr466REQUIRES_VIOLATION [2021-10-13 06:55:23,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr467REQUIRES_VIOLATION [2021-10-13 06:55:23,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr468ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr469ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr470ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr471REQUIRES_VIOLATION [2021-10-13 06:55:23,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr472REQUIRES_VIOLATION [2021-10-13 06:55:23,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr473ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr474ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr475ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr476REQUIRES_VIOLATION [2021-10-13 06:55:23,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr477REQUIRES_VIOLATION [2021-10-13 06:55:23,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr478ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr479ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr480ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr481ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr482ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr483ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:55:23,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr484ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:55:23,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-13 06:55:24,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2021-10-13 06:55:24,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-13 06:55:24,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:55:24,415 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 06:55:24,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:55:24 BoogieIcfgContainer [2021-10-13 06:55:24,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 06:55:24,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 06:55:24,449 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 06:55:24,449 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 06:55:24,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:51:04" (3/4) ... [2021-10-13 06:55:24,453 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-13 06:55:24,453 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 06:55:24,455 INFO L168 Benchmark]: Toolchain (without parser) took 265461.76 ms. Allocated memory was 60.8 MB in the beginning and 306.2 MB in the end (delta: 245.4 MB). Free memory was 39.2 MB in the beginning and 94.3 MB in the end (delta: -55.2 MB). Peak memory consumption was 192.8 MB. Max. memory is 16.1 GB. [2021-10-13 06:55:24,455 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 60.8 MB. Free memory is still 41.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 06:55:24,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.50 ms. Allocated memory is still 60.8 MB. Free memory was 39.0 MB in the beginning and 34.4 MB in the end (delta: 4.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-13 06:55:24,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.92 ms. Allocated memory is still 60.8 MB. Free memory was 34.4 MB in the beginning and 29.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 06:55:24,456 INFO L168 Benchmark]: Boogie Preprocessor took 161.25 ms. Allocated memory was 60.8 MB in the beginning and 88.1 MB in the end (delta: 27.3 MB). Free memory was 29.4 MB in the beginning and 67.2 MB in the end (delta: -37.9 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2021-10-13 06:55:24,457 INFO L168 Benchmark]: RCFGBuilder took 4785.27 ms. Allocated memory is still 88.1 MB. Free memory was 67.2 MB in the beginning and 49.7 MB in the end (delta: 17.5 MB). Peak memory consumption was 35.3 MB. Max. memory is 16.1 GB. [2021-10-13 06:55:24,457 INFO L168 Benchmark]: TraceAbstraction took 259631.66 ms. Allocated memory was 88.1 MB in the beginning and 306.2 MB in the end (delta: 218.1 MB). Free memory was 49.7 MB in the beginning and 94.3 MB in the end (delta: -44.7 MB). Peak memory consumption was 186.0 MB. Max. memory is 16.1 GB. [2021-10-13 06:55:24,458 INFO L168 Benchmark]: Witness Printer took 8.09 ms. Allocated memory is still 306.2 MB. Free memory was 94.3 MB in the beginning and 94.3 MB in the end (delta: 2.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 06:55:24,460 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.36 ms. Allocated memory is still 60.8 MB. Free memory is still 41.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 738.50 ms. Allocated memory is still 60.8 MB. Free memory was 39.0 MB in the beginning and 34.4 MB in the end (delta: 4.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 126.92 ms. Allocated memory is still 60.8 MB. Free memory was 34.4 MB in the beginning and 29.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 161.25 ms. Allocated memory was 60.8 MB in the beginning and 88.1 MB in the end (delta: 27.3 MB). Free memory was 29.4 MB in the beginning and 67.2 MB in the end (delta: -37.9 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4785.27 ms. Allocated memory is still 88.1 MB. Free memory was 67.2 MB in the beginning and 49.7 MB in the end (delta: 17.5 MB). Peak memory consumption was 35.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 259631.66 ms. Allocated memory was 88.1 MB in the beginning and 306.2 MB in the end (delta: 218.1 MB). Free memory was 49.7 MB in the beginning and 94.3 MB in the end (delta: -44.7 MB). Peak memory consumption was 186.0 MB. Max. memory is 16.1 GB. * Witness Printer took 8.09 ms. Allocated memory is still 306.2 MB. Free memory was 94.3 MB in the beginning and 94.3 MB in the end (delta: 2.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L574] struct list_t *list = malloc(sizeof *list); [L575] list->first = ((void *)0) [L576] list->last = ((void *)0) [L577] char userInput; [L579] char userInput = __VERIFIER_nondet_char(); [L580] COND FALSE !((userInput == '<') || (userInput == '>')) [L559] struct node_t *node = malloc(sizeof *node); [L560] node->data = input [L561] EXPR head->first [L561] head->first == ((void *)0) && head->last == ((void *)0) [L561] EXPR head->last [L561] head->first == ((void *)0) && head->last == ((void *)0) [L561] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L562] head->first = node [L563] head->last= node [L564] node->prev = ((void *)0) [L565] node->next = ((void *)0) [L584] COND FALSE !(__VERIFIER_nondet_int()) [L559] struct node_t *node = malloc(sizeof *node); [L560] node->data = input [L561] EXPR head->first [L561] head->first == ((void *)0) && head->last == ((void *)0) [L561] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L568] EXPR head->last [L568] node->prev = head->last [L569] node->next = ((void *)0) [L570] EXPR head->last [L570] head->last->next = node - UnprovableResult [Line: 575]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 611]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 611]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 622]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 622]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 627]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 627]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 632]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 632]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 638]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 638]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 638]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 641]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 641]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 641]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 902 locations, 485 error locations. Started 1 CEGAR loops. OverallTime: 259507.4ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 44.2ms, AutomataDifference: 53095.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 36.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3137 SDtfs, 9033 SDslu, 4488 SDs, 0 SdLazy, 8013 SolverSat, 576 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 43463.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 36891.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=985occurred in iteration=1, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 271.6ms AutomataMinimizationTime, 8 MinimizatonAttempts, 1121 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 96.2ms SsaConstructionTime, 373.2ms SatisfiabilityAnalysisTime, 37189.7ms InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 152 ConstructedInterpolants, 27 QuantifiedInterpolants, 1896 SizeOfPredicates, 43 NumberOfNonLiveVariables, 495 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-10-13 06:55:24,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a81269b2-da1e-4d80-96f3-d11c91251f58/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...