./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs --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 d0b5010c4e76c80e8e6103ea9fc77304c013c292 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs --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 d0b5010c4e76c80e8e6103ea9fc77304c013c292 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-16 01:54:30,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 01:54:30,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 01:54:30,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 01:54:30,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 01:54:30,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 01:54:30,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 01:54:30,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 01:54:30,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 01:54:30,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 01:54:30,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 01:54:30,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 01:54:30,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 01:54:30,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 01:54:30,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 01:54:30,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 01:54:30,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 01:54:30,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 01:54:30,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 01:54:30,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 01:54:30,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 01:54:30,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 01:54:30,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 01:54:30,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 01:54:30,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 01:54:30,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 01:54:30,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 01:54:30,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 01:54:30,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 01:54:30,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 01:54:30,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 01:54:30,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 01:54:30,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 01:54:30,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 01:54:30,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 01:54:30,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 01:54:30,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 01:54:30,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 01:54:30,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 01:54:30,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 01:54:30,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 01:54:30,555 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-16 01:54:30,624 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 01:54:30,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 01:54:30,626 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 01:54:30,634 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 01:54:30,634 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 01:54:30,635 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 01:54:30,635 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-16 01:54:30,635 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 01:54:30,635 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 01:54:30,635 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-16 01:54:30,635 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-16 01:54:30,636 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 01:54:30,636 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-16 01:54:30,636 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-16 01:54:30,636 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-16 01:54:30,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-16 01:54:30,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-16 01:54:30,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 01:54:30,638 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 01:54:30,638 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-16 01:54:30,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 01:54:30,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 01:54:30,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 01:54:30,639 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-16 01:54:30,639 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-16 01:54:30,639 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-16 01:54:30,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 01:54:30,639 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 01:54:30,640 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 01:54:30,640 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 01:54:30,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 01:54:30,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 01:54:30,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 01:54:30,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 01:54:30,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 01:54:30,641 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-16 01:54:30,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 01:54:30,641 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 01:54:30,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 01:54:30,642 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_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/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_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs 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 -> d0b5010c4e76c80e8e6103ea9fc77304c013c292 [2021-10-16 01:54:30,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 01:54:30,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 01:54:30,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 01:54:30,971 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 01:54:30,971 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 01:54:30,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2021-10-16 01:54:31,092 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/data/fb4339a23/0e25ff14753747498f9a0c92c1bfdf98/FLAG27d6b3c94 [2021-10-16 01:54:31,676 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 01:54:31,676 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2021-10-16 01:54:31,699 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/data/fb4339a23/0e25ff14753747498f9a0c92c1bfdf98/FLAG27d6b3c94 [2021-10-16 01:54:31,969 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/data/fb4339a23/0e25ff14753747498f9a0c92c1bfdf98 [2021-10-16 01:54:31,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 01:54:31,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 01:54:31,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 01:54:31,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 01:54:31,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 01:54:31,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:54:31" (1/1) ... [2021-10-16 01:54:31,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11be0375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:31, skipping insertion in model container [2021-10-16 01:54:31,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:54:31" (1/1) ... [2021-10-16 01:54:31,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 01:54:32,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 01:54:32,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 01:54:32,363 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 01:54:32,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 01:54:32,467 INFO L208 MainTranslator]: Completed translation [2021-10-16 01:54:32,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:32 WrapperNode [2021-10-16 01:54:32,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 01:54:32,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 01:54:32,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 01:54:32,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 01:54:32,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:32" (1/1) ... [2021-10-16 01:54:32,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:32" (1/1) ... [2021-10-16 01:54:32,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 01:54:32,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 01:54:32,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 01:54:32,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 01:54:32,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:32" (1/1) ... [2021-10-16 01:54:32,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:32" (1/1) ... [2021-10-16 01:54:32,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:32" (1/1) ... [2021-10-16 01:54:32,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:32" (1/1) ... [2021-10-16 01:54:32,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:32" (1/1) ... [2021-10-16 01:54:32,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:32" (1/1) ... [2021-10-16 01:54:32,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:32" (1/1) ... [2021-10-16 01:54:32,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 01:54:32,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 01:54:32,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 01:54:32,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 01:54:32,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:32" (1/1) ... [2021-10-16 01:54:32,715 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 01:54:32,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 01:54:32,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 01:54:32,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 01:54:32,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-16 01:54:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-16 01:54:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-16 01:54:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-16 01:54:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 01:54:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-16 01:54:32,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-16 01:54:32,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 01:54:32,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 01:54:32,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 01:54:35,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 01:54:35,105 INFO L299 CfgBuilder]: Removed 49 assume(true) statements. [2021-10-16 01:54:35,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:54:35 BoogieIcfgContainer [2021-10-16 01:54:35,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 01:54:35,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 01:54:35,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 01:54:35,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 01:54:35,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:54:31" (1/3) ... [2021-10-16 01:54:35,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e42c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:54:35, skipping insertion in model container [2021-10-16 01:54:35,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:54:32" (2/3) ... [2021-10-16 01:54:35,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e42c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:54:35, skipping insertion in model container [2021-10-16 01:54:35,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:54:35" (3/3) ... [2021-10-16 01:54:35,122 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2021-10-16 01:54:35,132 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 01:54:35,132 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 511 error locations. [2021-10-16 01:54:35,192 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 01:54:35,201 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-16 01:54:35,202 INFO L340 AbstractCegarLoop]: Starting to check reachability of 511 error locations. [2021-10-16 01:54:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 861 states, 349 states have (on average 2.6246418338108883) internal successors, (916), 860 states have internal predecessors, (916), 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-16 01:54:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-16 01:54:35,254 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:35,254 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-16 01:54:35,255 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:35,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:35,262 INFO L82 PathProgramCache]: Analyzing trace with hash 42102, now seen corresponding path program 1 times [2021-10-16 01:54:35,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:35,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721748886] [2021-10-16 01:54:35,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:35,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:54:35,443 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-16 01:54:35,444 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:54:35,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721748886] [2021-10-16 01:54:35,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721748886] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:54:35,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:54:35,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-16 01:54:35,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145683117] [2021-10-16 01:54:35,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 01:54:35,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:54:35,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 01:54:35,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 01:54:35,472 INFO L87 Difference]: Start difference. First operand has 861 states, 349 states have (on average 2.6246418338108883) internal successors, (916), 860 states have internal predecessors, (916), 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-16 01:54:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:54:36,469 INFO L93 Difference]: Finished difference Result 1063 states and 1128 transitions. [2021-10-16 01:54:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 01:54:36,471 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-16 01:54:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:54:36,500 INFO L225 Difference]: With dead ends: 1063 [2021-10-16 01:54:36,501 INFO L226 Difference]: Without dead ends: 1062 [2021-10-16 01:54:36,503 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 01:54:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2021-10-16 01:54:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 931. [2021-10-16 01:54:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 423 states have (on average 2.557919621749409) internal successors, (1082), 930 states have internal predecessors, (1082), 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-16 01:54:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1082 transitions. [2021-10-16 01:54:36,648 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1082 transitions. Word has length 2 [2021-10-16 01:54:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:54:36,648 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 1082 transitions. [2021-10-16 01:54:36,649 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-16 01:54:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1082 transitions. [2021-10-16 01:54:36,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-16 01:54:36,649 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:36,650 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-16 01:54:36,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 01:54:36,650 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:36,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash 42103, now seen corresponding path program 1 times [2021-10-16 01:54:36,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:36,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025814646] [2021-10-16 01:54:36,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:36,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:54:36,745 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-16 01:54:36,745 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:54:36,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025814646] [2021-10-16 01:54:36,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025814646] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:54:36,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:54:36,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-16 01:54:36,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876742658] [2021-10-16 01:54:36,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 01:54:36,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:54:36,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 01:54:36,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 01:54:36,751 INFO L87 Difference]: Start difference. First operand 931 states and 1082 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-16 01:54:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:54:37,423 INFO L93 Difference]: Finished difference Result 931 states and 1083 transitions. [2021-10-16 01:54:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 01:54:37,424 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-16 01:54:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:54:37,430 INFO L225 Difference]: With dead ends: 931 [2021-10-16 01:54:37,430 INFO L226 Difference]: Without dead ends: 931 [2021-10-16 01:54:37,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-16 01:54:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-10-16 01:54:37,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2021-10-16 01:54:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 423 states have (on average 2.5531914893617023) internal successors, (1080), 928 states have internal predecessors, (1080), 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-16 01:54:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1080 transitions. [2021-10-16 01:54:37,455 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1080 transitions. Word has length 2 [2021-10-16 01:54:37,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:54:37,455 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1080 transitions. [2021-10-16 01:54:37,456 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-16 01:54:37,456 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1080 transitions. [2021-10-16 01:54:37,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 01:54:37,456 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:37,457 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 01:54:37,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-16 01:54:37,457 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:37,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:37,458 INFO L82 PathProgramCache]: Analyzing trace with hash 265205178, now seen corresponding path program 1 times [2021-10-16 01:54:37,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:37,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646277376] [2021-10-16 01:54:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:37,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:54:37,504 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-16 01:54:37,510 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:54:37,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646277376] [2021-10-16 01:54:37,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646277376] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:54:37,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:54:37,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 01:54:37,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918584556] [2021-10-16 01:54:37,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 01:54:37,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:54:37,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 01:54:37,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 01:54:37,516 INFO L87 Difference]: Start difference. First operand 929 states and 1080 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-16 01:54:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:54:38,292 INFO L93 Difference]: Finished difference Result 987 states and 1053 transitions. [2021-10-16 01:54:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 01:54:38,293 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-16 01:54:38,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:54:38,299 INFO L225 Difference]: With dead ends: 987 [2021-10-16 01:54:38,299 INFO L226 Difference]: Without dead ends: 987 [2021-10-16 01:54:38,299 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-16 01:54:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2021-10-16 01:54:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 854. [2021-10-16 01:54:38,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 423 states have (on average 2.375886524822695) internal successors, (1005), 853 states have internal predecessors, (1005), 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-16 01:54:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1005 transitions. [2021-10-16 01:54:38,320 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1005 transitions. Word has length 6 [2021-10-16 01:54:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:54:38,320 INFO L470 AbstractCegarLoop]: Abstraction has 854 states and 1005 transitions. [2021-10-16 01:54:38,321 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-16 01:54:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1005 transitions. [2021-10-16 01:54:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 01:54:38,321 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:38,321 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 01:54:38,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-16 01:54:38,322 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:38,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:38,322 INFO L82 PathProgramCache]: Analyzing trace with hash 265205179, now seen corresponding path program 1 times [2021-10-16 01:54:38,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:38,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494024699] [2021-10-16 01:54:38,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:38,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:54:38,383 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-16 01:54:38,383 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:54:38,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494024699] [2021-10-16 01:54:38,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494024699] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:54:38,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:54:38,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 01:54:38,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095536537] [2021-10-16 01:54:38,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 01:54:38,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:54:38,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 01:54:38,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 01:54:38,391 INFO L87 Difference]: Start difference. First operand 854 states and 1005 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-16 01:54:39,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:54:39,009 INFO L93 Difference]: Finished difference Result 781 states and 933 transitions. [2021-10-16 01:54:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 01:54:39,010 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-16 01:54:39,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:54:39,014 INFO L225 Difference]: With dead ends: 781 [2021-10-16 01:54:39,014 INFO L226 Difference]: Without dead ends: 781 [2021-10-16 01:54:39,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 01:54:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-10-16 01:54:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 779. [2021-10-16 01:54:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 423 states have (on average 2.198581560283688) internal successors, (930), 778 states have internal predecessors, (930), 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-16 01:54:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 930 transitions. [2021-10-16 01:54:39,042 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 930 transitions. Word has length 6 [2021-10-16 01:54:39,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:54:39,043 INFO L470 AbstractCegarLoop]: Abstraction has 779 states and 930 transitions. [2021-10-16 01:54:39,043 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-16 01:54:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 930 transitions. [2021-10-16 01:54:39,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-16 01:54:39,043 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:39,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-16 01:54:39,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-16 01:54:39,044 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:39,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:39,044 INFO L82 PathProgramCache]: Analyzing trace with hash -368574073, now seen corresponding path program 1 times [2021-10-16 01:54:39,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:39,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260632667] [2021-10-16 01:54:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:39,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:54:39,124 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-16 01:54:39,125 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:54:39,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260632667] [2021-10-16 01:54:39,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260632667] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:54:39,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:54:39,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 01:54:39,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374571924] [2021-10-16 01:54:39,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 01:54:39,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:54:39,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 01:54:39,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 01:54:39,127 INFO L87 Difference]: Start difference. First operand 779 states and 930 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-16 01:54:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:54:40,183 INFO L93 Difference]: Finished difference Result 804 states and 870 transitions. [2021-10-16 01:54:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 01:54:40,184 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-16 01:54:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:54:40,189 INFO L225 Difference]: With dead ends: 804 [2021-10-16 01:54:40,189 INFO L226 Difference]: Without dead ends: 804 [2021-10-16 01:54:40,189 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-16 01:54:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2021-10-16 01:54:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 672. [2021-10-16 01:54:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 423 states have (on average 1.9432624113475176) internal successors, (822), 671 states have internal predecessors, (822), 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-16 01:54:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 822 transitions. [2021-10-16 01:54:40,209 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 822 transitions. Word has length 7 [2021-10-16 01:54:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:54:40,209 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 822 transitions. [2021-10-16 01:54:40,209 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-16 01:54:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 822 transitions. [2021-10-16 01:54:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-16 01:54:40,210 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:40,210 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-16 01:54:40,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-16 01:54:40,210 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:40,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:40,211 INFO L82 PathProgramCache]: Analyzing trace with hash -368574074, now seen corresponding path program 1 times [2021-10-16 01:54:40,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:40,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497069605] [2021-10-16 01:54:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:40,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:54:40,281 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-16 01:54:40,281 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:54:40,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497069605] [2021-10-16 01:54:40,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497069605] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:54:40,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:54:40,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 01:54:40,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723264703] [2021-10-16 01:54:40,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 01:54:40,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:54:40,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 01:54:40,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 01:54:40,284 INFO L87 Difference]: Start difference. First operand 672 states and 822 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-16 01:54:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:54:41,098 INFO L93 Difference]: Finished difference Result 699 states and 765 transitions. [2021-10-16 01:54:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 01:54:41,099 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-16 01:54:41,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:54:41,103 INFO L225 Difference]: With dead ends: 699 [2021-10-16 01:54:41,103 INFO L226 Difference]: Without dead ends: 699 [2021-10-16 01:54:41,103 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-16 01:54:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-10-16 01:54:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 567. [2021-10-16 01:54:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 423 states have (on average 1.6950354609929077) internal successors, (717), 566 states have internal predecessors, (717), 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-16 01:54:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 717 transitions. [2021-10-16 01:54:41,118 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 717 transitions. Word has length 7 [2021-10-16 01:54:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:54:41,119 INFO L470 AbstractCegarLoop]: Abstraction has 567 states and 717 transitions. [2021-10-16 01:54:41,119 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-16 01:54:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 717 transitions. [2021-10-16 01:54:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-16 01:54:41,120 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:41,120 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 01:54:41,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-16 01:54:41,120 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:41,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1840159281, now seen corresponding path program 1 times [2021-10-16 01:54:41,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:41,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969927348] [2021-10-16 01:54:41,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:41,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:54:41,257 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-16 01:54:41,257 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:54:41,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969927348] [2021-10-16 01:54:41,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969927348] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:54:41,258 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:54:41,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-16 01:54:41,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999931019] [2021-10-16 01:54:41,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 01:54:41,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:54:41,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 01:54:41,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-16 01:54:41,260 INFO L87 Difference]: Start difference. First operand 567 states and 717 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-16 01:54:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:54:42,030 INFO L93 Difference]: Finished difference Result 582 states and 734 transitions. [2021-10-16 01:54:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-16 01:54:42,030 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-16 01:54:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:54:42,034 INFO L225 Difference]: With dead ends: 582 [2021-10-16 01:54:42,034 INFO L226 Difference]: Without dead ends: 582 [2021-10-16 01:54:42,034 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.6ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-10-16 01:54:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-10-16 01:54:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 572. [2021-10-16 01:54:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 428 states have (on average 1.689252336448598) internal successors, (723), 571 states have internal predecessors, (723), 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-16 01:54:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 723 transitions. [2021-10-16 01:54:42,048 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 723 transitions. Word has length 14 [2021-10-16 01:54:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:54:42,048 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 723 transitions. [2021-10-16 01:54:42,049 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-16 01:54:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 723 transitions. [2021-10-16 01:54:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-16 01:54:42,050 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:42,050 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 01:54:42,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-16 01:54:42,050 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:42,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:42,051 INFO L82 PathProgramCache]: Analyzing trace with hash -112463990, now seen corresponding path program 1 times [2021-10-16 01:54:42,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:42,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527314873] [2021-10-16 01:54:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:42,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:54:42,245 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-16 01:54:42,246 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:54:42,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527314873] [2021-10-16 01:54:42,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527314873] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:54:42,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:54:42,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-16 01:54:42,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332305544] [2021-10-16 01:54:42,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-16 01:54:42,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:54:42,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-16 01:54:42,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-16 01:54:42,249 INFO L87 Difference]: Start difference. First operand 572 states and 723 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-16 01:54:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:54:43,734 INFO L93 Difference]: Finished difference Result 706 states and 772 transitions. [2021-10-16 01:54:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 01:54:43,735 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-16 01:54:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:54:43,739 INFO L225 Difference]: With dead ends: 706 [2021-10-16 01:54:43,739 INFO L226 Difference]: Without dead ends: 706 [2021-10-16 01:54:43,740 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 88.2ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-16 01:54:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2021-10-16 01:54:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 574. [2021-10-16 01:54:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 430 states have (on average 1.686046511627907) internal successors, (725), 573 states have internal predecessors, (725), 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-16 01:54:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 725 transitions. [2021-10-16 01:54:43,756 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 725 transitions. Word has length 15 [2021-10-16 01:54:43,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:54:43,757 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 725 transitions. [2021-10-16 01:54:43,757 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-16 01:54:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 725 transitions. [2021-10-16 01:54:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-16 01:54:43,759 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:43,759 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-16 01:54:43,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-16 01:54:43,760 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:43,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:43,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1404439870, now seen corresponding path program 1 times [2021-10-16 01:54:43,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:43,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642420623] [2021-10-16 01:54:43,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:43,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:54:44,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-16 01:54:44,203 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:54:44,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642420623] [2021-10-16 01:54:44,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642420623] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:54:44,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:54:44,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-16 01:54:44,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027497468] [2021-10-16 01:54:44,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-16 01:54:44,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:54:44,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-16 01:54:44,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-10-16 01:54:44,205 INFO L87 Difference]: Start difference. First operand 574 states and 725 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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-16 01:54:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:54:45,984 INFO L93 Difference]: Finished difference Result 898 states and 978 transitions. [2021-10-16 01:54:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-16 01:54:45,985 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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-16 01:54:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:54:45,990 INFO L225 Difference]: With dead ends: 898 [2021-10-16 01:54:45,990 INFO L226 Difference]: Without dead ends: 898 [2021-10-16 01:54:45,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 245.7ms TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-10-16 01:54:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-10-16 01:54:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 559. [2021-10-16 01:54:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 430 states have (on average 1.6511627906976745) internal successors, (710), 558 states have internal predecessors, (710), 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-16 01:54:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 710 transitions. [2021-10-16 01:54:46,008 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 710 transitions. Word has length 26 [2021-10-16 01:54:46,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:54:46,009 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 710 transitions. [2021-10-16 01:54:46,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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-16 01:54:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 710 transitions. [2021-10-16 01:54:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-16 01:54:46,010 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:46,011 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-16 01:54:46,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-16 01:54:46,011 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:46,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:46,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1404439871, now seen corresponding path program 1 times [2021-10-16 01:54:46,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:46,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460610719] [2021-10-16 01:54:46,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:46,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:54:46,474 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-16 01:54:46,474 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:54:46,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460610719] [2021-10-16 01:54:46,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460610719] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:54:46,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:54:46,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-16 01:54:46,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32071510] [2021-10-16 01:54:46,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-16 01:54:46,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:54:46,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-16 01:54:46,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-16 01:54:46,476 INFO L87 Difference]: Start difference. First operand 559 states and 710 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-16 01:54:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:54:48,323 INFO L93 Difference]: Finished difference Result 676 states and 742 transitions. [2021-10-16 01:54:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 01:54:48,324 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-16 01:54:48,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:54:48,328 INFO L225 Difference]: With dead ends: 676 [2021-10-16 01:54:48,328 INFO L226 Difference]: Without dead ends: 676 [2021-10-16 01:54:48,328 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 279.2ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-10-16 01:54:48,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-10-16 01:54:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 544. [2021-10-16 01:54:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 430 states have (on average 1.6162790697674418) internal successors, (695), 543 states have internal predecessors, (695), 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-16 01:54:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 695 transitions. [2021-10-16 01:54:48,341 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 695 transitions. Word has length 26 [2021-10-16 01:54:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:54:48,341 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 695 transitions. [2021-10-16 01:54:48,342 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-16 01:54:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 695 transitions. [2021-10-16 01:54:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-10-16 01:54:48,347 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:48,348 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] [2021-10-16 01:54:48,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-16 01:54:48,348 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:48,349 INFO L82 PathProgramCache]: Analyzing trace with hash -514564473, now seen corresponding path program 1 times [2021-10-16 01:54:48,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:48,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462259014] [2021-10-16 01:54:48,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:48,349 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:54:48,441 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-16 01:54:48,441 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:54:48,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462259014] [2021-10-16 01:54:48,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462259014] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:54:48,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:54:48,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 01:54:48,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183060199] [2021-10-16 01:54:48,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 01:54:48,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:54:48,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 01:54:48,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 01:54:48,444 INFO L87 Difference]: Start difference. First operand 544 states and 695 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-16 01:54:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:54:48,552 INFO L93 Difference]: Finished difference Result 559 states and 710 transitions. [2021-10-16 01:54:48,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 01:54:48,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 150 [2021-10-16 01:54:48,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:54:48,556 INFO L225 Difference]: With dead ends: 559 [2021-10-16 01:54:48,556 INFO L226 Difference]: Without dead ends: 559 [2021-10-16 01:54:48,556 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 01:54:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-10-16 01:54:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2021-10-16 01:54:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 445 states have (on average 1.595505617977528) internal successors, (710), 558 states have internal predecessors, (710), 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-16 01:54:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 710 transitions. [2021-10-16 01:54:48,569 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 710 transitions. Word has length 150 [2021-10-16 01:54:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:54:48,569 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 710 transitions. [2021-10-16 01:54:48,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-16 01:54:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 710 transitions. [2021-10-16 01:54:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-10-16 01:54:48,572 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:48,572 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] [2021-10-16 01:54:48,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-16 01:54:48,572 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:48,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:48,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1235563742, now seen corresponding path program 1 times [2021-10-16 01:54:48,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:48,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511915348] [2021-10-16 01:54:48,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:48,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:54:48,940 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-16 01:54:48,941 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:54:48,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511915348] [2021-10-16 01:54:48,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511915348] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:54:48,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:54:48,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-16 01:54:48,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642986536] [2021-10-16 01:54:48,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-16 01:54:48,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:54:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-16 01:54:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-16 01:54:48,943 INFO L87 Difference]: Start difference. First operand 559 states and 710 transitions. Second operand has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 14 states have internal predecessors, (164), 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-16 01:54:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:54:50,216 INFO L93 Difference]: Finished difference Result 608 states and 646 transitions. [2021-10-16 01:54:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 01:54:50,217 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 14 states have internal predecessors, (164), 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 164 [2021-10-16 01:54:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:54:50,220 INFO L225 Difference]: With dead ends: 608 [2021-10-16 01:54:50,220 INFO L226 Difference]: Without dead ends: 608 [2021-10-16 01:54:50,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 146.8ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-10-16 01:54:50,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-10-16 01:54:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 473. [2021-10-16 01:54:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 359 states have (on average 1.6545961002785516) internal successors, (594), 472 states have internal predecessors, (594), 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-16 01:54:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 594 transitions. [2021-10-16 01:54:50,232 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 594 transitions. Word has length 164 [2021-10-16 01:54:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:54:50,232 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 594 transitions. [2021-10-16 01:54:50,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 14 states have internal predecessors, (164), 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-16 01:54:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 594 transitions. [2021-10-16 01:54:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-16 01:54:50,234 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:54:50,234 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-16 01:54:50,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-16 01:54:50,235 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:54:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:54:50,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1047151092, now seen corresponding path program 1 times [2021-10-16 01:54:50,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:54:50,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624485346] [2021-10-16 01:54:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:54:50,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:54:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:57:27,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-16 01:57:27,888 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:57:27,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624485346] [2021-10-16 01:57:27,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624485346] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:57:27,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:57:27,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-10-16 01:57:27,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306408596] [2021-10-16 01:57:27,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-10-16 01:57:27,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:57:27,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-10-16 01:57:27,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2021-10-16 01:57:27,891 INFO L87 Difference]: Start difference. First operand 473 states and 594 transitions. Second operand has 38 states, 37 states have (on average 4.8108108108108105) internal successors, (178), 37 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-16 01:57:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:57:29,691 INFO L93 Difference]: Finished difference Result 594 states and 631 transitions. [2021-10-16 01:57:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-16 01:57:29,691 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 4.8108108108108105) internal successors, (178), 37 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-16 01:57:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:57:29,695 INFO L225 Difference]: With dead ends: 594 [2021-10-16 01:57:29,695 INFO L226 Difference]: Without dead ends: 594 [2021-10-16 01:57:29,696 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 23 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1154.4ms TimeCoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2021-10-16 01:57:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-10-16 01:57:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 472. [2021-10-16 01:57:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 364 states have (on average 1.6428571428571428) internal successors, (598), 471 states have internal predecessors, (598), 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-16 01:57:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 598 transitions. [2021-10-16 01:57:29,707 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 598 transitions. Word has length 178 [2021-10-16 01:57:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:57:29,708 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 598 transitions. [2021-10-16 01:57:29,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.8108108108108105) internal successors, (178), 37 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-16 01:57:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 598 transitions. [2021-10-16 01:57:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-16 01:57:29,710 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:57:29,711 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-16 01:57:29,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-16 01:57:29,711 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:57:29,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:57:29,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1047151091, now seen corresponding path program 1 times [2021-10-16 01:57:29,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:57:29,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103550646] [2021-10-16 01:57:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:57:29,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:57:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:58:13,063 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-16 01:58:13,063 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:58:13,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103550646] [2021-10-16 01:58:13,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103550646] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:58:13,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:58:13,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-10-16 01:58:13,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791963292] [2021-10-16 01:58:13,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-10-16 01:58:13,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:58:13,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-10-16 01:58:13,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1129, Unknown=0, NotChecked=0, Total=1482 [2021-10-16 01:58:13,067 INFO L87 Difference]: Start difference. First operand 472 states and 598 transitions. Second operand has 39 states, 38 states have (on average 4.684210526315789) internal successors, (178), 38 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-16 01:58:15,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:58:15,204 INFO L93 Difference]: Finished difference Result 583 states and 620 transitions. [2021-10-16 01:58:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-16 01:58:15,204 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 4.684210526315789) internal successors, (178), 38 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-16 01:58:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:58:15,207 INFO L225 Difference]: With dead ends: 583 [2021-10-16 01:58:15,207 INFO L226 Difference]: Without dead ends: 583 [2021-10-16 01:58:15,208 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 37 SyntacticMatches, 47 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 2033.0ms TimeCoverageRelationStatistics Valid=453, Invalid=1269, Unknown=0, NotChecked=0, Total=1722 [2021-10-16 01:58:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-10-16 01:58:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 476. [2021-10-16 01:58:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 369 states have (on average 1.6178861788617886) internal successors, (597), 475 states have internal predecessors, (597), 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-16 01:58:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 597 transitions. [2021-10-16 01:58:15,218 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 597 transitions. Word has length 178 [2021-10-16 01:58:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:58:15,219 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 597 transitions. [2021-10-16 01:58:15,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.684210526315789) internal successors, (178), 38 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-16 01:58:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 597 transitions. [2021-10-16 01:58:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-10-16 01:58:15,221 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:58:15,222 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-16 01:58:15,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-16 01:58:15,222 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr398REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:58:15,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:58:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1289439588, now seen corresponding path program 1 times [2021-10-16 01:58:15,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:58:15,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078958318] [2021-10-16 01:58:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:58:15,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:58:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:58:15,395 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-16 01:58:15,396 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:58:15,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078958318] [2021-10-16 01:58:15,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078958318] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:58:15,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:58:15,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 01:58:15,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708560461] [2021-10-16 01:58:15,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 01:58:15,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:58:15,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 01:58:15,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 01:58:15,398 INFO L87 Difference]: Start difference. First operand 476 states and 597 transitions. Second operand has 4 states, 3 states have (on average 60.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-16 01:58:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:58:15,942 INFO L93 Difference]: Finished difference Result 666 states and 711 transitions. [2021-10-16 01:58:15,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 01:58:15,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 60.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-16 01:58:15,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:58:15,945 INFO L225 Difference]: With dead ends: 666 [2021-10-16 01:58:15,946 INFO L226 Difference]: Without dead ends: 666 [2021-10-16 01:58:15,946 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 01:58:15,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-10-16 01:58:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 471. [2021-10-16 01:58:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 369 states have (on average 1.5880758807588076) internal successors, (586), 470 states have internal predecessors, (586), 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-16 01:58:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 586 transitions. [2021-10-16 01:58:15,960 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 586 transitions. Word has length 180 [2021-10-16 01:58:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:58:15,960 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 586 transitions. [2021-10-16 01:58:15,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 60.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-16 01:58:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 586 transitions. [2021-10-16 01:58:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-10-16 01:58:15,963 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:58:15,963 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-16 01:58:15,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-16 01:58:15,963 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr399REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:58:15,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:58:15,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1289439587, now seen corresponding path program 1 times [2021-10-16 01:58:15,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:58:15,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387841812] [2021-10-16 01:58:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:58:15,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:58:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:58:21,896 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-16 01:58:21,896 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:58:21,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387841812] [2021-10-16 01:58:21,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387841812] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:58:21,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:58:21,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-10-16 01:58:21,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836266903] [2021-10-16 01:58:21,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-16 01:58:21,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:58:21,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-16 01:58:21,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2021-10-16 01:58:21,899 INFO L87 Difference]: Start difference. First operand 471 states and 586 transitions. Second operand has 30 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 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-16 01:58:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:58:23,582 INFO L93 Difference]: Finished difference Result 678 states and 722 transitions. [2021-10-16 01:58:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-16 01:58:23,583 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 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-16 01:58:23,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:58:23,587 INFO L225 Difference]: With dead ends: 678 [2021-10-16 01:58:23,587 INFO L226 Difference]: Without dead ends: 678 [2021-10-16 01:58:23,588 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 58 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 1007.2ms TimeCoverageRelationStatistics Valid=334, Invalid=926, Unknown=0, NotChecked=0, Total=1260 [2021-10-16 01:58:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-10-16 01:58:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 471. [2021-10-16 01:58:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 369 states have (on average 1.5718157181571815) internal successors, (580), 470 states have internal predecessors, (580), 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-16 01:58:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 580 transitions. [2021-10-16 01:58:23,600 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 580 transitions. Word has length 180 [2021-10-16 01:58:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:58:23,601 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 580 transitions. [2021-10-16 01:58:23,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 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-16 01:58:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 580 transitions. [2021-10-16 01:58:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-16 01:58:23,603 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:58:23,604 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-16 01:58:23,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-16 01:58:23,604 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr402REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:58:23,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:58:23,605 INFO L82 PathProgramCache]: Analyzing trace with hash 504424274, now seen corresponding path program 1 times [2021-10-16 01:58:23,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:58:23,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428555232] [2021-10-16 01:58:23,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:58:23,605 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:58:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:58:38,881 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-16 01:58:38,881 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:58:38,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428555232] [2021-10-16 01:58:38,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428555232] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:58:38,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:58:38,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-10-16 01:58:38,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523540023] [2021-10-16 01:58:38,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-10-16 01:58:38,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:58:38,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-10-16 01:58:38,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1415, Unknown=0, NotChecked=0, Total=1640 [2021-10-16 01:58:38,884 INFO L87 Difference]: Start difference. First operand 471 states and 580 transitions. Second operand has 41 states, 41 states have (on average 4.463414634146342) internal successors, (183), 40 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-16 01:58:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:58:45,353 INFO L93 Difference]: Finished difference Result 760 states and 808 transitions. [2021-10-16 01:58:45,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-16 01:58:45,354 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.463414634146342) internal successors, (183), 40 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-16 01:58:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:58:45,362 INFO L225 Difference]: With dead ends: 760 [2021-10-16 01:58:45,362 INFO L226 Difference]: Without dead ends: 760 [2021-10-16 01:58:45,364 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 26 SyntacticMatches, 60 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 5174.4ms TimeCoverageRelationStatistics Valid=681, Invalid=3351, Unknown=0, NotChecked=0, Total=4032 [2021-10-16 01:58:45,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2021-10-16 01:58:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 469. [2021-10-16 01:58:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 367 states have (on average 1.5667574931880108) internal successors, (575), 468 states have internal predecessors, (575), 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-16 01:58:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 575 transitions. [2021-10-16 01:58:45,376 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 575 transitions. Word has length 183 [2021-10-16 01:58:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:58:45,376 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 575 transitions. [2021-10-16 01:58:45,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.463414634146342) internal successors, (183), 40 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-16 01:58:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 575 transitions. [2021-10-16 01:58:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-10-16 01:58:45,379 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:58:45,379 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] [2021-10-16 01:58:45,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-16 01:58:45,380 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr406REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:58:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:58:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash -570928098, now seen corresponding path program 1 times [2021-10-16 01:58:45,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:58:45,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897153289] [2021-10-16 01:58:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:58:45,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:58:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:58:45,526 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-16 01:58:45,526 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:58:45,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897153289] [2021-10-16 01:58:45,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897153289] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:58:45,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:58:45,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 01:58:45,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124030937] [2021-10-16 01:58:45,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 01:58:45,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:58:45,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 01:58:45,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 01:58:45,530 INFO L87 Difference]: Start difference. First operand 469 states and 575 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-16 01:58:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:58:45,552 INFO L93 Difference]: Finished difference Result 566 states and 673 transitions. [2021-10-16 01:58:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 01:58:45,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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 185 [2021-10-16 01:58:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:58:45,556 INFO L225 Difference]: With dead ends: 566 [2021-10-16 01:58:45,556 INFO L226 Difference]: Without dead ends: 566 [2021-10-16 01:58:45,557 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 01:58:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-10-16 01:58:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 468. [2021-10-16 01:58:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 366 states have (on average 1.5546448087431695) internal successors, (569), 467 states have internal predecessors, (569), 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-16 01:58:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 569 transitions. [2021-10-16 01:58:45,568 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 569 transitions. Word has length 185 [2021-10-16 01:58:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:58:45,569 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 569 transitions. [2021-10-16 01:58:45,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-16 01:58:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 569 transitions. [2021-10-16 01:58:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-16 01:58:45,571 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:58:45,572 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, 1] [2021-10-16 01:58:45,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-16 01:58:45,572 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr412REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:58:45,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:58:45,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1105424109, now seen corresponding path program 1 times [2021-10-16 01:58:45,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:58:45,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351021252] [2021-10-16 01:58:45,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:58:45,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:58:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:58:45,711 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-16 01:58:45,712 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:58:45,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351021252] [2021-10-16 01:58:45,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351021252] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:58:45,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:58:45,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 01:58:45,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308453747] [2021-10-16 01:58:45,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 01:58:45,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:58:45,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 01:58:45,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 01:58:45,715 INFO L87 Difference]: Start difference. First operand 468 states and 569 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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-16 01:58:45,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:58:45,735 INFO L93 Difference]: Finished difference Result 538 states and 636 transitions. [2021-10-16 01:58:45,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 01:58:45,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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 187 [2021-10-16 01:58:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:58:45,739 INFO L225 Difference]: With dead ends: 538 [2021-10-16 01:58:45,739 INFO L226 Difference]: Without dead ends: 538 [2021-10-16 01:58:45,740 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 01:58:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-16 01:58:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 466. [2021-10-16 01:58:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 364 states have (on average 1.5384615384615385) internal successors, (560), 465 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-16 01:58:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 560 transitions. [2021-10-16 01:58:45,748 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 560 transitions. Word has length 187 [2021-10-16 01:58:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:58:45,749 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 560 transitions. [2021-10-16 01:58:45,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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-16 01:58:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 560 transitions. [2021-10-16 01:58:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-10-16 01:58:45,751 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:58:45,752 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, 1, 1, 1] [2021-10-16 01:58:45,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-16 01:58:45,752 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:58:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:58:45,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1470022495, now seen corresponding path program 1 times [2021-10-16 01:58:45,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:58:45,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788091917] [2021-10-16 01:58:45,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:58:45,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:58:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:58:45,893 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-16 01:58:45,893 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:58:45,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788091917] [2021-10-16 01:58:45,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788091917] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:58:45,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:58:45,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 01:58:45,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063214399] [2021-10-16 01:58:45,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 01:58:45,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:58:45,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 01:58:45,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 01:58:45,896 INFO L87 Difference]: Start difference. First operand 466 states and 560 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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-16 01:58:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:58:45,915 INFO L93 Difference]: Finished difference Result 503 states and 590 transitions. [2021-10-16 01:58:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 01:58:45,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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 189 [2021-10-16 01:58:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:58:45,919 INFO L225 Difference]: With dead ends: 503 [2021-10-16 01:58:45,919 INFO L226 Difference]: Without dead ends: 503 [2021-10-16 01:58:45,920 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 01:58:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-10-16 01:58:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 463. [2021-10-16 01:58:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 361 states have (on average 1.518005540166205) internal successors, (548), 462 states have internal predecessors, (548), 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-16 01:58:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 548 transitions. [2021-10-16 01:58:45,928 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 548 transitions. Word has length 189 [2021-10-16 01:58:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:58:45,929 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 548 transitions. [2021-10-16 01:58:45,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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-16 01:58:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 548 transitions. [2021-10-16 01:58:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-10-16 01:58:45,931 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:58:45,932 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, 1, 1, 1, 1, 1] [2021-10-16 01:58:45,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-16 01:58:45,932 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr430REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:58:45,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:58:45,933 INFO L82 PathProgramCache]: Analyzing trace with hash -335383276, now seen corresponding path program 1 times [2021-10-16 01:58:45,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:58:45,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977928909] [2021-10-16 01:58:45,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:58:45,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:58:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:58:46,096 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-16 01:58:46,096 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:58:46,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977928909] [2021-10-16 01:58:46,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977928909] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:58:46,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:58:46,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 01:58:46,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335296603] [2021-10-16 01:58:46,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 01:58:46,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:58:46,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 01:58:46,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 01:58:46,100 INFO L87 Difference]: Start difference. First operand 463 states and 548 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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-16 01:58:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:58:46,117 INFO L93 Difference]: Finished difference Result 461 states and 535 transitions. [2021-10-16 01:58:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 01:58:46,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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 191 [2021-10-16 01:58:46,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:58:46,120 INFO L225 Difference]: With dead ends: 461 [2021-10-16 01:58:46,121 INFO L226 Difference]: Without dead ends: 461 [2021-10-16 01:58:46,121 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 01:58:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-10-16 01:58:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2021-10-16 01:58:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 357 states have (on average 1.4929971988795518) internal successors, (533), 458 states have internal predecessors, (533), 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-16 01:58:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 533 transitions. [2021-10-16 01:58:46,130 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 533 transitions. Word has length 191 [2021-10-16 01:58:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:58:46,130 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 533 transitions. [2021-10-16 01:58:46,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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-16 01:58:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 533 transitions. [2021-10-16 01:58:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-10-16 01:58:46,133 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:58:46,133 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 01:58:46,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-16 01:58:46,134 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr443ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:58:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:58:46,134 INFO L82 PathProgramCache]: Analyzing trace with hash -440958066, now seen corresponding path program 1 times [2021-10-16 01:58:46,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:58:46,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183222857] [2021-10-16 01:58:46,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:58:46,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:58:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:58:52,474 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-16 01:58:52,474 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:58:52,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183222857] [2021-10-16 01:58:52,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183222857] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:58:52,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:58:52,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-10-16 01:58:52,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219533235] [2021-10-16 01:58:52,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-10-16 01:58:52,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:58:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-10-16 01:58:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=973, Unknown=0, NotChecked=0, Total=1260 [2021-10-16 01:58:52,477 INFO L87 Difference]: Start difference. First operand 459 states and 533 transitions. Second operand has 36 states, 35 states have (on average 5.542857142857143) internal successors, (194), 35 states have internal predecessors, (194), 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-16 01:58:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:58:54,559 INFO L93 Difference]: Finished difference Result 517 states and 550 transitions. [2021-10-16 01:58:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-16 01:58:54,560 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 5.542857142857143) internal successors, (194), 35 states have internal predecessors, (194), 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 194 [2021-10-16 01:58:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:58:54,562 INFO L225 Difference]: With dead ends: 517 [2021-10-16 01:58:54,562 INFO L226 Difference]: Without dead ends: 517 [2021-10-16 01:58:54,562 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 55 SyntacticMatches, 31 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 1143.9ms TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2021-10-16 01:58:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-10-16 01:58:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 464. [2021-10-16 01:58:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 362 states have (on average 1.4861878453038675) internal successors, (538), 463 states have internal predecessors, (538), 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-16 01:58:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 538 transitions. [2021-10-16 01:58:54,571 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 538 transitions. Word has length 194 [2021-10-16 01:58:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:58:54,571 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 538 transitions. [2021-10-16 01:58:54,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 5.542857142857143) internal successors, (194), 35 states have internal predecessors, (194), 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-16 01:58:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 538 transitions. [2021-10-16 01:58:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-10-16 01:58:54,574 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:58:54,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 01:58:54,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-16 01:58:54,575 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr450REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:58:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:58:54,575 INFO L82 PathProgramCache]: Analyzing trace with hash -793231668, now seen corresponding path program 1 times [2021-10-16 01:58:54,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:58:54,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580351166] [2021-10-16 01:58:54,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:58:54,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:58:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:58:54,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-16 01:58:54,721 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:58:54,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580351166] [2021-10-16 01:58:54,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580351166] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 01:58:54,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:58:54,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 01:58:54,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8024261] [2021-10-16 01:58:54,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 01:58:54,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 01:58:54,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 01:58:54,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 01:58:54,724 INFO L87 Difference]: Start difference. First operand 464 states and 538 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-16 01:58:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:58:54,738 INFO L93 Difference]: Finished difference Result 434 states and 456 transitions. [2021-10-16 01:58:54,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 01:58:54,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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 195 [2021-10-16 01:58:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:58:54,741 INFO L225 Difference]: With dead ends: 434 [2021-10-16 01:58:54,741 INFO L226 Difference]: Without dead ends: 434 [2021-10-16 01:58:54,742 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-16 01:58:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-10-16 01:58:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 418. [2021-10-16 01:58:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 316 states have (on average 1.3924050632911393) internal successors, (440), 417 states have internal predecessors, (440), 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-16 01:58:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 440 transitions. [2021-10-16 01:58:54,750 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 440 transitions. Word has length 195 [2021-10-16 01:58:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:58:54,750 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 440 transitions. [2021-10-16 01:58:54,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-16 01:58:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 440 transitions. [2021-10-16 01:58:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-16 01:58:54,753 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:58:54,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 01:58:54,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-16 01:58:54,754 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr398REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:58:54,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:58:54,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1724293752, now seen corresponding path program 1 times [2021-10-16 01:58:54,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 01:58:54,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110796779] [2021-10-16 01:58:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:58:54,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 01:58:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:59:08,507 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-16 01:59:08,507 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 01:59:08,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110796779] [2021-10-16 01:59:08,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110796779] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 01:59:08,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662724635] [2021-10-16 01:59:08,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:59:08,508 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 01:59:08,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 01:59:08,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 01:59:08,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-16 01:59:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:59:10,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 1373 conjuncts, 374 conjunts are in the unsatisfiable core [2021-10-16 01:59:10,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 01:59:11,091 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-16 01:59:11,272 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-10-16 01:59:11,273 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-16 01:59:11,599 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-16 01:59:11,714 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-16 01:59:11,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:11,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-16 01:59:11,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:11,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-10-16 01:59:11,877 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-16 01:59:12,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:12,057 INFO L354 Elim1Store]: treesize reduction 184, result has 14.8 percent of original size [2021-10-16 01:59:12,057 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 132 treesize of output 108 [2021-10-16 01:59:12,088 INFO L354 Elim1Store]: treesize reduction 76, result has 21.6 percent of original size [2021-10-16 01:59:12,089 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 104 [2021-10-16 01:59:12,407 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-10-16 01:59:12,408 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-16 01:59:12,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:12,669 INFO L354 Elim1Store]: treesize reduction 212, result has 12.8 percent of original size [2021-10-16 01:59:12,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 145 treesize of output 121 [2021-10-16 01:59:12,711 INFO L354 Elim1Store]: treesize reduction 140, result has 16.2 percent of original size [2021-10-16 01:59:12,712 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 142 treesize of output 118 [2021-10-16 01:59:13,286 INFO L354 Elim1Store]: treesize reduction 124, result has 15.6 percent of original size [2021-10-16 01:59:13,286 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 141 treesize of output 128 [2021-10-16 01:59:13,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:13,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:13,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:13,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:13,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:13,322 INFO L354 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2021-10-16 01:59:13,323 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 96 treesize of output 83 [2021-10-16 01:59:13,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:13,522 INFO L354 Elim1Store]: treesize reduction 212, result has 12.8 percent of original size [2021-10-16 01:59:13,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 128 [2021-10-16 01:59:13,551 INFO L354 Elim1Store]: treesize reduction 124, result has 15.6 percent of original size [2021-10-16 01:59:13,552 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 124 [2021-10-16 01:59:13,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 01:59:13,830 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-16 01:59:14,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 01:59:14,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,040 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-10-16 01:59:14,040 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 95 treesize of output 71 [2021-10-16 01:59:14,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,239 INFO L354 Elim1Store]: treesize reduction 93, result has 8.8 percent of original size [2021-10-16 01:59:14,240 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 124 treesize of output 72 [2021-10-16 01:59:14,449 INFO L354 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-10-16 01:59:14,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-10-16 01:59:14,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:14,710 INFO L354 Elim1Store]: treesize reduction 138, result has 19.8 percent of original size [2021-10-16 01:59:14,710 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 108 treesize of output 86 [2021-10-16 01:59:15,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:15,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:15,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:15,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:15,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:15,416 INFO L354 Elim1Store]: treesize reduction 138, result has 19.8 percent of original size [2021-10-16 01:59:15,417 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-16 01:59:15,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:15,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:15,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:15,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:15,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:15,620 INFO L354 Elim1Store]: treesize reduction 140, result has 18.6 percent of original size [2021-10-16 01:59:15,621 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-16 01:59:16,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:16,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 01:59:16,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:16,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:16,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:16,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:16,282 INFO L354 Elim1Store]: treesize reduction 276, result has 18.1 percent of original size [2021-10-16 01:59:16,282 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-16 01:59:16,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:16,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:16,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:16,603 INFO L354 Elim1Store]: treesize reduction 200, result has 8.7 percent of original size [2021-10-16 01:59:16,604 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-16 01:59:16,881 INFO L354 Elim1Store]: treesize reduction 148, result has 33.0 percent of original size [2021-10-16 01:59:16,881 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-16 01:59:17,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:17,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:17,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:17,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:17,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:17,240 INFO L354 Elim1Store]: treesize reduction 256, result has 11.4 percent of original size [2021-10-16 01:59:17,241 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-16 01:59:18,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:18,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:18,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:18,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:18,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:18,258 INFO L354 Elim1Store]: treesize reduction 256, result has 11.4 percent of original size [2021-10-16 01:59:18,258 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-16 01:59:18,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:18,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:18,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:18,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:18,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:18,672 INFO L354 Elim1Store]: treesize reduction 256, result has 11.4 percent of original size [2021-10-16 01:59:18,673 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-16 01:59:19,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:19,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 01:59:19,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:19,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:19,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:19,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:19,537 INFO L354 Elim1Store]: treesize reduction 388, result has 17.4 percent of original size [2021-10-16 01:59:19,537 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 236 treesize of output 166 [2021-10-16 01:59:20,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:20,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:20,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:20,438 INFO L354 Elim1Store]: treesize reduction 324, result has 8.0 percent of original size [2021-10-16 01:59:20,439 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 291 treesize of output 139 [2021-10-16 01:59:20,976 INFO L354 Elim1Store]: treesize reduction 270, result has 32.8 percent of original size [2021-10-16 01:59:20,977 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-16 01:59:21,175 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: No corresponding IProgramVar for |v_ULTIMATE.start_append_#t~mem62.offset_143| [2021-10-16 01:59:21,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1828982135] [2021-10-16 01:59:21,203 INFO L159 IcfgInterpreter]: Started Sifa with 196 locations of interest [2021-10-16 01:59:21,204 INFO L166 IcfgInterpreter]: Building call graph [2021-10-16 01:59:21,209 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-16 01:59:21,214 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-16 01:59:21,215 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-16 01:59:21,738 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 01:59:21,739 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 01:59:21,740 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 01:59:21,741 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-16 01:59:21,742 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 01:59:21,743 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 01:59:21,743 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-16 01:59:21,744 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-16 01:59:21,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:21,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 01:59:21,786 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-10-16 01:59:21,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 26 [2021-10-16 01:59:21,788 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 01:59:21,789 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-10-16 01:59:21,790 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 01:59:21,792 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-10-16 01:59:21,793 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-16 01:59:21,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 01:59:21,811 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 01:59:21,812 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 01:59:21,813 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-10-16 01:59:21,813 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-16 01:59:21,813 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:98 [2021-10-16 01:59:21,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-16 01:59:22,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 01:59:22,015 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#length_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-16 01:59:22,019 INFO L168 Benchmark]: Toolchain (without parser) took 290046.31 ms. Allocated memory was 138.4 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 103.4 MB in the beginning and 992.8 MB in the end (delta: -889.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. [2021-10-16 01:59:22,019 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 88.1 MB. Free memory was 44.5 MB in the beginning and 44.4 MB in the end (delta: 45.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 01:59:22,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.58 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 104.1 MB in the end (delta: -921.0 kB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-16 01:59:22,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.52 ms. Allocated memory is still 138.4 MB. Free memory was 104.1 MB in the beginning and 99.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 01:59:22,020 INFO L168 Benchmark]: Boogie Preprocessor took 121.90 ms. Allocated memory is still 138.4 MB. Free memory was 99.2 MB in the beginning and 94.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-16 01:59:22,020 INFO L168 Benchmark]: RCFGBuilder took 2408.07 ms. Allocated memory was 138.4 MB in the beginning and 172.0 MB in the end (delta: 33.6 MB). Free memory was 94.1 MB in the beginning and 134.0 MB in the end (delta: -39.9 MB). Peak memory consumption was 41.7 MB. Max. memory is 16.1 GB. [2021-10-16 01:59:22,021 INFO L168 Benchmark]: TraceAbstraction took 286905.41 ms. Allocated memory was 172.0 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 134.0 MB in the beginning and 992.8 MB in the end (delta: -858.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. [2021-10-16 01:59:22,023 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.32 ms. Allocated memory is still 88.1 MB. Free memory was 44.5 MB in the beginning and 44.4 MB in the end (delta: 45.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 494.58 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 104.1 MB in the end (delta: -921.0 kB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 110.52 ms. Allocated memory is still 138.4 MB. Free memory was 104.1 MB in the beginning and 99.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 121.90 ms. Allocated memory is still 138.4 MB. Free memory was 99.2 MB in the beginning and 94.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2408.07 ms. Allocated memory was 138.4 MB in the beginning and 172.0 MB in the end (delta: 33.6 MB). Free memory was 94.1 MB in the beginning and 134.0 MB in the end (delta: -39.9 MB). Peak memory consumption was 41.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 286905.41 ms. Allocated memory was 172.0 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 134.0 MB in the beginning and 992.8 MB in the end (delta: -858.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#length_706| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#length_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-16 01:59:22,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/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-5709675 [2021-10-16 01:59:24,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 01:59:24,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 01:59:24,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 01:59:24,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 01:59:24,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 01:59:24,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 01:59:24,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 01:59:24,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 01:59:24,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 01:59:24,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 01:59:24,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 01:59:24,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 01:59:24,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 01:59:24,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 01:59:24,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 01:59:24,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 01:59:24,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 01:59:24,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 01:59:24,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 01:59:24,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 01:59:24,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 01:59:24,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 01:59:24,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 01:59:24,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 01:59:24,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 01:59:24,476 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 01:59:24,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 01:59:24,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 01:59:24,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 01:59:24,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 01:59:24,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 01:59:24,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 01:59:24,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 01:59:24,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 01:59:24,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 01:59:24,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 01:59:24,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 01:59:24,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 01:59:24,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 01:59:24,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 01:59:24,492 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-10-16 01:59:24,541 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 01:59:24,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 01:59:24,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 01:59:24,543 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 01:59:24,544 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 01:59:24,544 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 01:59:24,544 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 01:59:24,544 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 01:59:24,545 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 01:59:24,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-16 01:59:24,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-16 01:59:24,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 01:59:24,548 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 01:59:24,548 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-16 01:59:24,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 01:59:24,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 01:59:24,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 01:59:24,549 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-16 01:59:24,549 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-16 01:59:24,550 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-16 01:59:24,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 01:59:24,550 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 01:59:24,550 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-16 01:59:24,551 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-16 01:59:24,551 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 01:59:24,551 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 01:59:24,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 01:59:24,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-16 01:59:24,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 01:59:24,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 01:59:24,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 01:59:24,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 01:59:24,553 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-16 01:59:24,553 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-16 01:59:24,553 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 01:59:24,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 01:59:24,554 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_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/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_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs 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 -> d0b5010c4e76c80e8e6103ea9fc77304c013c292 [2021-10-16 01:59:24,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 01:59:25,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 01:59:25,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 01:59:25,019 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 01:59:25,020 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 01:59:25,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2021-10-16 01:59:25,112 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/data/ab077a987/7b0a488ec5294b66a19985657e825267/FLAG7274d6b8b [2021-10-16 01:59:25,718 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 01:59:25,718 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2021-10-16 01:59:25,732 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/data/ab077a987/7b0a488ec5294b66a19985657e825267/FLAG7274d6b8b [2021-10-16 01:59:25,964 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/data/ab077a987/7b0a488ec5294b66a19985657e825267 [2021-10-16 01:59:25,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 01:59:25,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 01:59:25,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 01:59:25,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 01:59:25,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 01:59:25,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:59:25" (1/1) ... [2021-10-16 01:59:25,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9426b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:25, skipping insertion in model container [2021-10-16 01:59:25,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:59:25" (1/1) ... [2021-10-16 01:59:25,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 01:59:26,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 01:59:26,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 01:59:26,484 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 01:59:26,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 01:59:26,587 INFO L208 MainTranslator]: Completed translation [2021-10-16 01:59:26,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:26 WrapperNode [2021-10-16 01:59:26,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 01:59:26,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 01:59:26,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 01:59:26,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 01:59:26,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:26" (1/1) ... [2021-10-16 01:59:26,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:26" (1/1) ... [2021-10-16 01:59:26,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 01:59:26,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 01:59:26,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 01:59:26,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 01:59:26,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:26" (1/1) ... [2021-10-16 01:59:26,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:26" (1/1) ... [2021-10-16 01:59:26,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:26" (1/1) ... [2021-10-16 01:59:26,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:26" (1/1) ... [2021-10-16 01:59:26,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:26" (1/1) ... [2021-10-16 01:59:26,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:26" (1/1) ... [2021-10-16 01:59:26,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:26" (1/1) ... [2021-10-16 01:59:26,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 01:59:26,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 01:59:26,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 01:59:26,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 01:59:26,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:26" (1/1) ... [2021-10-16 01:59:26,832 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 01:59:26,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 01:59:26,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 01:59:26,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 01:59:26,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-10-16 01:59:26,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-16 01:59:26,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-16 01:59:26,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 01:59:26,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-16 01:59:26,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-10-16 01:59:26,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-16 01:59:26,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-16 01:59:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 01:59:26,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 01:59:30,987 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 01:59:30,994 INFO L299 CfgBuilder]: Removed 49 assume(true) statements. [2021-10-16 01:59:30,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:59:30 BoogieIcfgContainer [2021-10-16 01:59:30,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 01:59:31,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 01:59:31,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 01:59:31,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 01:59:31,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:59:25" (1/3) ... [2021-10-16 01:59:31,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c36c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:59:31, skipping insertion in model container [2021-10-16 01:59:31,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:59:26" (2/3) ... [2021-10-16 01:59:31,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c36c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:59:31, skipping insertion in model container [2021-10-16 01:59:31,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:59:30" (3/3) ... [2021-10-16 01:59:31,008 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2021-10-16 01:59:31,017 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 01:59:31,017 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 511 error locations. [2021-10-16 01:59:31,066 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 01:59:31,080 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-16 01:59:31,082 INFO L340 AbstractCegarLoop]: Starting to check reachability of 511 error locations. [2021-10-16 01:59:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 947 states, 435 states have (on average 2.317241379310345) internal successors, (1008), 946 states have internal predecessors, (1008), 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-16 01:59:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-16 01:59:31,149 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:59:31,149 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-16 01:59:31,150 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:59:31,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:59:31,160 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-10-16 01:59:31,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 01:59:31,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953590142] [2021-10-16 01:59:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:59:31,172 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 01:59:31,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 01:59:31,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 01:59:31,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-16 01:59:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:59:31,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 01:59:31,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 01:59:31,377 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-16 01:59:31,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-16 01:59:31,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 01:59:31,402 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-16 01:59:31,403 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 01:59:31,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953590142] [2021-10-16 01:59:31,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953590142] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 01:59:31,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:59:31,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-16 01:59:31,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630001602] [2021-10-16 01:59:31,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 01:59:31,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 01:59:31,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 01:59:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 01:59:31,429 INFO L87 Difference]: Start difference. First operand has 947 states, 435 states have (on average 2.317241379310345) internal successors, (1008), 946 states have internal predecessors, (1008), 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-16 01:59:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:59:33,719 INFO L93 Difference]: Finished difference Result 1168 states and 1233 transitions. [2021-10-16 01:59:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 01:59:33,720 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-16 01:59:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:59:33,757 INFO L225 Difference]: With dead ends: 1168 [2021-10-16 01:59:33,762 INFO L226 Difference]: Without dead ends: 1166 [2021-10-16 01:59:33,764 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-16 01:59:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2021-10-16 01:59:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1030. [2021-10-16 01:59:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 522 states have (on average 2.2624521072796937) internal successors, (1181), 1029 states have internal predecessors, (1181), 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-16 01:59:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1181 transitions. [2021-10-16 01:59:33,863 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1181 transitions. Word has length 3 [2021-10-16 01:59:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:59:33,863 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1181 transitions. [2021-10-16 01:59:33,863 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-16 01:59:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1181 transitions. [2021-10-16 01:59:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-16 01:59:33,864 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:59:33,864 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-16 01:59:33,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-16 01:59:34,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 01:59:34,076 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:59:34,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:59:34,077 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-10-16 01:59:34,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 01:59:34,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800674236] [2021-10-16 01:59:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:59:34,078 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 01:59:34,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 01:59:34,082 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 01:59:34,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-16 01:59:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:59:34,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 01:59:34,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 01:59:34,192 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-16 01:59:34,208 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-16 01:59:34,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 01:59:34,314 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-16 01:59:34,315 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 01:59:34,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800674236] [2021-10-16 01:59:34,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800674236] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 01:59:34,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:59:34,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 01:59:34,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147120042] [2021-10-16 01:59:34,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 01:59:34,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 01:59:34,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 01:59:34,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 01:59:34,319 INFO L87 Difference]: Start difference. First operand 1030 states and 1181 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-16 01:59:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:59:39,801 INFO L93 Difference]: Finished difference Result 1081 states and 1237 transitions. [2021-10-16 01:59:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 01:59:39,802 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-16 01:59:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:59:39,809 INFO L225 Difference]: With dead ends: 1081 [2021-10-16 01:59:39,809 INFO L226 Difference]: Without dead ends: 1081 [2021-10-16 01:59:39,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 01:59:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2021-10-16 01:59:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1028. [2021-10-16 01:59:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 522 states have (on average 2.2586206896551726) internal successors, (1179), 1027 states have internal predecessors, (1179), 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-16 01:59:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1179 transitions. [2021-10-16 01:59:39,840 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1179 transitions. Word has length 3 [2021-10-16 01:59:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:59:39,841 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1179 transitions. [2021-10-16 01:59:39,841 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-16 01:59:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1179 transitions. [2021-10-16 01:59:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-16 01:59:39,842 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:59:39,842 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 01:59:39,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-16 01:59:40,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 01:59:40,055 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:59:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:59:40,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1837144844, now seen corresponding path program 1 times [2021-10-16 01:59:40,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 01:59:40,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798276368] [2021-10-16 01:59:40,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:59:40,060 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 01:59:40,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 01:59:40,061 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 01:59:40,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-16 01:59:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:59:40,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 01:59:40,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 01:59:40,196 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-16 01:59:40,202 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-16 01:59:40,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 01:59:40,232 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-16 01:59:40,232 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 01:59:40,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798276368] [2021-10-16 01:59:40,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798276368] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 01:59:40,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:59:40,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-16 01:59:40,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106429] [2021-10-16 01:59:40,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 01:59:40,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 01:59:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 01:59:40,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 01:59:40,235 INFO L87 Difference]: Start difference. First operand 1028 states and 1179 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-16 01:59:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:59:42,596 INFO L93 Difference]: Finished difference Result 1092 states and 1158 transitions. [2021-10-16 01:59:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 01:59:42,597 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-16 01:59:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:59:42,604 INFO L225 Difference]: With dead ends: 1092 [2021-10-16 01:59:42,604 INFO L226 Difference]: Without dead ends: 1092 [2021-10-16 01:59:42,606 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 01:59:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2021-10-16 01:59:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 953. [2021-10-16 01:59:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 522 states have (on average 2.1149425287356323) internal successors, (1104), 952 states have internal predecessors, (1104), 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-16 01:59:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1104 transitions. [2021-10-16 01:59:42,635 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1104 transitions. Word has length 9 [2021-10-16 01:59:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:59:42,635 INFO L470 AbstractCegarLoop]: Abstraction has 953 states and 1104 transitions. [2021-10-16 01:59:42,636 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-16 01:59:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1104 transitions. [2021-10-16 01:59:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-16 01:59:42,636 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:59:42,637 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 01:59:42,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-16 01:59:42,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 01:59:42,847 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:59:42,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:59:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1837144845, now seen corresponding path program 1 times [2021-10-16 01:59:42,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 01:59:42,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650938485] [2021-10-16 01:59:42,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:59:42,848 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 01:59:42,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 01:59:42,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 01:59:42,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-16 01:59:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:59:42,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 01:59:42,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 01:59:42,958 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-16 01:59:42,970 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-16 01:59:42,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 01:59:43,032 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-16 01:59:43,032 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 01:59:43,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650938485] [2021-10-16 01:59:43,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650938485] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 01:59:43,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:59:43,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 01:59:43,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342353121] [2021-10-16 01:59:43,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 01:59:43,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 01:59:43,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 01:59:43,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 01:59:43,035 INFO L87 Difference]: Start difference. First operand 953 states and 1104 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-16 01:59:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 01:59:45,347 INFO L93 Difference]: Finished difference Result 881 states and 1033 transitions. [2021-10-16 01:59:45,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 01:59:45,348 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-16 01:59:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 01:59:45,352 INFO L225 Difference]: With dead ends: 881 [2021-10-16 01:59:45,353 INFO L226 Difference]: Without dead ends: 881 [2021-10-16 01:59:45,353 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 01:59:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2021-10-16 01:59:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 878. [2021-10-16 01:59:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 522 states have (on average 1.971264367816092) internal successors, (1029), 877 states have internal predecessors, (1029), 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-16 01:59:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1029 transitions. [2021-10-16 01:59:45,376 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1029 transitions. Word has length 9 [2021-10-16 01:59:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 01:59:45,377 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 1029 transitions. [2021-10-16 01:59:45,377 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-16 01:59:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1029 transitions. [2021-10-16 01:59:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-16 01:59:45,378 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 01:59:45,378 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 01:59:45,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-10-16 01:59:45,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 01:59:45,590 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 01:59:45,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 01:59:45,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1116915317, now seen corresponding path program 1 times [2021-10-16 01:59:45,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 01:59:45,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169151827] [2021-10-16 01:59:45,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 01:59:45,591 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 01:59:45,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 01:59:45,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 01:59:45,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-16 01:59:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 01:59:45,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-16 01:59:45,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 01:59:45,698 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-16 01:59:45,707 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-16 01:59:45,909 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-16 01:59:45,910 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 29 treesize of output 31 [2021-10-16 01:59:45,920 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-16 01:59:45,922 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 28 treesize of output 24 [2021-10-16 01:59:45,989 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-16 01:59:45,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 01:59:48,765 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-16 01:59:48,765 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 01:59:48,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169151827] [2021-10-16 01:59:48,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169151827] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 01:59:48,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 01:59:48,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-10-16 01:59:48,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043434930] [2021-10-16 01:59:48,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 01:59:48,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 01:59:48,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 01:59:48,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=18, Unknown=1, NotChecked=0, Total=30 [2021-10-16 01:59:48,768 INFO L87 Difference]: Start difference. First operand 878 states and 1029 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-16 02:00:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:00:07,002 INFO L93 Difference]: Finished difference Result 1139 states and 1219 transitions. [2021-10-16 02:00:07,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 02:00:07,003 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-16 02:00:07,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:00:07,010 INFO L225 Difference]: With dead ends: 1139 [2021-10-16 02:00:07,010 INFO L226 Difference]: Without dead ends: 1139 [2021-10-16 02:00:07,011 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2558.4ms TimeCoverageRelationStatistics Valid=23, Invalid=32, Unknown=1, NotChecked=0, Total=56 [2021-10-16 02:00:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-10-16 02:00:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 772. [2021-10-16 02:00:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 522 states have (on average 1.7662835249042146) internal successors, (922), 771 states have internal predecessors, (922), 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-16 02:00:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 922 transitions. [2021-10-16 02:00:07,036 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 922 transitions. Word has length 10 [2021-10-16 02:00:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:00:07,036 INFO L470 AbstractCegarLoop]: Abstraction has 772 states and 922 transitions. [2021-10-16 02:00:07,036 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-16 02:00:07,037 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 922 transitions. [2021-10-16 02:00:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-16 02:00:07,037 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:00:07,037 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:00:07,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-16 02:00:07,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:00:07,259 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 02:00:07,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:00:07,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1116915316, now seen corresponding path program 1 times [2021-10-16 02:00:07,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:00:07,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91977783] [2021-10-16 02:00:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:00:07,263 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:00:07,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:00:07,264 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:00:07,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-16 02:00:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:00:07,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-16 02:00:07,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:00:07,421 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-16 02:00:07,519 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 02:00:07,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2021-10-16 02:00:07,614 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-16 02:00:07,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:00:09,814 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-16 02:00:09,815 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:00:09,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91977783] [2021-10-16 02:00:09,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91977783] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:00:09,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:00:09,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-10-16 02:00:09,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85341560] [2021-10-16 02:00:09,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 02:00:09,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:00:09,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 02:00:09,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=18, Unknown=1, NotChecked=0, Total=30 [2021-10-16 02:00:09,818 INFO L87 Difference]: Start difference. First operand 772 states and 922 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-16 02:00:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:00:13,393 INFO L93 Difference]: Finished difference Result 805 states and 871 transitions. [2021-10-16 02:00:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:00:13,393 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-16 02:00:13,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:00:13,398 INFO L225 Difference]: With dead ends: 805 [2021-10-16 02:00:13,399 INFO L226 Difference]: Without dead ends: 805 [2021-10-16 02:00:13,399 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2113.4ms TimeCoverageRelationStatistics Valid=17, Invalid=24, Unknown=1, NotChecked=0, Total=42 [2021-10-16 02:00:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-10-16 02:00:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 667. [2021-10-16 02:00:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 522 states have (on average 1.5651340996168583) internal successors, (817), 666 states have internal predecessors, (817), 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-16 02:00:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 817 transitions. [2021-10-16 02:00:13,418 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 817 transitions. Word has length 10 [2021-10-16 02:00:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:00:13,418 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 817 transitions. [2021-10-16 02:00:13,419 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-16 02:00:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 817 transitions. [2021-10-16 02:00:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-16 02:00:13,420 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:00:13,420 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-16 02:00:13,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-10-16 02:00:13,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:00:13,632 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 02:00:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:00:13,632 INFO L82 PathProgramCache]: Analyzing trace with hash 94393608, now seen corresponding path program 1 times [2021-10-16 02:00:13,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:00:13,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255000869] [2021-10-16 02:00:13,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:00:13,634 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:00:13,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:00:13,635 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:00:13,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-16 02:00:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:00:13,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-16 02:00:13,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:00:13,840 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-16 02:00:13,872 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-16 02:00:13,883 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-16 02:00:13,973 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-10-16 02:00:13,973 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-16 02:00:13,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:00:13,997 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-16 02:00:14,243 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-16 02:00:14,243 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 18 treesize of output 18 [2021-10-16 02:00:14,409 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-10-16 02:00:14,409 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-16 02:00:14,469 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-10-16 02:00:14,470 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-16 02:00:14,579 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-16 02:00:14,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-10-16 02:00:14,587 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-16 02:00:14,587 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-16 02:00:14,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-16 02:00:14,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:00:14,807 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:00:14,809 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-10-16 02:00:14,813 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:00:14,815 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-10-16 02:00:34,031 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_320 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_320)))) (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_320 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_320) 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_320 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_320) 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-16 02:00:34,094 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-16 02:00:34,095 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:00:34,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255000869] [2021-10-16 02:00:34,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255000869] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:00:34,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:00:34,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 13 [2021-10-16 02:00:34,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534366306] [2021-10-16 02:00:34,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-16 02:00:34,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:00:34,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-16 02:00:34,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=97, Unknown=6, NotChecked=20, Total=156 [2021-10-16 02:00:34,098 INFO L87 Difference]: Start difference. First operand 667 states and 817 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-16 02:00:36,219 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_append_~node~0.base_320 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_320)))) (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_320 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_320) 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_320 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_320) 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-16 02:00:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:00:53,917 INFO L93 Difference]: Finished difference Result 821 states and 888 transitions. [2021-10-16 02:00:53,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-16 02:00:53,917 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-16 02:00:53,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:00:53,922 INFO L225 Difference]: With dead ends: 821 [2021-10-16 02:00:53,923 INFO L226 Difference]: Without dead ends: 821 [2021-10-16 02:00:53,924 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 23317.3ms TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=8, NotChecked=62, Total=342 [2021-10-16 02:00:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-10-16 02:00:53,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 674. [2021-10-16 02:00:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 529 states have (on average 1.559546313799622) internal successors, (825), 673 states have internal predecessors, (825), 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-16 02:00:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 825 transitions. [2021-10-16 02:00:53,943 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 825 transitions. Word has length 19 [2021-10-16 02:00:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:00:53,943 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 825 transitions. [2021-10-16 02:00:53,943 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-16 02:00:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 825 transitions. [2021-10-16 02:00:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-16 02:00:53,945 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:00:53,945 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-16 02:00:53,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-16 02:00:54,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:00:54,160 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 02:00:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:00:54,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1351113909, now seen corresponding path program 1 times [2021-10-16 02:00:54,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:00:54,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291459042] [2021-10-16 02:00:54,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:00:54,161 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:00:54,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:00:54,162 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:00:54,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-16 02:00:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:00:54,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-16 02:00:54,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:00:54,384 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-16 02:00:54,414 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-16 02:00:54,427 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-16 02:00:54,582 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-16 02:00:54,583 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-16 02:00:54,677 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-10-16 02:00:54,678 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-16 02:00:54,708 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-10-16 02:00:54,709 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-16 02:00:54,809 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-16 02:00:54,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-16 02:00:54,908 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-16 02:00:54,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:00:55,027 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:00:55,029 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-10-16 02:00:55,032 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:00:55,033 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-10-16 02:00:57,058 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_append_~node~0.base) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_3)) c_ULTIMATE.start_append_~head.base) (bvadd (_ bv4 32) c_ULTIMATE.start_append_~head.offset)) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (= (select (select (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) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_4)) c_ULTIMATE.start_append_~head.base) (bvadd (_ bv4 32) c_ULTIMATE.start_append_~head.offset)) (_ bv0 32)))) is different from false [2021-10-16 02:01:05,523 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-16 02:01:05,524 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:01:05,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291459042] [2021-10-16 02:01:05,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291459042] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:01:05,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:01:05,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2021-10-16 02:01:05,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139792625] [2021-10-16 02:01:05,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-16 02:01:05,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:01:05,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-16 02:01:05,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=4, NotChecked=14, Total=90 [2021-10-16 02:01:05,527 INFO L87 Difference]: Start difference. First operand 674 states and 825 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-16 02:01:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:01:21,323 INFO L93 Difference]: Finished difference Result 814 states and 880 transitions. [2021-10-16 02:01:21,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-16 02:01:21,324 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-16 02:01:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:01:21,332 INFO L225 Difference]: With dead ends: 814 [2021-10-16 02:01:21,332 INFO L226 Difference]: Without dead ends: 814 [2021-10-16 02:01:21,332 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 14572.9ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=4, NotChecked=24, Total=210 [2021-10-16 02:01:21,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-10-16 02:01:21,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 677. [2021-10-16 02:01:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 532 states have (on average 1.556390977443609) internal successors, (828), 676 states have internal predecessors, (828), 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-16 02:01:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 828 transitions. [2021-10-16 02:01:21,352 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 828 transitions. Word has length 21 [2021-10-16 02:01:21,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:01:21,353 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 828 transitions. [2021-10-16 02:01:21,353 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-16 02:01:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 828 transitions. [2021-10-16 02:01:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-16 02:01:21,357 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:01:21,358 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-16 02:01:21,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-16 02:01:21,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:01:21,573 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-16 02:01:21,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:01:21,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1113089128, now seen corresponding path program 1 times [2021-10-16 02:01:21,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:01:21,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218554849] [2021-10-16 02:01:21,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:01:21,575 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:01:21,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:01:21,580 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:01:21,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-16 02:01:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:01:21,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-16 02:01:21,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:01:21,955 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-16 02:01:22,065 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 02:01:22,066 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-16 02:01:22,570 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-16 02:01:22,689 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-16 02:01:22,892 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-16 02:01:22,892 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-16 02:01:23,212 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-16 02:01:23,213 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 50 treesize of output 73 [2021-10-16 02:01:23,512 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:01:23,513 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-16 02:01:24,331 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:01:24,331 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 87 treesize of output 71 [2021-10-16 02:01:24,760 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-16 02:01:24,761 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 100 treesize of output 84 [2021-10-16 02:01:25,096 INFO L354 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2021-10-16 02:01:25,101 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-16 02:01:25,342 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-16 02:01:25,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:01:29,249 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:01:29,250 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-10-16 02:01:35,509 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_322 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_322))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_322 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_322 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_322) 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))))))))))))) is different from false [2021-10-16 02:01:37,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_251 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_322 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_322))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_322 (_ 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_322 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_322) v_ULTIMATE.start_append_~node~0.offset_251 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_251 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_251 (_ 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-16 02:01:39,714 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_251 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_322 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_322 (_ 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_322 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_322) v_ULTIMATE.start_append_~node~0.offset_251 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_251 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_251 (_ 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 (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_322))))))) is different from false [2021-10-16 02:01:39,749 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 351902 treesize of output 351134 [2021-10-16 02:01:41,265 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:01:41,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218554849] [2021-10-16 02:01:41,266 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 02:01:41,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [719462376] [2021-10-16 02:01:41,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:01:41,267 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-16 02:01:41,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/cvc4 [2021-10-16 02:01:41,282 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-16 02:01:41,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-10-16 02:01:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:01:41,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjunts are in the unsatisfiable core [2021-10-16 02:01:41,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:01:41,799 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-16 02:01:42,006 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 02:01:42,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2021-10-16 02:01:42,589 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-16 02:01:42,766 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-16 02:01:42,983 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-16 02:01:42,983 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-16 02:01:43,242 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-16 02:01:43,243 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 41 treesize of output 64 [2021-10-16 02:01:43,516 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:01:43,516 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 63 [2021-10-16 02:01:44,166 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:01:44,166 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 88 treesize of output 72 [2021-10-16 02:01:44,576 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-16 02:01:44,577 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-16 02:01:44,863 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-16 02:01:44,864 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 114 treesize of output 75 [2021-10-16 02:01:45,048 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-16 02:01:45,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:01:47,673 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:01:47,674 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-10-16 02:01:54,763 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_323 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_323))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_323 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_323 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_323) 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-16 02:01:56,855 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_256 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_323 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_323 (_ 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_323 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_323) v_ULTIMATE.start_append_~node~0.offset_256 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_256 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_256 (_ 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 (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_323))))))) is different from false [2021-10-16 02:01:58,936 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_256 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_323 (_ 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_323 (_ 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_323 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_323) v_ULTIMATE.start_append_~node~0.offset_256 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_256 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_256 (_ 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 (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_323))))))) is different from false [2021-10-16 02:01:58,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92306 treesize of output 92114 [2021-10-16 02:01:59,344 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 02:01:59,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714723573] [2021-10-16 02:01:59,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:01:59,345 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:01:59,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:01:59,347 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:01:59,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-16 02:01:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:01:59,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-16 02:01:59,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:01:59,810 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-16 02:01:59,810 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-16 02:02:00,429 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-16 02:02:00,483 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-16 02:02:00,593 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-16 02:02:00,593 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 65 treesize of output 46 [2021-10-16 02:02:00,805 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-16 02:02:00,805 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 42 treesize of output 65 [2021-10-16 02:02:01,150 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:02:01,150 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 65 [2021-10-16 02:02:01,815 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:02:01,816 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-16 02:02:02,201 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-16 02:02:02,202 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-16 02:02:02,440 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-16 02:02:02,440 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 114 treesize of output 75 [2021-10-16 02:02:02,585 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-16 02:02:02,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:02:02,748 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:02:02,749 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-10-16 02:02:04,761 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_7) (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_append_~head.base) (bvadd (_ bv4 32) c_ULTIMATE.start_append_~head.offset))))))))))) (_ bv1 1)))) is different from false [2021-10-16 02:02:06,810 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_324 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_324 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_324 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_324) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_7) (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 (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_324)))))) is different from false [2021-10-16 02:02:08,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.offset_261 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_324 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_324)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_324 (_ 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_324 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_324) v_ULTIMATE.start_append_~node~0.offset_261 v_DerPreprocessor_7) (bvadd v_ULTIMATE.start_append_~node~0.offset_261 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_261 (_ 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-16 02:02:10,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_261 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_324 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_324 (_ 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_324 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_324) v_ULTIMATE.start_append_~node~0.offset_261 v_DerPreprocessor_7) (bvadd v_ULTIMATE.start_append_~node~0.offset_261 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_261 (_ 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_324)))))) is different from false [2021-10-16 02:02:10,998 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 192877 treesize of output 192493 [2021-10-16 02:02:11,461 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 02:02:11,461 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:02:11,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-10-16 02:02:11,461 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-10-16 02:02:11,461 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-10-16 02:02:11,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-16 02:02:11,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-16 02:02:11,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-16 02:02:11,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-16 02:02:11,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-16 02:02:11,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-16 02:02:11,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-16 02:02:11,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-16 02:02:11,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-16 02:02:11,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-16 02:02:11,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-16 02:02:11,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-16 02:02:11,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-16 02:02:11,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-16 02:02:11,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-16 02:02:11,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-16 02:02:11,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-16 02:02:11,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-16 02:02:11,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-16 02:02:11,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-16 02:02:11,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-16 02:02:11,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-16 02:02:11,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-16 02:02:11,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-16 02:02:11,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-16 02:02:11,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-16 02:02:11,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-16 02:02:11,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-16 02:02:11,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-16 02:02:11,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-16 02:02:11,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-16 02:02:11,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-16 02:02:11,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-16 02:02:11,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-16 02:02:11,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-16 02:02:11,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-16 02:02:11,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-16 02:02:11,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-16 02:02:11,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-16 02:02:11,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-16 02:02:11,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-16 02:02:11,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-16 02:02:11,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-16 02:02:11,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-16 02:02:11,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-16 02:02:11,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-16 02:02:11,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-16 02:02:11,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-16 02:02:11,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-16 02:02:11,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-16 02:02:11,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-16 02:02:11,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-16 02:02:11,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-16 02:02:11,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-16 02:02:11,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-16 02:02:11,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-16 02:02:11,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-16 02:02:11,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-16 02:02:11,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-16 02:02:11,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-16 02:02:11,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-16 02:02:11,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-16 02:02:11,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-16 02:02:11,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-16 02:02:11,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-16 02:02:11,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-16 02:02:11,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-10-16 02:02:11,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-10-16 02:02:11,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-10-16 02:02:11,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-10-16 02:02:11,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-10-16 02:02:11,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-16 02:02:11,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-10-16 02:02:11,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-10-16 02:02:11,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-16 02:02:11,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-10-16 02:02:11,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-10-16 02:02:11,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-10-16 02:02:11,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-10-16 02:02:11,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-10-16 02:02:11,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION [2021-10-16 02:02:11,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATION [2021-10-16 02:02:11,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-10-16 02:02:11,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-10-16 02:02:11,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION [2021-10-16 02:02:11,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-10-16 02:02:11,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-10-16 02:02:11,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-10-16 02:02:11,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-10-16 02:02:11,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-10-16 02:02:11,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-10-16 02:02:11,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-10-16 02:02:11,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-10-16 02:02:11,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-10-16 02:02:11,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-10-16 02:02:11,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-10-16 02:02:11,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-10-16 02:02:11,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-10-16 02:02:11,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-10-16 02:02:11,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99REQUIRES_VIOLATION [2021-10-16 02:02:11,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100REQUIRES_VIOLATION [2021-10-16 02:02:11,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101REQUIRES_VIOLATION [2021-10-16 02:02:11,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-10-16 02:02:11,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103REQUIRES_VIOLATION [2021-10-16 02:02:11,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104REQUIRES_VIOLATION [2021-10-16 02:02:11,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATION [2021-10-16 02:02:11,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-10-16 02:02:11,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-10-16 02:02:11,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-10-16 02:02:11,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-10-16 02:02:11,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110REQUIRES_VIOLATION [2021-10-16 02:02:11,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111REQUIRES_VIOLATION [2021-10-16 02:02:11,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-10-16 02:02:11,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-10-16 02:02:11,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114REQUIRES_VIOLATION [2021-10-16 02:02:11,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-10-16 02:02:11,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-10-16 02:02:11,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-10-16 02:02:11,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-10-16 02:02:11,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119REQUIRES_VIOLATION [2021-10-16 02:02:11,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATION [2021-10-16 02:02:11,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-10-16 02:02:11,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-10-16 02:02:11,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-10-16 02:02:11,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-10-16 02:02:11,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125REQUIRES_VIOLATION [2021-10-16 02:02:11,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126REQUIRES_VIOLATION [2021-10-16 02:02:11,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127REQUIRES_VIOLATION [2021-10-16 02:02:11,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128REQUIRES_VIOLATION [2021-10-16 02:02:11,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129REQUIRES_VIOLATION [2021-10-16 02:02:11,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130REQUIRES_VIOLATION [2021-10-16 02:02:11,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131REQUIRES_VIOLATION [2021-10-16 02:02:11,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132REQUIRES_VIOLATION [2021-10-16 02:02:11,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133REQUIRES_VIOLATION [2021-10-16 02:02:11,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134REQUIRES_VIOLATION [2021-10-16 02:02:11,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135REQUIRES_VIOLATION [2021-10-16 02:02:11,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136REQUIRES_VIOLATION [2021-10-16 02:02:11,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137REQUIRES_VIOLATION [2021-10-16 02:02:11,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138REQUIRES_VIOLATION [2021-10-16 02:02:11,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139REQUIRES_VIOLATION [2021-10-16 02:02:11,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140REQUIRES_VIOLATION [2021-10-16 02:02:11,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141REQUIRES_VIOLATION [2021-10-16 02:02:11,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142REQUIRES_VIOLATION [2021-10-16 02:02:11,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143REQUIRES_VIOLATION [2021-10-16 02:02:11,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144REQUIRES_VIOLATION [2021-10-16 02:02:11,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145REQUIRES_VIOLATION [2021-10-16 02:02:11,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146REQUIRES_VIOLATION [2021-10-16 02:02:11,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147REQUIRES_VIOLATION [2021-10-16 02:02:11,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148REQUIRES_VIOLATION [2021-10-16 02:02:11,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149REQUIRES_VIOLATION [2021-10-16 02:02:11,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150REQUIRES_VIOLATION [2021-10-16 02:02:11,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151REQUIRES_VIOLATION [2021-10-16 02:02:11,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152REQUIRES_VIOLATION [2021-10-16 02:02:11,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153REQUIRES_VIOLATION [2021-10-16 02:02:11,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166REQUIRES_VIOLATION [2021-10-16 02:02:11,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167REQUIRES_VIOLATION [2021-10-16 02:02:11,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168REQUIRES_VIOLATION [2021-10-16 02:02:11,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169REQUIRES_VIOLATION [2021-10-16 02:02:11,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170REQUIRES_VIOLATION [2021-10-16 02:02:11,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171REQUIRES_VIOLATION [2021-10-16 02:02:11,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172REQUIRES_VIOLATION [2021-10-16 02:02:11,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173REQUIRES_VIOLATION [2021-10-16 02:02:11,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174REQUIRES_VIOLATION [2021-10-16 02:02:11,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175REQUIRES_VIOLATION [2021-10-16 02:02:11,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176REQUIRES_VIOLATION [2021-10-16 02:02:11,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177REQUIRES_VIOLATION [2021-10-16 02:02:11,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178REQUIRES_VIOLATION [2021-10-16 02:02:11,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179REQUIRES_VIOLATION [2021-10-16 02:02:11,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180REQUIRES_VIOLATION [2021-10-16 02:02:11,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181REQUIRES_VIOLATION [2021-10-16 02:02:11,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182REQUIRES_VIOLATION [2021-10-16 02:02:11,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183REQUIRES_VIOLATION [2021-10-16 02:02:11,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184REQUIRES_VIOLATION [2021-10-16 02:02:11,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185REQUIRES_VIOLATION [2021-10-16 02:02:11,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186REQUIRES_VIOLATION [2021-10-16 02:02:11,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187REQUIRES_VIOLATION [2021-10-16 02:02:11,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188REQUIRES_VIOLATION [2021-10-16 02:02:11,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189REQUIRES_VIOLATION [2021-10-16 02:02:11,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190REQUIRES_VIOLATION [2021-10-16 02:02:11,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191REQUIRES_VIOLATION [2021-10-16 02:02:11,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192REQUIRES_VIOLATION [2021-10-16 02:02:11,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193REQUIRES_VIOLATION [2021-10-16 02:02:11,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr194REQUIRES_VIOLATION [2021-10-16 02:02:11,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr195REQUIRES_VIOLATION [2021-10-16 02:02:11,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr196REQUIRES_VIOLATION [2021-10-16 02:02:11,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr197REQUIRES_VIOLATION [2021-10-16 02:02:11,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr198REQUIRES_VIOLATION [2021-10-16 02:02:11,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr199REQUIRES_VIOLATION [2021-10-16 02:02:11,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr200REQUIRES_VIOLATION [2021-10-16 02:02:11,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr201REQUIRES_VIOLATION [2021-10-16 02:02:11,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr202REQUIRES_VIOLATION [2021-10-16 02:02:11,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr203REQUIRES_VIOLATION [2021-10-16 02:02:11,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr204REQUIRES_VIOLATION [2021-10-16 02:02:11,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr205REQUIRES_VIOLATION [2021-10-16 02:02:11,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr206REQUIRES_VIOLATION [2021-10-16 02:02:11,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr207REQUIRES_VIOLATION [2021-10-16 02:02:11,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr208REQUIRES_VIOLATION [2021-10-16 02:02:11,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr209REQUIRES_VIOLATION [2021-10-16 02:02:11,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr210REQUIRES_VIOLATION [2021-10-16 02:02:11,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr211REQUIRES_VIOLATION [2021-10-16 02:02:11,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr212REQUIRES_VIOLATION [2021-10-16 02:02:11,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr213REQUIRES_VIOLATION [2021-10-16 02:02:11,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr214REQUIRES_VIOLATION [2021-10-16 02:02:11,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr215REQUIRES_VIOLATION [2021-10-16 02:02:11,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr216REQUIRES_VIOLATION [2021-10-16 02:02:11,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr217REQUIRES_VIOLATION [2021-10-16 02:02:11,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr218REQUIRES_VIOLATION [2021-10-16 02:02:11,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr219REQUIRES_VIOLATION [2021-10-16 02:02:11,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr220REQUIRES_VIOLATION [2021-10-16 02:02:11,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr221REQUIRES_VIOLATION [2021-10-16 02:02:11,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr222REQUIRES_VIOLATION [2021-10-16 02:02:11,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr223REQUIRES_VIOLATION [2021-10-16 02:02:11,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr224REQUIRES_VIOLATION [2021-10-16 02:02:11,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr225REQUIRES_VIOLATION [2021-10-16 02:02:11,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr226REQUIRES_VIOLATION [2021-10-16 02:02:11,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr227REQUIRES_VIOLATION [2021-10-16 02:02:11,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr228REQUIRES_VIOLATION [2021-10-16 02:02:11,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr229REQUIRES_VIOLATION [2021-10-16 02:02:11,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr230REQUIRES_VIOLATION [2021-10-16 02:02:11,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr231REQUIRES_VIOLATION [2021-10-16 02:02:11,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr232REQUIRES_VIOLATION [2021-10-16 02:02:11,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr233REQUIRES_VIOLATION [2021-10-16 02:02:11,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr234REQUIRES_VIOLATION [2021-10-16 02:02:11,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr235REQUIRES_VIOLATION [2021-10-16 02:02:11,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr236REQUIRES_VIOLATION [2021-10-16 02:02:11,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr237REQUIRES_VIOLATION [2021-10-16 02:02:11,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr238REQUIRES_VIOLATION [2021-10-16 02:02:11,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr239REQUIRES_VIOLATION [2021-10-16 02:02:11,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr240REQUIRES_VIOLATION [2021-10-16 02:02:11,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr241REQUIRES_VIOLATION [2021-10-16 02:02:11,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr242REQUIRES_VIOLATION [2021-10-16 02:02:11,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr243REQUIRES_VIOLATION [2021-10-16 02:02:11,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr244REQUIRES_VIOLATION [2021-10-16 02:02:11,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr245REQUIRES_VIOLATION [2021-10-16 02:02:11,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr246REQUIRES_VIOLATION [2021-10-16 02:02:11,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr247REQUIRES_VIOLATION [2021-10-16 02:02:11,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr248REQUIRES_VIOLATION [2021-10-16 02:02:11,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr249REQUIRES_VIOLATION [2021-10-16 02:02:11,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr250REQUIRES_VIOLATION [2021-10-16 02:02:11,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr251REQUIRES_VIOLATION [2021-10-16 02:02:11,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr252REQUIRES_VIOLATION [2021-10-16 02:02:11,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr253REQUIRES_VIOLATION [2021-10-16 02:02:11,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr254REQUIRES_VIOLATION [2021-10-16 02:02:11,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr255REQUIRES_VIOLATION [2021-10-16 02:02:11,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr256REQUIRES_VIOLATION [2021-10-16 02:02:11,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr257REQUIRES_VIOLATION [2021-10-16 02:02:11,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr258REQUIRES_VIOLATION [2021-10-16 02:02:11,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr259REQUIRES_VIOLATION [2021-10-16 02:02:11,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr260REQUIRES_VIOLATION [2021-10-16 02:02:11,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr261REQUIRES_VIOLATION [2021-10-16 02:02:11,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr262REQUIRES_VIOLATION [2021-10-16 02:02:11,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr263REQUIRES_VIOLATION [2021-10-16 02:02:11,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr264REQUIRES_VIOLATION [2021-10-16 02:02:11,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr265REQUIRES_VIOLATION [2021-10-16 02:02:11,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr266REQUIRES_VIOLATION [2021-10-16 02:02:11,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr267REQUIRES_VIOLATION [2021-10-16 02:02:11,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr268REQUIRES_VIOLATION [2021-10-16 02:02:11,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr269REQUIRES_VIOLATION [2021-10-16 02:02:11,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr270REQUIRES_VIOLATION [2021-10-16 02:02:11,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr271REQUIRES_VIOLATION [2021-10-16 02:02:11,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr272REQUIRES_VIOLATION [2021-10-16 02:02:11,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr273REQUIRES_VIOLATION [2021-10-16 02:02:11,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr274REQUIRES_VIOLATION [2021-10-16 02:02:11,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr275REQUIRES_VIOLATION [2021-10-16 02:02:11,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr276REQUIRES_VIOLATION [2021-10-16 02:02:11,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr277REQUIRES_VIOLATION [2021-10-16 02:02:11,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr278REQUIRES_VIOLATION [2021-10-16 02:02:11,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr279REQUIRES_VIOLATION [2021-10-16 02:02:11,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr280REQUIRES_VIOLATION [2021-10-16 02:02:11,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr281REQUIRES_VIOLATION [2021-10-16 02:02:11,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr282REQUIRES_VIOLATION [2021-10-16 02:02:11,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr283REQUIRES_VIOLATION [2021-10-16 02:02:11,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr284REQUIRES_VIOLATION [2021-10-16 02:02:11,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr285REQUIRES_VIOLATION [2021-10-16 02:02:11,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr286REQUIRES_VIOLATION [2021-10-16 02:02:11,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr287REQUIRES_VIOLATION [2021-10-16 02:02:11,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr288REQUIRES_VIOLATION [2021-10-16 02:02:11,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr289REQUIRES_VIOLATION [2021-10-16 02:02:11,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr290REQUIRES_VIOLATION [2021-10-16 02:02:11,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr291REQUIRES_VIOLATION [2021-10-16 02:02:11,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr292REQUIRES_VIOLATION [2021-10-16 02:02:11,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr293REQUIRES_VIOLATION [2021-10-16 02:02:11,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr294REQUIRES_VIOLATION [2021-10-16 02:02:11,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr295REQUIRES_VIOLATION [2021-10-16 02:02:11,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr296REQUIRES_VIOLATION [2021-10-16 02:02:11,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr297REQUIRES_VIOLATION [2021-10-16 02:02:11,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr298REQUIRES_VIOLATION [2021-10-16 02:02:11,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr299REQUIRES_VIOLATION [2021-10-16 02:02:11,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr300REQUIRES_VIOLATION [2021-10-16 02:02:11,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr301REQUIRES_VIOLATION [2021-10-16 02:02:11,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr302REQUIRES_VIOLATION [2021-10-16 02:02:11,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr303REQUIRES_VIOLATION [2021-10-16 02:02:11,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr304REQUIRES_VIOLATION [2021-10-16 02:02:11,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr305REQUIRES_VIOLATION [2021-10-16 02:02:11,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr306REQUIRES_VIOLATION [2021-10-16 02:02:11,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr307REQUIRES_VIOLATION [2021-10-16 02:02:11,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr308REQUIRES_VIOLATION [2021-10-16 02:02:11,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr309REQUIRES_VIOLATION [2021-10-16 02:02:11,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr310REQUIRES_VIOLATION [2021-10-16 02:02:11,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr311REQUIRES_VIOLATION [2021-10-16 02:02:11,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr312REQUIRES_VIOLATION [2021-10-16 02:02:11,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr313REQUIRES_VIOLATION [2021-10-16 02:02:11,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr314REQUIRES_VIOLATION [2021-10-16 02:02:11,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr315REQUIRES_VIOLATION [2021-10-16 02:02:11,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr316REQUIRES_VIOLATION [2021-10-16 02:02:11,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr317REQUIRES_VIOLATION [2021-10-16 02:02:11,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr318REQUIRES_VIOLATION [2021-10-16 02:02:11,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr319REQUIRES_VIOLATION [2021-10-16 02:02:11,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr320REQUIRES_VIOLATION [2021-10-16 02:02:11,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr321REQUIRES_VIOLATION [2021-10-16 02:02:11,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr322REQUIRES_VIOLATION [2021-10-16 02:02:11,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr323REQUIRES_VIOLATION [2021-10-16 02:02:11,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr324REQUIRES_VIOLATION [2021-10-16 02:02:11,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr325REQUIRES_VIOLATION [2021-10-16 02:02:11,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr326REQUIRES_VIOLATION [2021-10-16 02:02:11,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr327REQUIRES_VIOLATION [2021-10-16 02:02:11,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr328REQUIRES_VIOLATION [2021-10-16 02:02:11,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr329REQUIRES_VIOLATION [2021-10-16 02:02:11,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr330REQUIRES_VIOLATION [2021-10-16 02:02:11,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr331REQUIRES_VIOLATION [2021-10-16 02:02:11,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr332REQUIRES_VIOLATION [2021-10-16 02:02:11,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr333REQUIRES_VIOLATION [2021-10-16 02:02:11,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr334REQUIRES_VIOLATION [2021-10-16 02:02:11,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr335REQUIRES_VIOLATION [2021-10-16 02:02:11,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr336REQUIRES_VIOLATION [2021-10-16 02:02:11,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr337REQUIRES_VIOLATION [2021-10-16 02:02:11,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr338REQUIRES_VIOLATION [2021-10-16 02:02:11,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr339REQUIRES_VIOLATION [2021-10-16 02:02:11,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr340REQUIRES_VIOLATION [2021-10-16 02:02:11,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr341REQUIRES_VIOLATION [2021-10-16 02:02:11,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr342REQUIRES_VIOLATION [2021-10-16 02:02:11,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr343REQUIRES_VIOLATION [2021-10-16 02:02:11,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr344REQUIRES_VIOLATION [2021-10-16 02:02:11,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr345REQUIRES_VIOLATION [2021-10-16 02:02:11,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr346REQUIRES_VIOLATION [2021-10-16 02:02:11,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr347REQUIRES_VIOLATION [2021-10-16 02:02:11,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr348REQUIRES_VIOLATION [2021-10-16 02:02:11,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr349REQUIRES_VIOLATION [2021-10-16 02:02:11,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr350REQUIRES_VIOLATION [2021-10-16 02:02:11,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr351REQUIRES_VIOLATION [2021-10-16 02:02:11,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr352REQUIRES_VIOLATION [2021-10-16 02:02:11,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr353REQUIRES_VIOLATION [2021-10-16 02:02:11,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr354REQUIRES_VIOLATION [2021-10-16 02:02:11,524 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr355REQUIRES_VIOLATION [2021-10-16 02:02:11,524 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr356REQUIRES_VIOLATION [2021-10-16 02:02:11,524 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr357REQUIRES_VIOLATION [2021-10-16 02:02:11,524 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr358REQUIRES_VIOLATION [2021-10-16 02:02:11,524 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr359REQUIRES_VIOLATION [2021-10-16 02:02:11,524 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr360REQUIRES_VIOLATION [2021-10-16 02:02:11,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr361REQUIRES_VIOLATION [2021-10-16 02:02:11,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr362REQUIRES_VIOLATION [2021-10-16 02:02:11,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr363REQUIRES_VIOLATION [2021-10-16 02:02:11,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr364REQUIRES_VIOLATION [2021-10-16 02:02:11,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr365REQUIRES_VIOLATION [2021-10-16 02:02:11,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr366REQUIRES_VIOLATION [2021-10-16 02:02:11,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr367REQUIRES_VIOLATION [2021-10-16 02:02:11,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr368REQUIRES_VIOLATION [2021-10-16 02:02:11,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr369REQUIRES_VIOLATION [2021-10-16 02:02:11,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr370REQUIRES_VIOLATION [2021-10-16 02:02:11,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr371REQUIRES_VIOLATION [2021-10-16 02:02:11,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr372REQUIRES_VIOLATION [2021-10-16 02:02:11,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr373REQUIRES_VIOLATION [2021-10-16 02:02:11,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr374REQUIRES_VIOLATION [2021-10-16 02:02:11,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr375REQUIRES_VIOLATION [2021-10-16 02:02:11,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr376REQUIRES_VIOLATION [2021-10-16 02:02:11,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr377REQUIRES_VIOLATION [2021-10-16 02:02:11,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr378REQUIRES_VIOLATION [2021-10-16 02:02:11,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr379REQUIRES_VIOLATION [2021-10-16 02:02:11,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr380REQUIRES_VIOLATION [2021-10-16 02:02:11,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr381REQUIRES_VIOLATION [2021-10-16 02:02:11,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr382REQUIRES_VIOLATION [2021-10-16 02:02:11,533 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr383REQUIRES_VIOLATION [2021-10-16 02:02:11,533 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr384REQUIRES_VIOLATION [2021-10-16 02:02:11,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr385REQUIRES_VIOLATION [2021-10-16 02:02:11,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr386REQUIRES_VIOLATION [2021-10-16 02:02:11,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr387REQUIRES_VIOLATION [2021-10-16 02:02:11,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr388REQUIRES_VIOLATION [2021-10-16 02:02:11,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr389REQUIRES_VIOLATION [2021-10-16 02:02:11,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr390REQUIRES_VIOLATION [2021-10-16 02:02:11,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr391REQUIRES_VIOLATION [2021-10-16 02:02:11,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr392REQUIRES_VIOLATION [2021-10-16 02:02:11,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr393REQUIRES_VIOLATION [2021-10-16 02:02:11,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr394REQUIRES_VIOLATION [2021-10-16 02:02:11,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr395REQUIRES_VIOLATION [2021-10-16 02:02:11,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr396REQUIRES_VIOLATION [2021-10-16 02:02:11,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr397REQUIRES_VIOLATION [2021-10-16 02:02:11,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr398REQUIRES_VIOLATION [2021-10-16 02:02:11,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr399REQUIRES_VIOLATION [2021-10-16 02:02:11,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr400REQUIRES_VIOLATION [2021-10-16 02:02:11,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr401REQUIRES_VIOLATION [2021-10-16 02:02:11,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr402REQUIRES_VIOLATION [2021-10-16 02:02:11,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr403REQUIRES_VIOLATION [2021-10-16 02:02:11,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr404REQUIRES_VIOLATION [2021-10-16 02:02:11,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr405REQUIRES_VIOLATION [2021-10-16 02:02:11,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr406REQUIRES_VIOLATION [2021-10-16 02:02:11,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr407REQUIRES_VIOLATION [2021-10-16 02:02:11,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr408REQUIRES_VIOLATION [2021-10-16 02:02:11,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr409REQUIRES_VIOLATION [2021-10-16 02:02:11,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr410REQUIRES_VIOLATION [2021-10-16 02:02:11,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr411REQUIRES_VIOLATION [2021-10-16 02:02:11,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr412REQUIRES_VIOLATION [2021-10-16 02:02:11,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr413REQUIRES_VIOLATION [2021-10-16 02:02:11,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr414REQUIRES_VIOLATION [2021-10-16 02:02:11,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr415REQUIRES_VIOLATION [2021-10-16 02:02:11,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr416REQUIRES_VIOLATION [2021-10-16 02:02:11,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr417REQUIRES_VIOLATION [2021-10-16 02:02:11,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr418REQUIRES_VIOLATION [2021-10-16 02:02:11,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr419REQUIRES_VIOLATION [2021-10-16 02:02:11,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr420REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr421REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr422REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr423REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr424REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr425REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr426REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr427REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr428REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr429REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr430REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr431REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr432REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr433REQUIRES_VIOLATION [2021-10-16 02:02:11,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr434REQUIRES_VIOLATION [2021-10-16 02:02:11,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr435REQUIRES_VIOLATION [2021-10-16 02:02:11,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr436REQUIRES_VIOLATION [2021-10-16 02:02:11,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr437REQUIRES_VIOLATION [2021-10-16 02:02:11,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr438REQUIRES_VIOLATION [2021-10-16 02:02:11,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr439REQUIRES_VIOLATION [2021-10-16 02:02:11,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr440REQUIRES_VIOLATION [2021-10-16 02:02:11,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr441REQUIRES_VIOLATION [2021-10-16 02:02:11,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr442ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr443ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr444ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr445REQUIRES_VIOLATION [2021-10-16 02:02:11,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr446REQUIRES_VIOLATION [2021-10-16 02:02:11,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr447ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr448ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr449ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr450REQUIRES_VIOLATION [2021-10-16 02:02:11,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr451REQUIRES_VIOLATION [2021-10-16 02:02:11,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr452REQUIRES_VIOLATION [2021-10-16 02:02:11,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr453REQUIRES_VIOLATION [2021-10-16 02:02:11,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr454REQUIRES_VIOLATION [2021-10-16 02:02:11,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr455REQUIRES_VIOLATION [2021-10-16 02:02:11,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr456REQUIRES_VIOLATION [2021-10-16 02:02:11,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr457REQUIRES_VIOLATION [2021-10-16 02:02:11,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr458REQUIRES_VIOLATION [2021-10-16 02:02:11,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr459REQUIRES_VIOLATION [2021-10-16 02:02:11,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr460REQUIRES_VIOLATION [2021-10-16 02:02:11,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr461REQUIRES_VIOLATION [2021-10-16 02:02:11,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr462REQUIRES_VIOLATION [2021-10-16 02:02:11,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr463REQUIRES_VIOLATION [2021-10-16 02:02:11,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr464REQUIRES_VIOLATION [2021-10-16 02:02:11,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr465REQUIRES_VIOLATION [2021-10-16 02:02:11,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr466REQUIRES_VIOLATION [2021-10-16 02:02:11,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr467REQUIRES_VIOLATION [2021-10-16 02:02:11,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr468REQUIRES_VIOLATION [2021-10-16 02:02:11,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr469REQUIRES_VIOLATION [2021-10-16 02:02:11,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr470REQUIRES_VIOLATION [2021-10-16 02:02:11,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr471REQUIRES_VIOLATION [2021-10-16 02:02:11,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr472REQUIRES_VIOLATION [2021-10-16 02:02:11,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr473REQUIRES_VIOLATION [2021-10-16 02:02:11,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr474REQUIRES_VIOLATION [2021-10-16 02:02:11,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr475REQUIRES_VIOLATION [2021-10-16 02:02:11,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr476REQUIRES_VIOLATION [2021-10-16 02:02:11,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr477REQUIRES_VIOLATION [2021-10-16 02:02:11,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr478REQUIRES_VIOLATION [2021-10-16 02:02:11,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr479REQUIRES_VIOLATION [2021-10-16 02:02:11,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr480REQUIRES_VIOLATION [2021-10-16 02:02:11,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr481REQUIRES_VIOLATION [2021-10-16 02:02:11,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr482REQUIRES_VIOLATION [2021-10-16 02:02:11,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr483REQUIRES_VIOLATION [2021-10-16 02:02:11,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr484REQUIRES_VIOLATION [2021-10-16 02:02:11,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr485REQUIRES_VIOLATION [2021-10-16 02:02:11,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr486REQUIRES_VIOLATION [2021-10-16 02:02:11,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr487REQUIRES_VIOLATION [2021-10-16 02:02:11,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr488REQUIRES_VIOLATION [2021-10-16 02:02:11,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr489REQUIRES_VIOLATION [2021-10-16 02:02:11,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr490REQUIRES_VIOLATION [2021-10-16 02:02:11,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr491REQUIRES_VIOLATION [2021-10-16 02:02:11,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr492REQUIRES_VIOLATION [2021-10-16 02:02:11,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr493REQUIRES_VIOLATION [2021-10-16 02:02:11,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr494ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr495ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr496ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr497REQUIRES_VIOLATION [2021-10-16 02:02:11,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr498REQUIRES_VIOLATION [2021-10-16 02:02:11,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr499ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr500ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr501ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr502REQUIRES_VIOLATION [2021-10-16 02:02:11,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr503REQUIRES_VIOLATION [2021-10-16 02:02:11,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr504ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr505ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr506ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr507ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr508ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr509ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:02:11,552 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr510ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:02:11,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-16 02:02:11,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2021-10-16 02:02:11,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-16 02:02:12,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:02:12,174 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 02:02:12,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:02:12 BoogieIcfgContainer [2021-10-16 02:02:12,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 02:02:12,210 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-16 02:02:12,210 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-16 02:02:12,210 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-16 02:02:12,211 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:59:30" (3/4) ... [2021-10-16 02:02:12,229 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-16 02:02:12,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-16 02:02:12,230 INFO L168 Benchmark]: Toolchain (without parser) took 166262.14 ms. Allocated memory was 79.7 MB in the beginning and 176.2 MB in the end (delta: 96.5 MB). Free memory was 43.3 MB in the beginning and 98.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 16.1 GB. [2021-10-16 02:02:12,230 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 79.7 MB. Free memory was 61.6 MB in the beginning and 61.5 MB in the end (delta: 125.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:02:12,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.27 ms. Allocated memory is still 79.7 MB. Free memory was 43.1 MB in the beginning and 54.6 MB in the end (delta: -11.5 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2021-10-16 02:02:12,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.09 ms. Allocated memory is still 79.7 MB. Free memory was 54.6 MB in the beginning and 49.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-16 02:02:12,231 INFO L168 Benchmark]: Boogie Preprocessor took 133.18 ms. Allocated memory is still 79.7 MB. Free memory was 49.3 MB in the beginning and 44.3 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:02:12,231 INFO L168 Benchmark]: RCFGBuilder took 4174.59 ms. Allocated memory was 79.7 MB in the beginning and 111.1 MB in the end (delta: 31.5 MB). Free memory was 44.0 MB in the beginning and 49.7 MB in the end (delta: -5.7 MB). Peak memory consumption was 33.3 MB. Max. memory is 16.1 GB. [2021-10-16 02:02:12,232 INFO L168 Benchmark]: TraceAbstraction took 161208.88 ms. Allocated memory was 111.1 MB in the beginning and 176.2 MB in the end (delta: 65.0 MB). Free memory was 49.0 MB in the beginning and 99.3 MB in the end (delta: -50.3 MB). Peak memory consumption was 77.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:02:12,232 INFO L168 Benchmark]: Witness Printer took 19.45 ms. Allocated memory is still 176.2 MB. Free memory was 99.3 MB in the beginning and 98.2 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:02:12,234 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.31 ms. Allocated memory is still 79.7 MB. Free memory was 61.6 MB in the beginning and 61.5 MB in the end (delta: 125.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 619.27 ms. Allocated memory is still 79.7 MB. Free memory was 43.1 MB in the beginning and 54.6 MB in the end (delta: -11.5 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 89.09 ms. Allocated memory is still 79.7 MB. Free memory was 54.6 MB in the beginning and 49.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 133.18 ms. Allocated memory is still 79.7 MB. Free memory was 49.3 MB in the beginning and 44.3 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4174.59 ms. Allocated memory was 79.7 MB in the beginning and 111.1 MB in the end (delta: 31.5 MB). Free memory was 44.0 MB in the beginning and 49.7 MB in the end (delta: -5.7 MB). Peak memory consumption was 33.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 161208.88 ms. Allocated memory was 111.1 MB in the beginning and 176.2 MB in the end (delta: 65.0 MB). Free memory was 49.0 MB in the beginning and 99.3 MB in the end (delta: -50.3 MB). Peak memory consumption was 77.2 MB. Max. memory is 16.1 GB. * Witness Printer took 19.45 ms. Allocated memory is still 176.2 MB. Free memory was 99.3 MB in the beginning and 98.2 MB in the end (delta: 1.0 MB). There was no memory consumed. 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: 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: 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: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: 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: 614]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: 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: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 635]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 635]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 639]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 639]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 639]: 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, 947 locations, 511 error locations. Started 1 CEGAR loops. OverallTime: 161103.6ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 29.7ms, AutomataDifference: 69993.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 45.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3257 SDtfs, 10074 SDslu, 5200 SDs, 0 SdLazy, 9057 SolverSat, 634 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 53387.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 42669.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1030occurred 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: 249.0ms AutomataMinimizationTime, 8 MinimizatonAttempts, 1120 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 92.3ms SsaConstructionTime, 348.2ms SatisfiabilityAnalysisTime, 37432.6ms InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 152 ConstructedInterpolants, 27 QuantifiedInterpolants, 1880 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-16 02:02:12,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325c8af2-7ace-460f-afea-79283ddda9d3/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...