./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/length_test03-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 385f60e373a6ce558a1e3490d71d989088c508fd .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 385f60e373a6ce558a1e3490d71d989088c508fd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:33:15,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:33:15,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:33:15,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:33:15,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:33:15,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:33:15,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:33:15,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:33:15,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:33:15,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:33:15,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:33:15,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:33:15,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:33:15,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:33:15,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:33:15,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:33:15,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:33:15,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:33:15,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:33:15,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:33:15,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:33:15,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:33:15,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:33:15,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:33:15,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:33:15,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:33:15,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:33:15,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:33:15,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:33:15,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:33:15,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:33:15,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:33:15,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:33:15,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:33:15,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:33:15,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:33:15,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:33:15,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:33:15,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:33:15,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:33:15,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:33:15,153 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-13 07:33:15,199 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:33:15,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:33:15,200 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:33:15,201 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:33:15,201 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:33:15,201 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:33:15,201 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:33:15,202 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:33:15,202 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:33:15,202 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:33:15,203 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:33:15,203 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:33:15,204 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:33:15,204 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:33:15,204 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:33:15,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 07:33:15,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 07:33:15,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:33:15,205 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:33:15,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 07:33:15,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:33:15,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:33:15,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:33:15,206 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 07:33:15,207 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 07:33:15,207 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 07:33:15,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:33:15,209 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:33:15,209 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:33:15,209 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:33:15,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:33:15,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:33:15,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:33:15,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:33:15,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:33:15,211 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:33:15,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:33:15,211 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:33:15,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:33:15,211 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_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 385f60e373a6ce558a1e3490d71d989088c508fd [2021-10-13 07:33:15,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:33:15,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:33:15,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:33:15,504 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:33:15,505 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:33:15,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2021-10-13 07:33:15,578 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/data/25cf98d1b/bac3784265254073b83bf0acbb2aae4e/FLAGa3289b721 [2021-10-13 07:33:16,156 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:33:16,157 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2021-10-13 07:33:16,168 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/data/25cf98d1b/bac3784265254073b83bf0acbb2aae4e/FLAGa3289b721 [2021-10-13 07:33:16,452 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/data/25cf98d1b/bac3784265254073b83bf0acbb2aae4e [2021-10-13 07:33:16,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:33:16,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:33:16,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:33:16,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:33:16,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:33:16,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:33:16" (1/1) ... [2021-10-13 07:33:16,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ddf2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16, skipping insertion in model container [2021-10-13 07:33:16,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:33:16" (1/1) ... [2021-10-13 07:33:16,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:33:16,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:33:16,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:33:16,857 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:33:16,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:33:16,957 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:33:16,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16 WrapperNode [2021-10-13 07:33:16,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:33:16,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:33:16,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:33:16,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:33:16,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16" (1/1) ... [2021-10-13 07:33:16,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16" (1/1) ... [2021-10-13 07:33:17,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:33:17,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:33:17,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:33:17,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:33:17,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16" (1/1) ... [2021-10-13 07:33:17,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16" (1/1) ... [2021-10-13 07:33:17,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16" (1/1) ... [2021-10-13 07:33:17,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16" (1/1) ... [2021-10-13 07:33:17,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16" (1/1) ... [2021-10-13 07:33:17,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16" (1/1) ... [2021-10-13 07:33:17,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16" (1/1) ... [2021-10-13 07:33:17,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:33:17,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:33:17,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:33:17,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:33:17,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16" (1/1) ... [2021-10-13 07:33:17,067 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:33:17,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:33:17,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:33:17,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:33:17,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 07:33:17,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 07:33:17,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 07:33:17,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:33:17,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 07:33:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 07:33:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:33:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:33:17,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:33:18,011 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:33:18,012 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-10-13 07:33:18,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:33:18 BoogieIcfgContainer [2021-10-13 07:33:18,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:33:18,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:33:18,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:33:18,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:33:18,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:33:16" (1/3) ... [2021-10-13 07:33:18,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d21069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:33:18, skipping insertion in model container [2021-10-13 07:33:18,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:16" (2/3) ... [2021-10-13 07:33:18,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d21069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:33:18, skipping insertion in model container [2021-10-13 07:33:18,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:33:18" (3/3) ... [2021-10-13 07:33:18,022 INFO L111 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2021-10-13 07:33:18,027 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:33:18,028 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2021-10-13 07:33:18,071 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:33:18,077 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:33:18,078 INFO L340 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2021-10-13 07:33:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 62 states have (on average 2.5161290322580645) internal successors, (156), 147 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 07:33:18,101 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:18,101 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 07:33:18,102 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:18,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:18,107 INFO L82 PathProgramCache]: Analyzing trace with hash 8374, now seen corresponding path program 1 times [2021-10-13 07:33:18,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:18,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380248234] [2021-10-13 07:33:18,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:18,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:18,260 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:18,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380248234] [2021-10-13 07:33:18,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380248234] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:18,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:18,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 07:33:18,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921787555] [2021-10-13 07:33:18,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:33:18,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:18,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:33:18,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:18,295 INFO L87 Difference]: Start difference. First operand has 148 states, 62 states have (on average 2.5161290322580645) internal successors, (156), 147 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:18,464 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2021-10-13 07:33:18,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:33:18,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-13 07:33:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:18,476 INFO L225 Difference]: With dead ends: 177 [2021-10-13 07:33:18,476 INFO L226 Difference]: Without dead ends: 176 [2021-10-13 07:33:18,477 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-13 07:33:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-10-13 07:33:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 144. [2021-10-13 07:33:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 62 states have (on average 2.435483870967742) internal successors, (151), 143 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2021-10-13 07:33:18,518 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 2 [2021-10-13 07:33:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:18,518 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2021-10-13 07:33:18,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2021-10-13 07:33:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 07:33:18,519 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:18,519 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 07:33:18,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:33:18,520 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:18,521 INFO L82 PathProgramCache]: Analyzing trace with hash 8375, now seen corresponding path program 1 times [2021-10-13 07:33:18,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:18,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465135444] [2021-10-13 07:33:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:18,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:18,564 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:18,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465135444] [2021-10-13 07:33:18,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465135444] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:18,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:18,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 07:33:18,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382720541] [2021-10-13 07:33:18,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:33:18,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:18,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:33:18,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:18,568 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:18,719 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2021-10-13 07:33:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:33:18,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-13 07:33:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:18,724 INFO L225 Difference]: With dead ends: 143 [2021-10-13 07:33:18,724 INFO L226 Difference]: Without dead ends: 143 [2021-10-13 07:33:18,725 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-13 07:33:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-10-13 07:33:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2021-10-13 07:33:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 62 states have (on average 2.403225806451613) internal successors, (149), 141 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2021-10-13 07:33:18,746 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 2 [2021-10-13 07:33:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:18,746 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2021-10-13 07:33:18,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2021-10-13 07:33:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-13 07:33:18,747 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:18,747 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-13 07:33:18,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:33:18,748 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash 8054183, now seen corresponding path program 1 times [2021-10-13 07:33:18,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:18,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852112199] [2021-10-13 07:33:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:18,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:18,790 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:18,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852112199] [2021-10-13 07:33:18,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852112199] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:18,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:18,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:33:18,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913429730] [2021-10-13 07:33:18,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:33:18,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:18,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:33:18,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:18,793 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:18,925 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2021-10-13 07:33:18,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:33:18,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-10-13 07:33:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:18,927 INFO L225 Difference]: With dead ends: 167 [2021-10-13 07:33:18,927 INFO L226 Difference]: Without dead ends: 167 [2021-10-13 07:33:18,927 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:18,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-13 07:33:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2021-10-13 07:33:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 68 states have (on average 2.323529411764706) internal successors, (158), 145 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2021-10-13 07:33:18,936 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 4 [2021-10-13 07:33:18,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:18,936 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2021-10-13 07:33:18,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2021-10-13 07:33:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-13 07:33:18,937 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:18,937 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-13 07:33:18,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:33:18,938 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:18,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:18,938 INFO L82 PathProgramCache]: Analyzing trace with hash 8054184, now seen corresponding path program 1 times [2021-10-13 07:33:18,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:18,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191377042] [2021-10-13 07:33:18,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:18,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:18,997 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:18,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191377042] [2021-10-13 07:33:18,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191377042] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:18,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:18,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:33:18,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523118359] [2021-10-13 07:33:18,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:33:18,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:18,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:33:19,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:19,000 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:19,120 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2021-10-13 07:33:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:33:19,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-10-13 07:33:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:19,122 INFO L225 Difference]: With dead ends: 145 [2021-10-13 07:33:19,122 INFO L226 Difference]: Without dead ends: 145 [2021-10-13 07:33:19,123 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-10-13 07:33:19,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2021-10-13 07:33:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 68 states have (on average 2.2941176470588234) internal successors, (156), 143 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2021-10-13 07:33:19,141 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 4 [2021-10-13 07:33:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:19,143 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2021-10-13 07:33:19,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2021-10-13 07:33:19,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 07:33:19,144 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:19,144 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:19,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:33:19,146 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:19,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:19,148 INFO L82 PathProgramCache]: Analyzing trace with hash -575806137, now seen corresponding path program 1 times [2021-10-13 07:33:19,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:19,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835633265] [2021-10-13 07:33:19,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:19,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:19,212 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:19,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835633265] [2021-10-13 07:33:19,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835633265] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:19,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:19,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:33:19,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608374767] [2021-10-13 07:33:19,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:33:19,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:19,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:33:19,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:19,216 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:19,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:19,348 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2021-10-13 07:33:19,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:33:19,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 07:33:19,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:19,350 INFO L225 Difference]: With dead ends: 163 [2021-10-13 07:33:19,351 INFO L226 Difference]: Without dead ends: 163 [2021-10-13 07:33:19,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:19,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-10-13 07:33:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 134. [2021-10-13 07:33:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 68 states have (on average 2.1470588235294117) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2021-10-13 07:33:19,362 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 7 [2021-10-13 07:33:19,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:19,362 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2021-10-13 07:33:19,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2021-10-13 07:33:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 07:33:19,364 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:19,364 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:19,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:33:19,365 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:19,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:19,365 INFO L82 PathProgramCache]: Analyzing trace with hash -575806136, now seen corresponding path program 1 times [2021-10-13 07:33:19,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:19,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242635088] [2021-10-13 07:33:19,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:19,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:19,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-13 07:33:19,443 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:19,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242635088] [2021-10-13 07:33:19,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242635088] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:19,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:19,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:33:19,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746871497] [2021-10-13 07:33:19,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:33:19,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:19,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:33:19,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:19,446 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:19,547 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2021-10-13 07:33:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:33:19,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 07:33:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:19,549 INFO L225 Difference]: With dead ends: 125 [2021-10-13 07:33:19,549 INFO L226 Difference]: Without dead ends: 125 [2021-10-13 07:33:19,549 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-10-13 07:33:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2021-10-13 07:33:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 2.0) internal successors, (136), 123 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2021-10-13 07:33:19,553 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 7 [2021-10-13 07:33:19,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:19,553 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2021-10-13 07:33:19,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:19,554 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2021-10-13 07:33:19,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-13 07:33:19,554 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:19,555 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:19,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:33:19,555 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:19,556 INFO L82 PathProgramCache]: Analyzing trace with hash -670121069, now seen corresponding path program 1 times [2021-10-13 07:33:19,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:19,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311466714] [2021-10-13 07:33:19,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:19,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:19,639 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:19,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311466714] [2021-10-13 07:33:19,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311466714] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:19,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:19,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:33:19,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803516345] [2021-10-13 07:33:19,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:33:19,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:19,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:33:19,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:33:19,641 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:19,831 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2021-10-13 07:33:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:33:19,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-10-13 07:33:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:19,833 INFO L225 Difference]: With dead ends: 145 [2021-10-13 07:33:19,833 INFO L226 Difference]: Without dead ends: 145 [2021-10-13 07:33:19,834 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 21.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:33:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-10-13 07:33:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2021-10-13 07:33:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 118 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2021-10-13 07:33:19,838 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 8 [2021-10-13 07:33:19,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:19,839 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2021-10-13 07:33:19,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2021-10-13 07:33:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-13 07:33:19,840 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:19,840 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:19,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:33:19,840 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:19,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash -670121068, now seen corresponding path program 1 times [2021-10-13 07:33:19,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:19,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770982980] [2021-10-13 07:33:19,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:19,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:20,014 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:20,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770982980] [2021-10-13 07:33:20,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770982980] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:20,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:20,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:33:20,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537585692] [2021-10-13 07:33:20,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:33:20,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:20,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:33:20,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:33:20,019 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:20,280 INFO L93 Difference]: Finished difference Result 217 states and 236 transitions. [2021-10-13 07:33:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:33:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-10-13 07:33:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:20,282 INFO L225 Difference]: With dead ends: 217 [2021-10-13 07:33:20,283 INFO L226 Difference]: Without dead ends: 217 [2021-10-13 07:33:20,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 62.1ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:33:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-10-13 07:33:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 110. [2021-10-13 07:33:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.6842105263157894) internal successors, (128), 109 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2021-10-13 07:33:20,290 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 8 [2021-10-13 07:33:20,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:20,290 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2021-10-13 07:33:20,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2021-10-13 07:33:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 07:33:20,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:20,291 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:20,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:33:20,292 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1517715035, now seen corresponding path program 1 times [2021-10-13 07:33:20,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:20,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406158682] [2021-10-13 07:33:20,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:20,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:20,553 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:20,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406158682] [2021-10-13 07:33:20,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406158682] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:20,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:20,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 07:33:20,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192482306] [2021-10-13 07:33:20,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:33:20,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:20,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:33:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:33:20,556 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:20,841 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2021-10-13 07:33:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 07:33:20,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-13 07:33:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:20,843 INFO L225 Difference]: With dead ends: 147 [2021-10-13 07:33:20,843 INFO L226 Difference]: Without dead ends: 147 [2021-10-13 07:33:20,844 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 92.7ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-10-13 07:33:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-10-13 07:33:20,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 114. [2021-10-13 07:33:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.65) internal successors, (132), 113 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2021-10-13 07:33:20,847 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 15 [2021-10-13 07:33:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:20,847 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2021-10-13 07:33:20,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2021-10-13 07:33:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 07:33:20,848 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:20,849 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:20,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:33:20,849 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:20,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:20,849 INFO L82 PathProgramCache]: Analyzing trace with hash 740883687, now seen corresponding path program 1 times [2021-10-13 07:33:20,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:20,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290138354] [2021-10-13 07:33:20,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:20,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:21,054 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:21,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290138354] [2021-10-13 07:33:21,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290138354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:21,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:21,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 07:33:21,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548960514] [2021-10-13 07:33:21,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:33:21,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:21,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:33:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:33:21,057 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:21,389 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2021-10-13 07:33:21,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:33:21,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-10-13 07:33:21,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:21,390 INFO L225 Difference]: With dead ends: 141 [2021-10-13 07:33:21,391 INFO L226 Difference]: Without dead ends: 141 [2021-10-13 07:33:21,391 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 105.9ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-10-13 07:33:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-10-13 07:33:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2021-10-13 07:33:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2021-10-13 07:33:21,395 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 16 [2021-10-13 07:33:21,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:21,395 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2021-10-13 07:33:21,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2021-10-13 07:33:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 07:33:21,397 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:21,397 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:21,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:33:21,397 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:21,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:21,398 INFO L82 PathProgramCache]: Analyzing trace with hash 541612490, now seen corresponding path program 1 times [2021-10-13 07:33:21,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:21,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642810354] [2021-10-13 07:33:21,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:21,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:21,436 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:21,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642810354] [2021-10-13 07:33:21,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642810354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:21,437 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:21,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:33:21,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494294465] [2021-10-13 07:33:21,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:33:21,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:33:21,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:21,439 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:21,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:21,454 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2021-10-13 07:33:21,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:33:21,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 07:33:21,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:21,456 INFO L225 Difference]: With dead ends: 143 [2021-10-13 07:33:21,456 INFO L226 Difference]: Without dead ends: 143 [2021-10-13 07:33:21,456 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-10-13 07:33:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 106. [2021-10-13 07:33:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.5972222222222223) internal successors, (115), 105 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2021-10-13 07:33:21,460 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 21 [2021-10-13 07:33:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:21,460 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2021-10-13 07:33:21,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2021-10-13 07:33:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 07:33:21,461 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:21,462 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:21,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:33:21,462 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:21,463 INFO L82 PathProgramCache]: Analyzing trace with hash 541456003, now seen corresponding path program 1 times [2021-10-13 07:33:21,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:21,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035513031] [2021-10-13 07:33:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:21,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:21,537 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:21,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035513031] [2021-10-13 07:33:21,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035513031] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:21,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:21,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:33:21,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933502272] [2021-10-13 07:33:21,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:33:21,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:21,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:33:21,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:33:21,539 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:21,687 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2021-10-13 07:33:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:33:21,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 07:33:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:21,698 INFO L225 Difference]: With dead ends: 137 [2021-10-13 07:33:21,699 INFO L226 Difference]: Without dead ends: 137 [2021-10-13 07:33:21,699 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:33:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-13 07:33:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2021-10-13 07:33:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 104 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2021-10-13 07:33:21,702 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 21 [2021-10-13 07:33:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:21,703 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2021-10-13 07:33:21,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2021-10-13 07:33:21,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 07:33:21,704 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:21,704 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:21,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 07:33:21,705 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:21,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:21,705 INFO L82 PathProgramCache]: Analyzing trace with hash 541456004, now seen corresponding path program 1 times [2021-10-13 07:33:21,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:21,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741285874] [2021-10-13 07:33:21,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:21,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:21,868 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:21,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741285874] [2021-10-13 07:33:21,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741285874] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:21,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:21,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:33:21,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605233331] [2021-10-13 07:33:21,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:33:21,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:33:21,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:33:21,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:33:21,870 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:22,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:22,046 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2021-10-13 07:33:22,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:33:22,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 07:33:22,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:22,047 INFO L225 Difference]: With dead ends: 114 [2021-10-13 07:33:22,047 INFO L226 Difference]: Without dead ends: 114 [2021-10-13 07:33:22,047 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 55.1ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:33:22,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-13 07:33:22,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2021-10-13 07:33:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-10-13 07:33:22,050 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 21 [2021-10-13 07:33:22,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:22,050 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-10-13 07:33:22,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-10-13 07:33:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 07:33:22,051 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:22,052 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:22,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 07:33:22,052 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:22,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1339952633, now seen corresponding path program 1 times [2021-10-13 07:33:22,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:33:22,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248061660] [2021-10-13 07:33:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:22,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:33:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:22,507 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:33:22,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248061660] [2021-10-13 07:33:22,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248061660] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:33:22,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012812125] [2021-10-13 07:33:22,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:22,508 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:33:22,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:33:22,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:33:22,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 07:33:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:22,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 36 conjunts are in the unsatisfiable core [2021-10-13 07:33:22,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:33:22,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:33:22,812 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-10-13 07:33:22,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-10-13 07:33:22,990 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-10-13 07:33:22,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 37 [2021-10-13 07:33:23,446 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 20 treesize of output 16 [2021-10-13 07:33:23,541 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 29 treesize of output 28 [2021-10-13 07:33:23,666 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 07:33:23,666 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 87 treesize of output 62 [2021-10-13 07:33:24,048 INFO L354 Elim1Store]: treesize reduction 108, result has 27.0 percent of original size [2021-10-13 07:33:24,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 93 treesize of output 117 [2021-10-13 07:33:24,284 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 07:33:24,285 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 106 treesize of output 73 [2021-10-13 07:33:25,018 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 07:33:25,019 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 104 treesize of output 82 [2021-10-13 07:33:25,249 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 07:33:25,250 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 113 treesize of output 91 [2021-10-13 07:33:25,502 INFO L354 Elim1Store]: treesize reduction 150, result has 2.0 percent of original size [2021-10-13 07:33:25,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 129 treesize of output 75 [2021-10-13 07:33:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:25,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:33:27,964 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:33:27,965 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-10-13 07:33:36,600 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 34382 treesize of output 34286 [2021-10-13 07:33:36,834 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 07:33:36,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1246785351] [2021-10-13 07:33:36,859 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2021-10-13 07:33:36,860 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 07:33:36,866 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-13 07:33:36,873 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-13 07:33:36,874 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-13 07:33:36,931 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:33:36,933 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:33:36,933 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:33:36,934 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-13 07:33:36,934 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:33:36,935 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:33:36,935 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-13 07:33:36,936 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-13 07:33:36,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:33:36,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:33:36,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:33:36,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-10-13 07:33:36,960 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:33:36,960 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 07:33:36,961 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:33:36,961 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 07:33:36,962 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-13 07:33:36,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:33:36,983 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:33:36,984 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:33:36,986 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-13 07:33:36,986 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-13 07:33:36,986 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:113 [2021-10-13 07:33:37,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:33:37,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-13 07:33:37,209 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#valid_149| at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.constructTermVarsProc(BasicPredicateFactory.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:81) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.predicate(SymbolicTools.java:174) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-13 07:33:37,212 INFO L168 Benchmark]: Toolchain (without parser) took 20755.71 ms. Allocated memory was 153.1 MB in the beginning and 245.4 MB in the end (delta: 92.3 MB). Free memory was 115.5 MB in the beginning and 82.6 MB in the end (delta: 33.0 MB). Peak memory consumption was 124.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:33:37,212 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 153.1 MB. Free memory was 123.4 MB in the beginning and 123.4 MB in the end (delta: 27.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:33:37,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.22 ms. Allocated memory is still 153.1 MB. Free memory was 115.3 MB in the beginning and 119.3 MB in the end (delta: -4.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:33:37,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.93 ms. Allocated memory is still 153.1 MB. Free memory was 119.3 MB in the beginning and 116.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:33:37,213 INFO L168 Benchmark]: Boogie Preprocessor took 34.68 ms. Allocated memory is still 153.1 MB. Free memory was 116.7 MB in the beginning and 115.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:33:37,214 INFO L168 Benchmark]: RCFGBuilder took 968.21 ms. Allocated memory is still 153.1 MB. Free memory was 115.1 MB in the beginning and 83.7 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-10-13 07:33:37,214 INFO L168 Benchmark]: TraceAbstraction took 19195.06 ms. Allocated memory was 153.1 MB in the beginning and 245.4 MB in the end (delta: 92.3 MB). Free memory was 83.1 MB in the beginning and 82.6 MB in the end (delta: 556.8 kB). Peak memory consumption was 95.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:33:37,216 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.23 ms. Allocated memory is still 153.1 MB. Free memory was 123.4 MB in the beginning and 123.4 MB in the end (delta: 27.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 500.22 ms. Allocated memory is still 153.1 MB. Free memory was 115.3 MB in the beginning and 119.3 MB in the end (delta: -4.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.93 ms. Allocated memory is still 153.1 MB. Free memory was 119.3 MB in the beginning and 116.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.68 ms. Allocated memory is still 153.1 MB. Free memory was 116.7 MB in the beginning and 115.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 968.21 ms. Allocated memory is still 153.1 MB. Free memory was 115.1 MB in the beginning and 83.7 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19195.06 ms. Allocated memory was 153.1 MB in the beginning and 245.4 MB in the end (delta: 92.3 MB). Free memory was 83.1 MB in the beginning and 82.6 MB in the end (delta: 556.8 kB). Peak memory consumption was 95.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#valid_149| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#valid_149|: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-13 07:33:37,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:33:39,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:33:39,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:33:39,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:33:39,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:33:39,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:33:39,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:33:39,762 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:33:39,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:33:39,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:33:39,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:33:39,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:33:39,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:33:39,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:33:39,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:33:39,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:33:39,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:33:39,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:33:39,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:33:39,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:33:39,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:33:39,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:33:39,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:33:39,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:33:39,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:33:39,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:33:39,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:33:39,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:33:39,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:33:39,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:33:39,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:33:39,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:33:39,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:33:39,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:33:39,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:33:39,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:33:39,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:33:39,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:33:39,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:33:39,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:33:39,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:33:39,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-10-13 07:33:39,892 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:33:39,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:33:39,894 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:33:39,894 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:33:39,895 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:33:39,895 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:33:39,895 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:33:39,895 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:33:39,896 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:33:39,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 07:33:39,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 07:33:39,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:33:39,898 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:33:39,899 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 07:33:39,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:33:39,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:33:39,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:33:39,899 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 07:33:39,900 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 07:33:39,900 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 07:33:39,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:33:39,900 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:33:39,901 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 07:33:39,901 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 07:33:39,901 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:33:39,901 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:33:39,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:33:39,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 07:33:39,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:33:39,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:33:39,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:33:39,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:33:39,903 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 07:33:39,903 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 07:33:39,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:33:39,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:33:39,904 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_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 385f60e373a6ce558a1e3490d71d989088c508fd [2021-10-13 07:33:40,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:33:40,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:33:40,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:33:40,318 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:33:40,318 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:33:40,319 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2021-10-13 07:33:40,379 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/data/347c93364/fa2fe50898564eed986942195a9c343d/FLAG3e83ba938 [2021-10-13 07:33:40,972 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:33:40,976 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2021-10-13 07:33:41,001 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/data/347c93364/fa2fe50898564eed986942195a9c343d/FLAG3e83ba938 [2021-10-13 07:33:41,255 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/data/347c93364/fa2fe50898564eed986942195a9c343d [2021-10-13 07:33:41,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:33:41,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:33:41,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:33:41,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:33:41,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:33:41,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:33:41" (1/1) ... [2021-10-13 07:33:41,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce56089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41, skipping insertion in model container [2021-10-13 07:33:41,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:33:41" (1/1) ... [2021-10-13 07:33:41,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:33:41,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:33:41,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:33:41,730 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:33:41,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:33:41,842 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:33:41,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41 WrapperNode [2021-10-13 07:33:41,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:33:41,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:33:41,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:33:41,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:33:41,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41" (1/1) ... [2021-10-13 07:33:41,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41" (1/1) ... [2021-10-13 07:33:41,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:33:41,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:33:41,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:33:41,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:33:41,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41" (1/1) ... [2021-10-13 07:33:41,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41" (1/1) ... [2021-10-13 07:33:41,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41" (1/1) ... [2021-10-13 07:33:41,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41" (1/1) ... [2021-10-13 07:33:41,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41" (1/1) ... [2021-10-13 07:33:41,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41" (1/1) ... [2021-10-13 07:33:42,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41" (1/1) ... [2021-10-13 07:33:42,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:33:42,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:33:42,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:33:42,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:33:42,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41" (1/1) ... [2021-10-13 07:33:42,024 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:33:42,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:33:42,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:33:42,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:33:42,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 07:33:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 07:33:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:33:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 07:33:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-10-13 07:33:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 07:33:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 07:33:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:33:42,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:33:43,076 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:33:43,076 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-10-13 07:33:43,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:33:43 BoogieIcfgContainer [2021-10-13 07:33:43,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:33:43,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:33:43,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:33:43,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:33:43,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:33:41" (1/3) ... [2021-10-13 07:33:43,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edca28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:33:43, skipping insertion in model container [2021-10-13 07:33:43,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:33:41" (2/3) ... [2021-10-13 07:33:43,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edca28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:33:43, skipping insertion in model container [2021-10-13 07:33:43,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:33:43" (3/3) ... [2021-10-13 07:33:43,087 INFO L111 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2021-10-13 07:33:43,092 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:33:43,093 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2021-10-13 07:33:43,135 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:33:43,141 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:33:43,142 INFO L340 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2021-10-13 07:33:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 81 states have (on average 2.197530864197531) internal successors, (178), 166 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 07:33:43,166 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:43,166 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 07:33:43,167 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:43,173 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-10-13 07:33:43,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:33:43,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119042375] [2021-10-13 07:33:43,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:43,186 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:33:43,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:33:43,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:33:43,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 07:33:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:43,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:33:43,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:33:43,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:33:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:43,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:33:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:43,373 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:33:43,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119042375] [2021-10-13 07:33:43,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119042375] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:43,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:43,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 07:33:43,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501978014] [2021-10-13 07:33:43,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:33:43,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:33:43,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:33:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:43,402 INFO L87 Difference]: Start difference. First operand has 167 states, 81 states have (on average 2.197530864197531) internal successors, (178), 166 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:43,901 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2021-10-13 07:33:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:33:43,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-13 07:33:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:43,920 INFO L225 Difference]: With dead ends: 201 [2021-10-13 07:33:43,920 INFO L226 Difference]: Without dead ends: 199 [2021-10-13 07:33:43,922 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:43,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-13 07:33:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 162. [2021-10-13 07:33:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 80 states have (on average 2.1125) internal successors, (169), 161 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 169 transitions. [2021-10-13 07:33:43,978 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 169 transitions. Word has length 3 [2021-10-13 07:33:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:43,978 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 169 transitions. [2021-10-13 07:33:43,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 169 transitions. [2021-10-13 07:33:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 07:33:43,979 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:43,979 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 07:33:43,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:33:44,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:33:44,183 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:44,184 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-10-13 07:33:44,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:33:44,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84132627] [2021-10-13 07:33:44,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:44,185 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:33:44,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:33:44,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:33:44,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 07:33:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:44,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 07:33:44,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:33:44,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:33:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:44,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:33:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:44,318 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:33:44,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84132627] [2021-10-13 07:33:44,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84132627] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:44,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:44,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 07:33:44,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483895835] [2021-10-13 07:33:44,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:33:44,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:33:44,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:33:44,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:33:44,322 INFO L87 Difference]: Start difference. First operand 162 states and 169 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:45,321 INFO L93 Difference]: Finished difference Result 211 states and 222 transitions. [2021-10-13 07:33:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:33:45,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-13 07:33:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:45,324 INFO L225 Difference]: With dead ends: 211 [2021-10-13 07:33:45,324 INFO L226 Difference]: Without dead ends: 211 [2021-10-13 07:33:45,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:33:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-10-13 07:33:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 184. [2021-10-13 07:33:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 104 states have (on average 2.125) internal successors, (221), 183 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 221 transitions. [2021-10-13 07:33:45,353 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 221 transitions. Word has length 3 [2021-10-13 07:33:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:45,354 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 221 transitions. [2021-10-13 07:33:45,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 221 transitions. [2021-10-13 07:33:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 07:33:45,358 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:45,358 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 07:33:45,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 07:33:45,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:33:45,569 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:45,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:45,570 INFO L82 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2021-10-13 07:33:45,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:33:45,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513185597] [2021-10-13 07:33:45,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:45,571 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:33:45,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:33:45,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:33:45,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 07:33:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:45,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:33:45,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:33:45,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:33:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:45,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:33:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:45,666 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:33:45,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513185597] [2021-10-13 07:33:45,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513185597] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:45,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:45,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 07:33:45,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695972887] [2021-10-13 07:33:45,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:33:45,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:33:45,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:33:45,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:45,669 INFO L87 Difference]: Start difference. First operand 184 states and 221 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:46,000 INFO L93 Difference]: Finished difference Result 212 states and 251 transitions. [2021-10-13 07:33:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:33:46,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-13 07:33:46,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:46,002 INFO L225 Difference]: With dead ends: 212 [2021-10-13 07:33:46,002 INFO L226 Difference]: Without dead ends: 212 [2021-10-13 07:33:46,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-13 07:33:46,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 189. [2021-10-13 07:33:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 111 states have (on average 2.081081081081081) internal successors, (231), 188 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 231 transitions. [2021-10-13 07:33:46,016 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 231 transitions. Word has length 6 [2021-10-13 07:33:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:46,017 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 231 transitions. [2021-10-13 07:33:46,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 231 transitions. [2021-10-13 07:33:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 07:33:46,018 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:46,018 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 07:33:46,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-13 07:33:46,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:33:46,248 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:46,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:46,249 INFO L82 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2021-10-13 07:33:46,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:33:46,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714384786] [2021-10-13 07:33:46,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:46,250 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:33:46,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:33:46,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:33:46,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 07:33:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:46,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 07:33:46,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:33:46,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:33:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:46,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:33:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:46,454 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:33:46,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714384786] [2021-10-13 07:33:46,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714384786] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:46,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:46,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 07:33:46,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595084706] [2021-10-13 07:33:46,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:33:46,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:33:46,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:33:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:33:46,457 INFO L87 Difference]: Start difference. First operand 189 states and 231 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:47,208 INFO L93 Difference]: Finished difference Result 272 states and 294 transitions. [2021-10-13 07:33:47,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:33:47,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-13 07:33:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:47,211 INFO L225 Difference]: With dead ends: 272 [2021-10-13 07:33:47,211 INFO L226 Difference]: Without dead ends: 272 [2021-10-13 07:33:47,211 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:33:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-10-13 07:33:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 187. [2021-10-13 07:33:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 111 states have (on average 2.063063063063063) internal successors, (229), 186 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 229 transitions. [2021-10-13 07:33:47,223 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 229 transitions. Word has length 6 [2021-10-13 07:33:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:47,224 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 229 transitions. [2021-10-13 07:33:47,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 229 transitions. [2021-10-13 07:33:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 07:33:47,225 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:47,225 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:47,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-13 07:33:47,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:33:47,436 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:47,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:47,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1113926380, now seen corresponding path program 1 times [2021-10-13 07:33:47,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:33:47,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438860491] [2021-10-13 07:33:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:47,437 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:33:47,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:33:47,438 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:33:47,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-13 07:33:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:47,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:33:47,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:33:47,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:33:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:47,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:33:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:47,603 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:33:47,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438860491] [2021-10-13 07:33:47,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438860491] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:47,605 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:47,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 07:33:47,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839643476] [2021-10-13 07:33:47,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:33:47,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:33:47,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:33:47,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:47,618 INFO L87 Difference]: Start difference. First operand 187 states and 229 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:47,936 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-10-13 07:33:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:33:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 07:33:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:47,938 INFO L225 Difference]: With dead ends: 210 [2021-10-13 07:33:47,938 INFO L226 Difference]: Without dead ends: 210 [2021-10-13 07:33:47,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:33:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-13 07:33:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 177. [2021-10-13 07:33:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 111 states have (on average 1.927927927927928) internal successors, (214), 176 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 214 transitions. [2021-10-13 07:33:47,947 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 214 transitions. Word has length 10 [2021-10-13 07:33:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:47,947 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 214 transitions. [2021-10-13 07:33:47,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 214 transitions. [2021-10-13 07:33:47,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 07:33:47,948 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:47,948 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:47,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 07:33:48,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:33:48,149 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:48,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:48,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1113926381, now seen corresponding path program 1 times [2021-10-13 07:33:48,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:33:48,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724586325] [2021-10-13 07:33:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:48,150 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:33:48,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:33:48,151 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:33:48,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-13 07:33:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:48,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 07:33:48,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:33:48,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:33:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:48,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:33:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:48,323 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:33:48,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724586325] [2021-10-13 07:33:48,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724586325] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:48,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:48,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 07:33:48,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019674200] [2021-10-13 07:33:48,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:33:48,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:33:48,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:33:48,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:33:48,326 INFO L87 Difference]: Start difference. First operand 177 states and 214 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:48,661 INFO L93 Difference]: Finished difference Result 167 states and 199 transitions. [2021-10-13 07:33:48,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:33:48,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 07:33:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:48,663 INFO L225 Difference]: With dead ends: 167 [2021-10-13 07:33:48,663 INFO L226 Difference]: Without dead ends: 167 [2021-10-13 07:33:48,663 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:33:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-13 07:33:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-10-13 07:33:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.7927927927927927) internal successors, (199), 166 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 199 transitions. [2021-10-13 07:33:48,669 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 199 transitions. Word has length 10 [2021-10-13 07:33:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:48,670 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 199 transitions. [2021-10-13 07:33:48,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 199 transitions. [2021-10-13 07:33:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 07:33:48,678 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:48,678 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:48,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-13 07:33:48,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:33:48,889 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:48,890 INFO L82 PathProgramCache]: Analyzing trace with hash 171979406, now seen corresponding path program 1 times [2021-10-13 07:33:48,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:33:48,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231182554] [2021-10-13 07:33:48,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:48,891 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:33:48,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:33:48,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:33:48,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-13 07:33:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:48,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 07:33:48,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:33:48,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:33:49,036 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 07:33:49,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-10-13 07:33:49,293 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-10-13 07:33:49,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2021-10-13 07:33:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:49,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:33:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:53,205 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:33:53,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231182554] [2021-10-13 07:33:53,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231182554] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:53,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:53,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-10-13 07:33:53,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979235573] [2021-10-13 07:33:53,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:33:53,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:33:53,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:33:53,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2021-10-13 07:33:53,208 INFO L87 Difference]: Start difference. First operand 167 states and 199 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:33:53,842 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2021-10-13 07:33:53,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:33:53,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 11 [2021-10-13 07:33:53,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:33:53,843 INFO L225 Difference]: With dead ends: 187 [2021-10-13 07:33:53,843 INFO L226 Difference]: Without dead ends: 187 [2021-10-13 07:33:53,844 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3740.9ms TimeCoverageRelationStatistics Valid=22, Invalid=33, Unknown=1, NotChecked=0, Total=56 [2021-10-13 07:33:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-10-13 07:33:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 154. [2021-10-13 07:33:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.6126126126126126) internal successors, (179), 153 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2021-10-13 07:33:53,847 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 11 [2021-10-13 07:33:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:33:53,847 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2021-10-13 07:33:53,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:33:53,847 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2021-10-13 07:33:53,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 07:33:53,848 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:33:53,848 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:33:53,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-13 07:33:54,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:33:54,048 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:33:54,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:33:54,049 INFO L82 PathProgramCache]: Analyzing trace with hash 171979407, now seen corresponding path program 1 times [2021-10-13 07:33:54,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:33:54,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282417554] [2021-10-13 07:33:54,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:33:54,050 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:33:54,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:33:54,053 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:33:54,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-13 07:33:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:33:54,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:33:54,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:33:54,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:33:54,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:33:54,281 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-13 07:33:54,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2021-10-13 07:33:54,291 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 07:33:54,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2021-10-13 07:33:54,446 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-10-13 07:33:54,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 34 [2021-10-13 07:33:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:54,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:33:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:33:57,510 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:33:57,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282417554] [2021-10-13 07:33:57,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282417554] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:33:57,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:33:57,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-13 07:33:57,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533052608] [2021-10-13 07:33:57,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:33:57,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:33:57,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:33:57,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-10-13 07:33:57,512 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:34:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:34:06,738 INFO L93 Difference]: Finished difference Result 361 states and 396 transitions. [2021-10-13 07:34:06,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 07:34:06,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 11 [2021-10-13 07:34:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:34:06,743 INFO L225 Difference]: With dead ends: 361 [2021-10-13 07:34:06,743 INFO L226 Difference]: Without dead ends: 361 [2021-10-13 07:34:06,743 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 7883.6ms TimeCoverageRelationStatistics Valid=69, Invalid=140, Unknown=1, NotChecked=0, Total=210 [2021-10-13 07:34:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-10-13 07:34:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 121. [2021-10-13 07:34:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.528735632183908) internal successors, (133), 120 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:34:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2021-10-13 07:34:06,749 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 11 [2021-10-13 07:34:06,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:34:06,749 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2021-10-13 07:34:06,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:34:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2021-10-13 07:34:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 07:34:06,751 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:34:06,751 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] [2021-10-13 07:34:06,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-13 07:34:06,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:34:06,965 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:34:06,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:34:06,966 INFO L82 PathProgramCache]: Analyzing trace with hash 719743272, now seen corresponding path program 1 times [2021-10-13 07:34:06,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:34:06,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920171188] [2021-10-13 07:34:06,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:34:06,966 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:34:06,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:34:06,967 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:34:06,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-13 07:34:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:34:07,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-13 07:34:07,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:34:07,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:34:07,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 07:34:07,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 07:34:07,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:34:07,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-13 07:34:07,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:34:07,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-13 07:34:07,577 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 07:34:07,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-10-13 07:34:07,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:34:07,813 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 28 treesize of output 30 [2021-10-13 07:34:07,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:34:07,884 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 28 treesize of output 30 [2021-10-13 07:34:08,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:34:08,203 INFO L354 Elim1Store]: treesize reduction 108, result has 18.2 percent of original size [2021-10-13 07:34:08,203 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 91 [2021-10-13 07:34:08,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:34:08,349 INFO L354 Elim1Store]: treesize reduction 108, result has 18.2 percent of original size [2021-10-13 07:34:08,350 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 87 [2021-10-13 07:34:08,982 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-10-13 07:34:08,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 72 [2021-10-13 07:34:09,550 INFO L354 Elim1Store]: treesize reduction 180, result has 14.7 percent of original size [2021-10-13 07:34:09,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 100 [2021-10-13 07:34:09,750 INFO L354 Elim1Store]: treesize reduction 180, result has 14.7 percent of original size [2021-10-13 07:34:09,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 85 [2021-10-13 07:34:10,049 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-10-13 07:34:10,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 57 [2021-10-13 07:34:10,070 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-10-13 07:34:10,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 23 [2021-10-13 07:34:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:34:10,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:34:10,483 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:34:10,485 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-10-13 07:34:10,490 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:34:10,491 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-10-13 07:34:12,517 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ 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_2)) c_ULTIMATE.start_append_~head.base) c_ULTIMATE.start_append_~head.offset) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ 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_1)) c_ULTIMATE.start_append_~head.base) c_ULTIMATE.start_append_~head.offset) (_ bv0 32)))) is different from false [2021-10-13 07:34:14,612 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_47 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_47))))) (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| v_ULTIMATE.start_append_~node~0.base_47 (store (select |c_#memory_$Pointer$.offset| v_ULTIMATE.start_append_~node~0.base_47) 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 (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_47 (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_47) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_2)) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)))))) is different from false [2021-10-13 07:34:16,863 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_47 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_47) 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))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_47) 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)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_47))))))) is different from false [2021-10-13 07:34:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:34:42,777 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:34:42,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920171188] [2021-10-13 07:34:42,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920171188] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:34:42,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:34:42,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 20 [2021-10-13 07:34:42,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165206041] [2021-10-13 07:34:42,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-13 07:34:42,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:34:42,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-13 07:34:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=193, Unknown=15, NotChecked=96, Total=380 [2021-10-13 07:34:42,780 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:34:47,172 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (.cse1 (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base)) (.cse5 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base))) (and (exists ((v_arrayElimCell_13 (_ BitVec 1))) (let ((.cse0 (bvneg v_arrayElimCell_13))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse0 (select |c_#valid| c_ULTIMATE.start_main_~list~0.base)))))) (= c_ULTIMATE.start_main_~list~0.offset (_ bv0 32)) (= (select .cse1 .cse2) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~list2~0.base))) (_ bv1 1))) (forall ((v_ULTIMATE.start_append_~node~0.base_47 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse3 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse3 v_ULTIMATE.start_append_~node~0.base_47) 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))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse4 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse4 v_ULTIMATE.start_append_~node~0.base_47) 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)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_47))))))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32)) (= (_ bv0 32) (select .cse5 .cse2)) (= (select .cse1 c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select .cse5 c_ULTIMATE.start_main_~list~0.offset)) (not (= c_ULTIMATE.start_main_~list2~0.base c_ULTIMATE.start_main_~list~0.base)))) is different from false [2021-10-13 07:35:11,590 WARN L207 SmtUtils]: Spent 16.30 s on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2021-10-13 07:35:33,606 WARN L207 SmtUtils]: Spent 17.80 s on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2021-10-13 07:36:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:36:02,132 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2021-10-13 07:36:02,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 07:36:02,135 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 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 20 [2021-10-13 07:36:02,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:36:02,136 INFO L225 Difference]: With dead ends: 143 [2021-10-13 07:36:02,136 INFO L226 Difference]: Without dead ends: 143 [2021-10-13 07:36:02,137 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 76681.4ms TimeCoverageRelationStatistics Valid=107, Invalid=310, Unknown=19, NotChecked=164, Total=600 [2021-10-13 07:36:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-10-13 07:36:02,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 126. [2021-10-13 07:36:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 92 states have (on average 1.5) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:36:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2021-10-13 07:36:02,142 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 20 [2021-10-13 07:36:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:36:02,142 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2021-10-13 07:36:02,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:36:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2021-10-13 07:36:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:36:02,144 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:36:02,144 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] [2021-10-13 07:36:02,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-13 07:36:02,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:36:02,359 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:36:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:36:02,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1685508437, now seen corresponding path program 1 times [2021-10-13 07:36:02,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:36:02,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939252597] [2021-10-13 07:36:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:36:02,360 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:36:02,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:36:02,361 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:36:02,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-13 07:36:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:36:02,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-13 07:36:02,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:36:02,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-13 07:36:02,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-13 07:36:02,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-13 07:36:02,999 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 07:36:02,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-10-13 07:36:03,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-13 07:36:03,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-13 07:36:03,638 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-10-13 07:36:03,639 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 72 treesize of output 74 [2021-10-13 07:36:03,757 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-10-13 07:36:03,757 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 68 treesize of output 70 [2021-10-13 07:36:04,374 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-10-13 07:36:04,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 72 [2021-10-13 07:36:04,996 INFO L354 Elim1Store]: treesize reduction 136, result has 16.0 percent of original size [2021-10-13 07:36:04,997 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 87 [2021-10-13 07:36:05,158 INFO L354 Elim1Store]: treesize reduction 136, result has 16.0 percent of original size [2021-10-13 07:36:05,158 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 72 [2021-10-13 07:36:05,881 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-10-13 07:36:05,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 51 [2021-10-13 07:36:05,902 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-10-13 07:36:05,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 20 [2021-10-13 07:36:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:36:06,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:36:06,473 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:36:06,474 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-10-13 07:36:06,480 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:36:06,481 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-10-13 07:36:08,517 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-13 07:36:19,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_48 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_3))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_4))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_48)))))))) is different from false [2021-10-13 07:36:21,299 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_48 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_48)))))) (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (ULTIMATE.start_main_~list2~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) ULTIMATE.start_main_~list2~0.offset (_ bv0 32)) (bvadd (_ bv4 32) ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_4))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (ULTIMATE.start_main_~list2~0.offset (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) ULTIMATE.start_main_~list2~0.offset (_ bv0 32)) (bvadd (_ bv4 32) ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_3))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32)))))) is different from false [2021-10-13 07:36:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:36:32,234 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:36:32,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939252597] [2021-10-13 07:36:32,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939252597] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:36:32,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:36:32,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 18 [2021-10-13 07:36:32,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233290420] [2021-10-13 07:36:32,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-13 07:36:32,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:36:32,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-13 07:36:32,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=153, Unknown=9, NotChecked=84, Total=306 [2021-10-13 07:36:32,236 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:36:38,856 WARN L207 SmtUtils]: Spent 6.16 s on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2021-10-13 07:36:42,951 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))) (and (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) .cse0) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~list2~0.base))) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32)) (exists ((v_arrayElimCell_44 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_44))) (and (= (_ bv0 1) (bvadd (bvneg .cse1) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| c_ULTIMATE.start_main_~list~0.base) .cse1))))) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) .cse0)) (forall ((v_ULTIMATE.start_append_~node~0.base_48 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse2 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse2 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_3))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse3 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse3 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_4))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_48)))))))) (not (= c_ULTIMATE.start_main_~list2~0.base c_ULTIMATE.start_main_~list~0.base)))) is different from false [2021-10-13 07:36:52,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:36:52,062 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2021-10-13 07:36:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 07:36:52,063 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 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 22 [2021-10-13 07:36:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:36:52,064 INFO L225 Difference]: With dead ends: 164 [2021-10-13 07:36:52,064 INFO L226 Difference]: Without dead ends: 164 [2021-10-13 07:36:52,064 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 39051.6ms TimeCoverageRelationStatistics Valid=118, Invalid=308, Unknown=10, NotChecked=164, Total=600 [2021-10-13 07:36:52,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-10-13 07:36:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 129. [2021-10-13 07:36:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:36:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2021-10-13 07:36:52,067 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 22 [2021-10-13 07:36:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:36:52,067 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2021-10-13 07:36:52,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:36:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2021-10-13 07:36:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 07:36:52,068 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:36:52,069 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] [2021-10-13 07:36:52,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-13 07:36:52,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:36:52,271 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:36:52,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:36:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1028150688, now seen corresponding path program 1 times [2021-10-13 07:36:52,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:36:52,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968804108] [2021-10-13 07:36:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:36:52,272 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:36:52,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:36:52,272 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:36:52,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-13 07:36:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:36:52,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 07:36:52,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:36:52,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:36:52,692 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 07:36:52,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-10-13 07:36:54,039 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-10-13 07:36:54,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50 [2021-10-13 07:36:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:36:54,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:36:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:36:56,721 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:36:56,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968804108] [2021-10-13 07:36:56,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968804108] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:36:56,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:36:56,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-10-13 07:36:56,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241757300] [2021-10-13 07:36:56,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:36:56,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:36:56,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:36:56,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2021-10-13 07:36:56,724 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:36:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:36:57,899 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2021-10-13 07:36:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:36:57,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 25 [2021-10-13 07:36:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:36:57,901 INFO L225 Difference]: With dead ends: 173 [2021-10-13 07:36:57,902 INFO L226 Difference]: Without dead ends: 173 [2021-10-13 07:36:57,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 14 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2965.6ms TimeCoverageRelationStatistics Valid=22, Invalid=33, Unknown=1, NotChecked=0, Total=56 [2021-10-13 07:36:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-10-13 07:36:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 128. [2021-10-13 07:36:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:36:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2021-10-13 07:36:57,907 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 25 [2021-10-13 07:36:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:36:57,908 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2021-10-13 07:36:57,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:36:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2021-10-13 07:36:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 07:36:57,910 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:36:57,910 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] [2021-10-13 07:36:57,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-13 07:36:58,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:36:58,119 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:36:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:36:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1028150687, now seen corresponding path program 1 times [2021-10-13 07:36:58,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:36:58,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451384219] [2021-10-13 07:36:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:36:58,120 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:36:58,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:36:58,121 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:36:58,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-13 07:36:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:36:58,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:36:58,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:36:58,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:36:58,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:36:58,792 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-13 07:36:58,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2021-10-13 07:36:58,804 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-13 07:36:58,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2021-10-13 07:36:59,469 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-10-13 07:36:59,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2021-10-13 07:36:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:36:59,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:37:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:37:03,106 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:37:03,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451384219] [2021-10-13 07:37:03,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451384219] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:37:03,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:37:03,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-13 07:37:03,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387286750] [2021-10-13 07:37:03,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:37:03,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:37:03,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:37:03,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=36, Unknown=1, NotChecked=0, Total=56 [2021-10-13 07:37:03,110 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:37:05,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:37:05,436 INFO L93 Difference]: Finished difference Result 220 states and 233 transitions. [2021-10-13 07:37:05,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:37:05,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 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 25 [2021-10-13 07:37:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:37:05,439 INFO L225 Difference]: With dead ends: 220 [2021-10-13 07:37:05,439 INFO L226 Difference]: Without dead ends: 220 [2021-10-13 07:37:05,440 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3224.4ms TimeCoverageRelationStatistics Valid=60, Invalid=95, Unknown=1, NotChecked=0, Total=156 [2021-10-13 07:37:05,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-10-13 07:37:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 120. [2021-10-13 07:37:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.368421052631579) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:37:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2021-10-13 07:37:05,445 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 25 [2021-10-13 07:37:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:37:05,446 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2021-10-13 07:37:05,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:37:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2021-10-13 07:37:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:37:05,447 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:37:05,447 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:37:05,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-13 07:37:05,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:37:05,662 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:37:05,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:37:05,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1807900189, now seen corresponding path program 1 times [2021-10-13 07:37:05,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:37:05,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704971445] [2021-10-13 07:37:05,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:37:05,663 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:37:05,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:37:05,664 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:37:05,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-13 07:37:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:37:05,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:37:05,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:37:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:37:06,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:37:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:37:06,154 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:37:06,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704971445] [2021-10-13 07:37:06,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704971445] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:37:06,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:37:06,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:37:06,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141658241] [2021-10-13 07:37:06,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:37:06,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:37:06,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:37:06,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:37:06,155 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:37:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:37:06,229 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2021-10-13 07:37:06,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:37:06,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 07:37:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:37:06,231 INFO L225 Difference]: With dead ends: 166 [2021-10-13 07:37:06,231 INFO L226 Difference]: Without dead ends: 166 [2021-10-13 07:37:06,231 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:37:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-10-13 07:37:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 138. [2021-10-13 07:37:06,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 137 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-13 07:37:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2021-10-13 07:37:06,237 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 26 [2021-10-13 07:37:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:37:06,237 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2021-10-13 07:37:06,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:37:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2021-10-13 07:37:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 07:37:06,239 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:37:06,239 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-10-13 07:37:06,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-10-13 07:37:06,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:37:06,454 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 07:37:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:37:06,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1778627636, now seen corresponding path program 1 times [2021-10-13 07:37:06,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:37:06,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838023091] [2021-10-13 07:37:06,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:37:06,455 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:37:06,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:37:06,457 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:37:06,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-13 07:37:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:37:06,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-13 07:37:06,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:37:06,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:37:06,986 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-10-13 07:37:06,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2021-10-13 07:37:07,192 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 07:37:07,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-10-13 07:37:07,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-13 07:37:08,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-10-13 07:37:08,293 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 07:37:08,293 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-13 07:37:08,807 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-13 07:37:08,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 76 [2021-10-13 07:37:09,294 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 07:37:09,294 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 61 [2021-10-13 07:37:10,389 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 07:37:10,390 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 86 treesize of output 70 [2021-10-13 07:37:10,978 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 07:37:10,978 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 97 treesize of output 81 [2021-10-13 07:37:11,418 INFO L354 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2021-10-13 07:37:11,418 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 125 treesize of output 74 [2021-10-13 07:37:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:37:11,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:37:14,496 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:37:14,497 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-13 07:37:22,451 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_55 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_55 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_55 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_55) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.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_55)))))) is different from false [2021-10-13 07:37:24,571 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_55 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_47 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_55 (_ 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_55 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_55) v_ULTIMATE.start_append_~node~0.offset_47 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_47 (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_47 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_55)))))) is different from false [2021-10-13 07:37:26,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_55 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_47 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_55 (_ 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_55 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_55) v_ULTIMATE.start_append_~node~0.offset_47 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_47 (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_47 (_ 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_55)))))) is different from false [2021-10-13 07:37:26,696 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 80045 treesize of output 79853 [2021-10-13 07:37:27,173 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:37:27,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838023091] [2021-10-13 07:37:27,174 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 07:37:27,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1057903435] [2021-10-13 07:37:27,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:37:27,175 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:37:27,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:37:27,182 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:37:27,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-10-13 07:37:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:37:28,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2021-10-13 07:37:28,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:37:28,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:37:28,307 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 07:37:28,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-10-13 07:37:28,861 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-10-13 07:37:28,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 64 [2021-10-13 07:37:31,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-13 07:37:31,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-10-13 07:37:32,548 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 07:37:32,548 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 95 treesize of output 70 [2021-10-13 07:37:33,487 INFO L354 Elim1Store]: treesize reduction 85, result has 36.6 percent of original size [2021-10-13 07:37:33,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 70 treesize of output 103 [2021-10-13 07:37:34,280 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 07:37:34,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 101 [2021-10-13 07:37:36,310 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 07:37:36,310 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 134 treesize of output 112 [2021-10-13 07:37:37,212 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 07:37:37,213 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 139 treesize of output 117 [2021-10-13 07:37:38,018 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-13 07:37:38,018 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 148 treesize of output 105 [2021-10-13 07:37:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:37:38,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:37:38,963 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:37:38,963 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-13 07:37:45,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_56 (_ BitVec 32)) (ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_56 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_56 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_56) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_56))))))) is different from false [2021-10-13 07:37:52,169 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 160110 treesize of output 159726 [2021-10-13 07:37:52,644 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 07:37:52,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130032149] [2021-10-13 07:37:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:37:52,645 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:37:52,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:37:52,645 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:37:52,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-10-13 07:37:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:37:53,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjunts are in the unsatisfiable core [2021-10-13 07:37:53,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:37:53,406 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 07:37:53,407 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-13 07:37:53,889 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-10-13 07:37:53,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-10-13 07:37:55,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-13 07:37:55,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-10-13 07:37:55,967 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 07:37:55,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 45 [2021-10-13 07:37:56,620 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-13 07:37:56,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 63 [2021-10-13 07:37:57,302 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 07:37:57,302 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 97 treesize of output 70 [2021-10-13 07:37:58,503 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 07:37:58,503 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 95 treesize of output 79 [2021-10-13 07:37:59,197 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 07:37:59,197 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 102 treesize of output 86 [2021-10-13 07:37:59,829 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-13 07:37:59,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 72 [2021-10-13 07:38:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:38:00,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:38:00,435 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:38:00,436 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-13 07:38:09,596 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~mem9.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_57 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_57))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_57 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_57 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_57) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.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-13 07:38:11,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_57 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_57 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_57))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_57 (_ 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_57 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_57) v_ULTIMATE.start_append_~node~0.offset_57 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_57 (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_57 (_ 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-13 07:38:13,794 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_57 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_57 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_57))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_57 (_ 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_57 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_57) v_ULTIMATE.start_append_~node~0.offset_57 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_57 (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_57 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))) (_ bv1 1))))) is different from false [2021-10-13 07:38:13,838 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 2496494 treesize of output 2490350 [2021-10-13 07:38:20,417 WARN L207 SmtUtils]: Spent 6.58 s on a formula simplification that was a NOOP. DAG size: 1086 [2021-10-13 07:38:20,446 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 07:38:20,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:38:20,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-10-13 07:38:20,446 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-10-13 07:38:20,446 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-10-13 07:38:20,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-13 07:38:20,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-13 07:38:20,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-13 07:38:20,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-13 07:38:20,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-13 07:38:20,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-13 07:38:20,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-13 07:38:20,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-13 07:38:20,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-13 07:38:20,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-13 07:38:20,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-13 07:38:20,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-13 07:38:20,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-13 07:38:20,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-13 07:38:20,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-13 07:38:20,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-13 07:38:20,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-13 07:38:20,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-13 07:38:20,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-13 07:38:20,459 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-13 07:38:20,459 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-13 07:38:20,459 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-13 07:38:20,459 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-13 07:38:20,459 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-13 07:38:20,460 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-13 07:38:20,460 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-13 07:38:20,460 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-13 07:38:20,460 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-13 07:38:20,460 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-13 07:38:20,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-13 07:38:20,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-13 07:38:20,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-13 07:38:20,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-13 07:38:20,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-13 07:38:20,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-13 07:38:20,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-13 07:38:20,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-13 07:38:20,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-13 07:38:20,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-13 07:38:20,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-13 07:38:20,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-13 07:38:20,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-13 07:38:20,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-13 07:38:20,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-13 07:38:20,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-13 07:38:20,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-13 07:38:20,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-13 07:38:20,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-13 07:38:20,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-13 07:38:20,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-13 07:38:20,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-13 07:38:20,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-13 07:38:20,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-13 07:38:20,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-13 07:38:20,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-13 07:38:20,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-13 07:38:20,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-13 07:38:20,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-13 07:38:20,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-13 07:38:20,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-13 07:38:20,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-13 07:38:20,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-13 07:38:20,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-13 07:38:20,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-13 07:38:20,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-13 07:38:20,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-13 07:38:20,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:38:20,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:38:20,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:38:20,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-10-13 07:38:20,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-10-13 07:38:20,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-13 07:38:20,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-10-13 07:38:20,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-10-13 07:38:20,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-13 07:38:20,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:38:20,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:38:20,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:38:20,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:38:20,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:38:20,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:38:20,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:38:20,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:38:20,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:38:20,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:38:20,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-10-13 07:38:20,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2021-10-13 07:38:20,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-10-13 07:38:21,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:38:21,093 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:38:21,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:38:21 BoogieIcfgContainer [2021-10-13 07:38:21,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:38:21,107 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:38:21,107 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:38:21,108 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:38:21,108 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:33:43" (3/4) ... [2021-10-13 07:38:21,111 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-13 07:38:21,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:38:21,112 INFO L168 Benchmark]: Toolchain (without parser) took 279851.63 ms. Allocated memory was 60.8 MB in the beginning and 257.9 MB in the end (delta: 197.1 MB). Free memory was 37.7 MB in the beginning and 192.4 MB in the end (delta: -154.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:38:21,113 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 60.8 MB. Free memory was 41.1 MB in the beginning and 41.1 MB in the end (delta: 44.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:38:21,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.17 ms. Allocated memory is still 60.8 MB. Free memory was 37.4 MB in the beginning and 35.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:38:21,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.03 ms. Allocated memory is still 60.8 MB. Free memory was 35.9 MB in the beginning and 33.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:38:21,114 INFO L168 Benchmark]: Boogie Preprocessor took 79.07 ms. Allocated memory is still 60.8 MB. Free memory was 33.5 MB in the beginning and 31.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:38:21,114 INFO L168 Benchmark]: RCFGBuilder took 1062.18 ms. Allocated memory was 60.8 MB in the beginning and 81.8 MB in the end (delta: 21.0 MB). Free memory was 31.4 MB in the beginning and 55.1 MB in the end (delta: -23.7 MB). Peak memory consumption was 12.0 MB. Max. memory is 16.1 GB. [2021-10-13 07:38:21,115 INFO L168 Benchmark]: TraceAbstraction took 278026.08 ms. Allocated memory was 81.8 MB in the beginning and 257.9 MB in the end (delta: 176.2 MB). Free memory was 54.8 MB in the beginning and 192.4 MB in the end (delta: -137.6 MB). Peak memory consumption was 158.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:38:21,115 INFO L168 Benchmark]: Witness Printer took 4.25 ms. Allocated memory is still 257.9 MB. Free memory is still 192.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:38:21,117 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.22 ms. Allocated memory is still 60.8 MB. Free memory was 41.1 MB in the beginning and 41.1 MB in the end (delta: 44.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 581.17 ms. Allocated memory is still 60.8 MB. Free memory was 37.4 MB in the beginning and 35.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 91.03 ms. Allocated memory is still 60.8 MB. Free memory was 35.9 MB in the beginning and 33.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 79.07 ms. Allocated memory is still 60.8 MB. Free memory was 33.5 MB in the beginning and 31.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1062.18 ms. Allocated memory was 60.8 MB in the beginning and 81.8 MB in the end (delta: 21.0 MB). Free memory was 31.4 MB in the beginning and 55.1 MB in the end (delta: -23.7 MB). Peak memory consumption was 12.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 278026.08 ms. Allocated memory was 81.8 MB in the beginning and 257.9 MB in the end (delta: 176.2 MB). Free memory was 54.8 MB in the beginning and 192.4 MB in the end (delta: -137.6 MB). Peak memory consumption was 158.6 MB. Max. memory is 16.1 GB. * Witness Printer took 4.25 ms. Allocated memory is still 257.9 MB. Free memory is still 192.4 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: 562]: 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: [L566] struct list_t *list = malloc(sizeof *list); [L567] list->first = ((void *)0) [L568] list->last = ((void *)0) [L569] struct list_t *list2 = malloc(sizeof *list2); [L570] list2->first = ((void *)0) [L571] list2->last = ((void *)0) [L572] char userInput; [L574] char userInput = __VERIFIER_nondet_char(); [L551] struct node_t *node = malloc(sizeof *node); [L552] node->data = input [L553] EXPR head->first [L553] head->first == ((void *)0) && head->last == ((void *)0) [L553] EXPR head->last [L553] head->first == ((void *)0) && head->last == ((void *)0) [L553] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L554] head->first = node [L555] head->last= node [L556] node->prev = ((void *)0) [L557] node->next = ((void *)0) [L576] COND TRUE __VERIFIER_nondet_int() [L574] char userInput = __VERIFIER_nondet_char(); [L551] struct node_t *node = malloc(sizeof *node); [L552] node->data = input [L553] EXPR head->first [L553] head->first == ((void *)0) && head->last == ((void *)0) [L553] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L560] EXPR head->last [L560] node->prev = head->last [L561] node->next = ((void *)0) [L562] EXPR head->last [L562] head->last->next = node - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: 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: 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: 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: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: 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: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: 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: 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: 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: 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: 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: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: 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: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: 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: 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: 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: 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: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 590]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 590]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: 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, 167 locations, 85 error locations. Started 1 CEGAR loops. OverallTime: 277956.6ms, OverallIterations: 14, TraceHistogramMax: 2, EmptinessCheckTime: 30.1ms, AutomataDifference: 115936.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1117 SDtfs, 3311 SDslu, 2062 SDs, 0 SdLazy, 2274 SolverSat, 194 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 48744.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 249 SyntacticMatches, 15 SemanticMatches, 93 ConstructedPredicates, 8 IntricatePredicates, 3 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 133669.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=3, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 141.2ms AutomataMinimizationTime, 13 MinimizatonAttempts, 703 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 146.7ms SsaConstructionTime, 820.5ms SatisfiabilityAnalysisTime, 82263.2ms InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 330 ConstructedInterpolants, 107 QuantifiedInterpolants, 5081 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1127 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-10-13 07:38:21,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98b336b8-a4c5-4d3c-aec8-32a058195f69/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...