./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan --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 5ebc2f865d1d3cb7ebe0e5ed79fba8ffec2a41d4 ............................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan --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 5ebc2f865d1d3cb7ebe0e5ed79fba8ffec2a41d4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 13:57:54,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 13:57:54,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 13:57:54,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 13:57:54,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 13:57:54,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 13:57:54,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 13:57:54,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 13:57:54,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 13:57:54,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 13:57:54,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 13:57:54,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 13:57:54,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 13:57:54,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 13:57:54,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 13:57:54,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 13:57:54,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 13:57:54,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 13:57:54,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 13:57:54,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 13:57:54,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 13:57:54,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 13:57:54,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 13:57:54,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 13:57:54,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 13:57:54,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 13:57:54,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 13:57:54,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 13:57:54,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 13:57:54,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 13:57:54,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 13:57:54,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 13:57:54,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 13:57:54,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 13:57:54,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 13:57:54,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 13:57:54,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 13:57:54,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 13:57:54,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 13:57:54,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 13:57:54,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 13:57:54,430 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 13:57:54,453 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 13:57:54,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 13:57:54,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 13:57:54,454 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 13:57:54,454 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 13:57:54,454 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 13:57:54,454 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 13:57:54,455 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 13:57:54,455 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 13:57:54,455 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 13:57:54,455 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 13:57:54,455 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 13:57:54,456 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 13:57:54,456 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 13:57:54,456 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 13:57:54,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 13:57:54,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 13:57:54,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 13:57:54,457 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 13:57:54,457 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 13:57:54,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 13:57:54,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 13:57:54,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 13:57:54,458 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 13:57:54,458 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 13:57:54,458 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 13:57:54,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 13:57:54,459 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 13:57:54,459 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 13:57:54,459 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 13:57:54,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 13:57:54,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 13:57:54,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 13:57:54,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 13:57:54,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 13:57:54,460 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 13:57:54,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 13:57:54,460 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 13:57:54,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 13:57:54,461 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-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/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-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan 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 -> 5ebc2f865d1d3cb7ebe0e5ed79fba8ffec2a41d4 [2020-12-09 13:57:54,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 13:57:54,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 13:57:54,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 13:57:54,665 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 13:57:54,666 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 13:57:54,667 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2020-12-09 13:57:54,708 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/data/62202847c/edaadeb8acb547c0817139ea65aa892f/FLAG0c1bae66d [2020-12-09 13:57:55,122 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 13:57:55,123 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2020-12-09 13:57:55,135 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/data/62202847c/edaadeb8acb547c0817139ea65aa892f/FLAG0c1bae66d [2020-12-09 13:57:55,144 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/data/62202847c/edaadeb8acb547c0817139ea65aa892f [2020-12-09 13:57:55,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 13:57:55,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 13:57:55,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 13:57:55,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 13:57:55,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 13:57:55,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:57:55" (1/1) ... [2020-12-09 13:57:55,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31cbfa81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:55, skipping insertion in model container [2020-12-09 13:57:55,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:57:55" (1/1) ... [2020-12-09 13:57:55,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 13:57:55,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 13:57:55,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 13:57:55,463 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2020-12-09 13:57:55,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@41cd92a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:55, skipping insertion in model container [2020-12-09 13:57:55,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 13:57:55,464 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2020-12-09 13:57:55,466 INFO L168 Benchmark]: Toolchain (without parser) took 317.46 ms. Allocated memory is still 109.1 MB. Free memory was 70.6 MB in the beginning and 81.6 MB in the end (delta: -11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 13:57:55,466 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 109.1 MB. Free memory is still 88.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 13:57:55,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.62 ms. Allocated memory is still 109.1 MB. Free memory was 70.4 MB in the beginning and 81.6 MB in the end (delta: -11.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 13:57:55,468 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.16 ms. Allocated memory is still 109.1 MB. Free memory is still 88.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 315.62 ms. Allocated memory is still 109.1 MB. Free memory was 70.4 MB in the beginning and 81.6 MB in the end (delta: -11.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 13:57:56,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 13:57:56,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 13:57:56,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 13:57:56,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 13:57:56,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 13:57:56,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 13:57:56,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 13:57:56,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 13:57:56,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 13:57:56,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 13:57:56,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 13:57:56,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 13:57:56,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 13:57:56,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 13:57:56,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 13:57:56,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 13:57:56,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 13:57:56,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 13:57:56,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 13:57:56,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 13:57:56,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 13:57:56,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 13:57:56,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 13:57:56,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 13:57:56,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 13:57:56,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 13:57:56,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 13:57:56,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 13:57:56,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 13:57:56,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 13:57:56,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 13:57:56,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 13:57:56,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 13:57:56,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 13:57:56,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 13:57:56,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 13:57:56,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 13:57:56,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 13:57:56,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 13:57:56,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 13:57:56,835 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 13:57:56,852 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 13:57:56,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 13:57:56,852 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 13:57:56,852 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 13:57:56,853 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 13:57:56,853 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 13:57:56,853 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 13:57:56,853 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 13:57:56,853 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 13:57:56,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 13:57:56,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 13:57:56,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 13:57:56,854 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 13:57:56,854 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 13:57:56,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 13:57:56,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 13:57:56,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 13:57:56,854 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 13:57:56,855 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 13:57:56,855 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 13:57:56,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 13:57:56,855 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 13:57:56,855 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 13:57:56,855 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 13:57:56,855 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 13:57:56,855 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 13:57:56,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 13:57:56,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 13:57:56,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 13:57:56,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 13:57:56,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 13:57:56,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 13:57:56,862 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 13:57:56,862 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 13:57:56,862 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 13:57:56,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 13:57:56,862 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-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/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-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan 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 -> 5ebc2f865d1d3cb7ebe0e5ed79fba8ffec2a41d4 [2020-12-09 13:57:57,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 13:57:57,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 13:57:57,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 13:57:57,096 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 13:57:57,096 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 13:57:57,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2020-12-09 13:57:57,138 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/data/1d586979e/4c6fc1e7298e4ed19346fcce6592748b/FLAG4e12d7257 [2020-12-09 13:57:57,556 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 13:57:57,556 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2020-12-09 13:57:57,568 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/data/1d586979e/4c6fc1e7298e4ed19346fcce6592748b/FLAG4e12d7257 [2020-12-09 13:57:57,577 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/data/1d586979e/4c6fc1e7298e4ed19346fcce6592748b [2020-12-09 13:57:57,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 13:57:57,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 13:57:57,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 13:57:57,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 13:57:57,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 13:57:57,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:57:57" (1/1) ... [2020-12-09 13:57:57,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc7b7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:57, skipping insertion in model container [2020-12-09 13:57:57,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:57:57" (1/1) ... [2020-12-09 13:57:57,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 13:57:57,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 13:57:57,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 13:57:57,905 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-12-09 13:57:57,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 13:57:57,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 13:57:57,970 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 13:57:58,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 13:57:58,084 INFO L208 MainTranslator]: Completed translation [2020-12-09 13:57:58,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:58 WrapperNode [2020-12-09 13:57:58,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 13:57:58,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 13:57:58,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 13:57:58,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 13:57:58,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:58" (1/1) ... [2020-12-09 13:57:58,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:58" (1/1) ... [2020-12-09 13:57:58,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 13:57:58,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 13:57:58,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 13:57:58,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 13:57:58,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:58" (1/1) ... [2020-12-09 13:57:58,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:58" (1/1) ... [2020-12-09 13:57:58,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:58" (1/1) ... [2020-12-09 13:57:58,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:58" (1/1) ... [2020-12-09 13:57:58,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:58" (1/1) ... [2020-12-09 13:57:58,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:58" (1/1) ... [2020-12-09 13:57:58,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:58" (1/1) ... [2020-12-09 13:57:58,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 13:57:58,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 13:57:58,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 13:57:58,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 13:57:58,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 13:57:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 13:57:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 13:57:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 13:57:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 13:57:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 13:57:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 13:57:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 13:57:58,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 13:57:58,593 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 13:57:58,593 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2020-12-09 13:57:58,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:57:58 BoogieIcfgContainer [2020-12-09 13:57:58,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 13:57:58,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 13:57:58,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 13:57:58,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 13:57:58,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:57:57" (1/3) ... [2020-12-09 13:57:58,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87cc083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:57:58, skipping insertion in model container [2020-12-09 13:57:58,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:57:58" (2/3) ... [2020-12-09 13:57:58,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87cc083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:57:58, skipping insertion in model container [2020-12-09 13:57:58,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:57:58" (3/3) ... [2020-12-09 13:57:58,600 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test11.i [2020-12-09 13:57:58,609 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 13:57:58,612 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2020-12-09 13:57:58,619 INFO L253 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2020-12-09 13:57:58,633 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 13:57:58,633 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 13:57:58,633 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 13:57:58,633 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 13:57:58,633 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 13:57:58,633 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 13:57:58,633 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 13:57:58,634 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 13:57:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2020-12-09 13:57:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 13:57:58,648 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:57:58,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 13:57:58,649 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:57:58,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:57:58,653 INFO L82 PathProgramCache]: Analyzing trace with hash 889508829, now seen corresponding path program 1 times [2020-12-09 13:57:58,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:57:58,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075998966] [2020-12-09 13:57:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 13:57:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:57:58,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:57:58,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:57:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:57:58,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:57:58,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075998966] [2020-12-09 13:57:58,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:57:58,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:57:58,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931379510] [2020-12-09 13:57:58,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:57:58,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:57:58,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:57:58,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:57:58,797 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2020-12-09 13:57:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:57:58,919 INFO L93 Difference]: Finished difference Result 295 states and 317 transitions. [2020-12-09 13:57:58,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:57:58,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 13:57:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:57:58,928 INFO L225 Difference]: With dead ends: 295 [2020-12-09 13:57:58,928 INFO L226 Difference]: Without dead ends: 287 [2020-12-09 13:57:58,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:57:58,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-09 13:57:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 79. [2020-12-09 13:57:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 13:57:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2020-12-09 13:57:58,959 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 6 [2020-12-09 13:57:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:57:58,959 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2020-12-09 13:57:58,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:57:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2020-12-09 13:57:58,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 13:57:58,959 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:57:58,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 13:57:59,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 13:57:59,162 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:57:59,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:57:59,163 INFO L82 PathProgramCache]: Analyzing trace with hash 889568411, now seen corresponding path program 1 times [2020-12-09 13:57:59,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:57:59,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736026107] [2020-12-09 13:57:59,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 13:57:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:57:59,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 13:57:59,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:57:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:57:59,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:57:59,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736026107] [2020-12-09 13:57:59,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:57:59,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 13:57:59,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363974970] [2020-12-09 13:57:59,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 13:57:59,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:57:59,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 13:57:59,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 13:57:59,328 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 3 states. [2020-12-09 13:57:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:57:59,457 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2020-12-09 13:57:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 13:57:59,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-12-09 13:57:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:57:59,459 INFO L225 Difference]: With dead ends: 150 [2020-12-09 13:57:59,459 INFO L226 Difference]: Without dead ends: 149 [2020-12-09 13:57:59,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 13:57:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-12-09 13:57:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 77. [2020-12-09 13:57:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-09 13:57:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2020-12-09 13:57:59,468 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 6 [2020-12-09 13:57:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:57:59,468 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2020-12-09 13:57:59,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 13:57:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2020-12-09 13:57:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 13:57:59,468 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:57:59,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:57:59,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 13:57:59,669 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:57:59,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:57:59,670 INFO L82 PathProgramCache]: Analyzing trace with hash -592189876, now seen corresponding path program 1 times [2020-12-09 13:57:59,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:57:59,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620544239] [2020-12-09 13:57:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 13:57:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:57:59,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:57:59,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:57:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:57:59,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:57:59,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620544239] [2020-12-09 13:57:59,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:57:59,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:57:59,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305427851] [2020-12-09 13:57:59,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:57:59,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:57:59,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:57:59,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:57:59,733 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 4 states. [2020-12-09 13:57:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:57:59,816 INFO L93 Difference]: Finished difference Result 274 states and 291 transitions. [2020-12-09 13:57:59,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:57:59,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 13:57:59,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:57:59,818 INFO L225 Difference]: With dead ends: 274 [2020-12-09 13:57:59,818 INFO L226 Difference]: Without dead ends: 274 [2020-12-09 13:57:59,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:57:59,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-12-09 13:57:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 79. [2020-12-09 13:57:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 13:57:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2020-12-09 13:57:59,824 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 9 [2020-12-09 13:57:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:57:59,824 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2020-12-09 13:57:59,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:57:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2020-12-09 13:57:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 13:57:59,825 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:57:59,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:00,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 13:58:00,026 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:00,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:00,027 INFO L82 PathProgramCache]: Analyzing trace with hash -592189907, now seen corresponding path program 1 times [2020-12-09 13:58:00,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:00,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286765038] [2020-12-09 13:58:00,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:00,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 13:58:00,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:00,152 INFO L382 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 [2020-12-09 13:58:00,152 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:00,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:00,155 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:00,155 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:58:00,193 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:00,194 INFO L382 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 39 [2020-12-09 13:58:00,201 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:00,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:00,214 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:58:00,215 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2020-12-09 13:58:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:00,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:00,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286765038] [2020-12-09 13:58:00,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:00,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:58:00,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588039737] [2020-12-09 13:58:00,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:58:00,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:00,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:58:00,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:00,261 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 5 states. [2020-12-09 13:58:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:00,582 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2020-12-09 13:58:00,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:58:00,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 13:58:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:00,584 INFO L225 Difference]: With dead ends: 224 [2020-12-09 13:58:00,584 INFO L226 Difference]: Without dead ends: 224 [2020-12-09 13:58:00,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:58:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-12-09 13:58:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 90. [2020-12-09 13:58:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-12-09 13:58:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2020-12-09 13:58:00,590 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 9 [2020-12-09 13:58:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:00,590 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2020-12-09 13:58:00,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:58:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2020-12-09 13:58:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 13:58:00,590 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:00,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:00,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 13:58:00,793 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash -592189906, now seen corresponding path program 1 times [2020-12-09 13:58:00,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:00,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407170117] [2020-12-09 13:58:00,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:00,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 13:58:00,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:00,945 INFO L382 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 [2020-12-09 13:58:00,946 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:00,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:00,957 INFO L382 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 [2020-12-09 13:58:00,958 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:00,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:00,966 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:00,967 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 13:58:01,018 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:01,018 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 13:58:01,020 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:01,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:01,034 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 13:58:01,035 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:01,044 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:01,046 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:01,046 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:11 [2020-12-09 13:58:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:01,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:01,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407170117] [2020-12-09 13:58:01,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:01,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 13:58:01,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324393449] [2020-12-09 13:58:01,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 13:58:01,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:01,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 13:58:01,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 13:58:01,061 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 6 states. [2020-12-09 13:58:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:01,400 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2020-12-09 13:58:01,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:58:01,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-09 13:58:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:01,402 INFO L225 Difference]: With dead ends: 168 [2020-12-09 13:58:01,402 INFO L226 Difference]: Without dead ends: 168 [2020-12-09 13:58:01,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-09 13:58:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-12-09 13:58:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2020-12-09 13:58:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-12-09 13:58:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2020-12-09 13:58:01,409 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 9 [2020-12-09 13:58:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:01,409 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2020-12-09 13:58:01,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 13:58:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2020-12-09 13:58:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 13:58:01,409 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:01,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:01,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 13:58:01,611 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:01,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1182817455, now seen corresponding path program 1 times [2020-12-09 13:58:01,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:01,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19767936] [2020-12-09 13:58:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:01,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 13:58:01,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:01,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:01,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19767936] [2020-12-09 13:58:01,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:01,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:58:01,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682461343] [2020-12-09 13:58:01,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:58:01,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:01,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:58:01,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:58:01,718 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 4 states. [2020-12-09 13:58:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:01,773 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2020-12-09 13:58:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:58:01,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 13:58:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:01,774 INFO L225 Difference]: With dead ends: 145 [2020-12-09 13:58:01,774 INFO L226 Difference]: Without dead ends: 143 [2020-12-09 13:58:01,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-09 13:58:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 79. [2020-12-09 13:58:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 13:58:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2020-12-09 13:58:01,777 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 9 [2020-12-09 13:58:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:01,777 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2020-12-09 13:58:01,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:58:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2020-12-09 13:58:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 13:58:01,778 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:01,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:01,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 13:58:01,980 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:01,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:01,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1176169776, now seen corresponding path program 1 times [2020-12-09 13:58:01,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:01,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315824262] [2020-12-09 13:58:01,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:02,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 13:58:02,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:02,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:02,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315824262] [2020-12-09 13:58:02,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:02,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:58:02,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580479002] [2020-12-09 13:58:02,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:58:02,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:02,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:58:02,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:02,090 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 5 states. [2020-12-09 13:58:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:02,187 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2020-12-09 13:58:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 13:58:02,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-09 13:58:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:02,188 INFO L225 Difference]: With dead ends: 141 [2020-12-09 13:58:02,188 INFO L226 Difference]: Without dead ends: 141 [2020-12-09 13:58:02,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 13:58:02,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-12-09 13:58:02,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 78. [2020-12-09 13:58:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-12-09 13:58:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2020-12-09 13:58:02,191 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 10 [2020-12-09 13:58:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:02,191 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2020-12-09 13:58:02,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:58:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-12-09 13:58:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 13:58:02,192 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:02,192 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:02,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 13:58:02,394 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:02,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:02,395 INFO L82 PathProgramCache]: Analyzing trace with hash -722750891, now seen corresponding path program 1 times [2020-12-09 13:58:02,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:02,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975340340] [2020-12-09 13:58:02,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:02,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 13:58:02,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:02,543 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:02,543 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 13:58:02,545 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:02,555 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-12-09 13:58:02,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:58:02,557 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:58:02,558 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 13:58:02,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:58:02,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:58:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:04,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:04,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975340340] [2020-12-09 13:58:04,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:04,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 13:58:04,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942652200] [2020-12-09 13:58:04,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 13:58:04,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:04,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 13:58:04,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2020-12-09 13:58:04,663 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 7 states. [2020-12-09 13:58:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:07,261 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2020-12-09 13:58:07,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 13:58:07,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-12-09 13:58:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:07,263 INFO L225 Difference]: With dead ends: 154 [2020-12-09 13:58:07,263 INFO L226 Difference]: Without dead ends: 150 [2020-12-09 13:58:07,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=21, Invalid=34, Unknown=1, NotChecked=0, Total=56 [2020-12-09 13:58:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-12-09 13:58:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 73. [2020-12-09 13:58:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-09 13:58:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2020-12-09 13:58:07,265 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 12 [2020-12-09 13:58:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:07,265 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-12-09 13:58:07,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 13:58:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-12-09 13:58:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 13:58:07,266 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:07,266 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:07,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 13:58:07,468 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:07,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:07,469 INFO L82 PathProgramCache]: Analyzing trace with hash -493394208, now seen corresponding path program 1 times [2020-12-09 13:58:07,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:07,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666243926] [2020-12-09 13:58:07,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:07,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:58:07,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:07,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:07,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666243926] [2020-12-09 13:58:07,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:07,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:58:07,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663788091] [2020-12-09 13:58:07,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:58:07,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:07,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:58:07,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:58:07,588 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 4 states. [2020-12-09 13:58:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:07,637 INFO L93 Difference]: Finished difference Result 231 states and 242 transitions. [2020-12-09 13:58:07,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:58:07,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 13:58:07,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:07,638 INFO L225 Difference]: With dead ends: 231 [2020-12-09 13:58:07,638 INFO L226 Difference]: Without dead ends: 231 [2020-12-09 13:58:07,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-12-09 13:58:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 75. [2020-12-09 13:58:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-09 13:58:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-12-09 13:58:07,642 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 14 [2020-12-09 13:58:07,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:07,642 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-12-09 13:58:07,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:58:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-12-09 13:58:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 13:58:07,642 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:07,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:07,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 13:58:07,844 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:07,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:07,845 INFO L82 PathProgramCache]: Analyzing trace with hash -493394216, now seen corresponding path program 1 times [2020-12-09 13:58:07,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:07,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850939385] [2020-12-09 13:58:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:07,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 13:58:07,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:07,931 INFO L382 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 [2020-12-09 13:58:07,932 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:07,933 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:07,934 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:07,934 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:58:07,961 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:07,962 INFO L382 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 39 [2020-12-09 13:58:07,964 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:07,969 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:07,971 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:58:07,971 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:17 [2020-12-09 13:58:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:07,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:07,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850939385] [2020-12-09 13:58:07,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:07,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:58:07,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625566329] [2020-12-09 13:58:07,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:58:07,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:07,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:58:07,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:07,993 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2020-12-09 13:58:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:08,266 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2020-12-09 13:58:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:58:08,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-09 13:58:08,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:08,267 INFO L225 Difference]: With dead ends: 191 [2020-12-09 13:58:08,267 INFO L226 Difference]: Without dead ends: 191 [2020-12-09 13:58:08,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:58:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-09 13:58:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 88. [2020-12-09 13:58:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-12-09 13:58:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2020-12-09 13:58:08,270 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 14 [2020-12-09 13:58:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:08,270 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2020-12-09 13:58:08,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:58:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2020-12-09 13:58:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 13:58:08,270 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:08,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:08,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-09 13:58:08,471 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:08,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:08,471 INFO L82 PathProgramCache]: Analyzing trace with hash -493394215, now seen corresponding path program 1 times [2020-12-09 13:58:08,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:08,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782692043] [2020-12-09 13:58:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:08,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 13:58:08,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:08,540 INFO L382 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 [2020-12-09 13:58:08,540 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:08,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:08,548 INFO L382 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 [2020-12-09 13:58:08,549 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:08,553 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:08,554 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:08,554 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 13:58:08,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 13:58:08,592 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-12-09 13:58:08,594 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:08,606 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:08,617 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:08,618 INFO L382 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 13 treesize of output 17 [2020-12-09 13:58:08,619 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:08,631 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:08,632 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:08,632 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2020-12-09 13:58:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:08,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:08,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782692043] [2020-12-09 13:58:08,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:08,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 13:58:08,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134110605] [2020-12-09 13:58:08,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 13:58:08,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:08,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 13:58:08,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 13:58:08,646 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 6 states. [2020-12-09 13:58:08,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:08,960 INFO L93 Difference]: Finished difference Result 191 states and 198 transitions. [2020-12-09 13:58:08,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 13:58:08,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-09 13:58:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:08,962 INFO L225 Difference]: With dead ends: 191 [2020-12-09 13:58:08,962 INFO L226 Difference]: Without dead ends: 191 [2020-12-09 13:58:08,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-09 13:58:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-09 13:58:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 116. [2020-12-09 13:58:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-12-09 13:58:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2020-12-09 13:58:08,965 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 14 [2020-12-09 13:58:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:08,965 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2020-12-09 13:58:08,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 13:58:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2020-12-09 13:58:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 13:58:08,965 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:08,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:09,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-09 13:58:09,167 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:09,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:09,168 INFO L82 PathProgramCache]: Analyzing trace with hash 186664154, now seen corresponding path program 1 times [2020-12-09 13:58:09,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:09,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009552080] [2020-12-09 13:58:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:09,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 13:58:09,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:09,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:09,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:09,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009552080] [2020-12-09 13:58:09,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:09,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:58:09,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408584465] [2020-12-09 13:58:09,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:58:09,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:09,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:58:09,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:58:09,246 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand 4 states. [2020-12-09 13:58:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:09,306 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2020-12-09 13:58:09,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:58:09,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 13:58:09,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:09,307 INFO L225 Difference]: With dead ends: 133 [2020-12-09 13:58:09,307 INFO L226 Difference]: Without dead ends: 131 [2020-12-09 13:58:09,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-12-09 13:58:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2020-12-09 13:58:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-09 13:58:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-12-09 13:58:09,310 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 14 [2020-12-09 13:58:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:09,310 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-12-09 13:58:09,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:58:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-12-09 13:58:09,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 13:58:09,311 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:09,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:09,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-12-09 13:58:09,512 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:09,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1886495925, now seen corresponding path program 1 times [2020-12-09 13:58:09,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:09,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972137491] [2020-12-09 13:58:09,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:09,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 13:58:09,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:09,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:09,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972137491] [2020-12-09 13:58:09,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:09,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:58:09,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851236482] [2020-12-09 13:58:09,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 13:58:09,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:09,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 13:58:09,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 13:58:09,775 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2020-12-09 13:58:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:09,868 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2020-12-09 13:58:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:58:09,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 13:58:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:09,869 INFO L225 Difference]: With dead ends: 74 [2020-12-09 13:58:09,869 INFO L226 Difference]: Without dead ends: 74 [2020-12-09 13:58:09,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:58:09,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-09 13:58:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-12-09 13:58:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-12-09 13:58:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2020-12-09 13:58:09,871 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 15 [2020-12-09 13:58:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:09,871 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2020-12-09 13:58:09,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 13:58:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2020-12-09 13:58:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 13:58:09,871 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:09,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:10,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-12-09 13:58:10,073 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:10,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:10,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1705438503, now seen corresponding path program 1 times [2020-12-09 13:58:10,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:10,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388853292] [2020-12-09 13:58:10,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:10,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 13:58:10,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:10,172 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:10,172 INFO L382 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 19 treesize of output 41 [2020-12-09 13:58:10,174 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:10,179 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:10,180 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:58:10,180 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2020-12-09 13:58:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:10,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:10,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388853292] [2020-12-09 13:58:10,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:10,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:58:10,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889294494] [2020-12-09 13:58:10,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:58:10,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:10,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:58:10,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:10,219 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 5 states. [2020-12-09 13:58:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:10,439 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2020-12-09 13:58:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:58:10,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 13:58:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:10,440 INFO L225 Difference]: With dead ends: 160 [2020-12-09 13:58:10,440 INFO L226 Difference]: Without dead ends: 160 [2020-12-09 13:58:10,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 13:58:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-09 13:58:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 77. [2020-12-09 13:58:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-09 13:58:10,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-12-09 13:58:10,442 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 16 [2020-12-09 13:58:10,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:10,442 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-12-09 13:58:10,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:58:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-12-09 13:58:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 13:58:10,443 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:10,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:10,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-12-09 13:58:10,644 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:10,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1705438502, now seen corresponding path program 1 times [2020-12-09 13:58:10,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:10,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259648505] [2020-12-09 13:58:10,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:10,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 13:58:10,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:10,744 INFO L382 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 [2020-12-09 13:58:10,744 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:10,750 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:10,752 INFO L382 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 [2020-12-09 13:58:10,752 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:10,758 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:10,758 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:10,758 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 13:58:10,794 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:10,794 INFO L382 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 13 treesize of output 17 [2020-12-09 13:58:10,795 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:10,805 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:10,807 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 13:58:10,808 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:10,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:10,818 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:10,818 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-09 13:58:10,853 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:10,853 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 13:58:10,854 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:10,863 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:10,865 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 13:58:10,866 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:10,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:10,875 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:10,875 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:11 [2020-12-09 13:58:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:10,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:10,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259648505] [2020-12-09 13:58:10,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:10,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 13:58:10,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62901441] [2020-12-09 13:58:10,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 13:58:10,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:10,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 13:58:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:58:10,891 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 7 states. [2020-12-09 13:58:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:11,285 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2020-12-09 13:58:11,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 13:58:11,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-09 13:58:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:11,286 INFO L225 Difference]: With dead ends: 133 [2020-12-09 13:58:11,286 INFO L226 Difference]: Without dead ends: 133 [2020-12-09 13:58:11,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 13:58:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-09 13:58:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 76. [2020-12-09 13:58:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-09 13:58:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2020-12-09 13:58:11,288 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 16 [2020-12-09 13:58:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:11,288 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2020-12-09 13:58:11,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 13:58:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2020-12-09 13:58:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 13:58:11,289 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:11,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:11,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-12-09 13:58:11,490 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:11,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1648180201, now seen corresponding path program 1 times [2020-12-09 13:58:11,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:11,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854387446] [2020-12-09 13:58:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:11,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 13:58:11,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:11,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:11,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854387446] [2020-12-09 13:58:11,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:11,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:58:11,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860549753] [2020-12-09 13:58:11,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:58:11,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:11,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:58:11,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:58:11,613 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 4 states. [2020-12-09 13:58:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:11,673 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2020-12-09 13:58:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:58:11,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-09 13:58:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:11,674 INFO L225 Difference]: With dead ends: 123 [2020-12-09 13:58:11,674 INFO L226 Difference]: Without dead ends: 123 [2020-12-09 13:58:11,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-09 13:58:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 72. [2020-12-09 13:58:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-12-09 13:58:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2020-12-09 13:58:11,675 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 16 [2020-12-09 13:58:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:11,676 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2020-12-09 13:58:11,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:58:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2020-12-09 13:58:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 13:58:11,676 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:11,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:11,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-12-09 13:58:11,877 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:11,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:11,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1751106330, now seen corresponding path program 1 times [2020-12-09 13:58:11,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:11,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382307715] [2020-12-09 13:58:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:12,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-09 13:58:12,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:12,061 INFO L382 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 [2020-12-09 13:58:12,061 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:12,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:12,067 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:12,067 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-12-09 13:58:12,084 INFO L382 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 [2020-12-09 13:58:12,084 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:12,092 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:12,092 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:12,092 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:21 [2020-12-09 13:58:12,148 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:12,148 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 41 [2020-12-09 13:58:12,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-12-09 13:58:12,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 13:58:12,151 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-09 13:58:12,186 INFO L625 ElimStorePlain]: treesize reduction 23, result has 67.6 percent of original size [2020-12-09 13:58:12,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 13:58:12,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:58:12,188 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:12,188 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:47 [2020-12-09 13:58:12,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:58:12,250 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:12,250 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2020-12-09 13:58:12,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:58:12,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:58:12,253 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:58:12,256 INFO L382 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 19 treesize of output 11 [2020-12-09 13:58:12,257 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:12,276 INFO L625 ElimStorePlain]: treesize reduction 8, result has 77.1 percent of original size [2020-12-09 13:58:12,277 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-12-09 13:58:12,277 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2020-12-09 13:58:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:12,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:12,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382307715] [2020-12-09 13:58:12,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:12,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 13:58:12,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613278784] [2020-12-09 13:58:12,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 13:58:12,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:12,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 13:58:12,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-12-09 13:58:12,316 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 13 states. [2020-12-09 13:58:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:12,931 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2020-12-09 13:58:12,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 13:58:12,932 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-12-09 13:58:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:12,932 INFO L225 Difference]: With dead ends: 83 [2020-12-09 13:58:12,932 INFO L226 Difference]: Without dead ends: 83 [2020-12-09 13:58:12,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2020-12-09 13:58:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-12-09 13:58:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2020-12-09 13:58:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-09 13:58:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2020-12-09 13:58:12,934 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 18 [2020-12-09 13:58:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:12,934 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2020-12-09 13:58:12,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 13:58:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2020-12-09 13:58:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 13:58:12,935 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:12,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:13,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-12-09 13:58:13,136 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:13,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1751106331, now seen corresponding path program 1 times [2020-12-09 13:58:13,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:13,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61886977] [2020-12-09 13:58:13,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:13,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 13:58:13,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:13,240 INFO L382 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 [2020-12-09 13:58:13,241 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,242 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,242 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,242 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:58:13,259 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_34|], 3=[|v_#valid_60|]} [2020-12-09 13:58:13,262 INFO L382 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 [2020-12-09 13:58:13,262 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,286 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,287 INFO L382 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 39 [2020-12-09 13:58:13,288 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,297 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,297 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,297 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2020-12-09 13:58:13,337 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 13:58:13,338 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,366 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 13:58:13,367 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,385 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,386 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,386 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:39 [2020-12-09 13:58:13,429 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_35|], 3=[|v_#valid_61|]} [2020-12-09 13:58:13,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 13:58:13,437 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 13:58:13,438 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,473 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,474 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-12-09 13:58:13,475 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,496 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,496 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:29 [2020-12-09 13:58:13,543 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,543 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 64 [2020-12-09 13:58:13,545 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 13:58:13,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 13:58:13,546 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,563 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,566 INFO L382 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 27 treesize of output 22 [2020-12-09 13:58:13,567 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,580 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,582 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,582 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:27 [2020-12-09 13:58:13,632 INFO L382 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 15 treesize of output 7 [2020-12-09 13:58:13,632 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,641 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,642 INFO L382 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 25 treesize of output 13 [2020-12-09 13:58:13,643 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,649 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:13,650 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:13,650 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:11 [2020-12-09 13:58:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:13,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:13,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61886977] [2020-12-09 13:58:13,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:13,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 13:58:13,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360566837] [2020-12-09 13:58:13,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 13:58:13,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:13,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 13:58:13,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-12-09 13:58:13,686 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 13 states. [2020-12-09 13:58:14,236 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-12-09 13:58:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:15,038 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2020-12-09 13:58:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 13:58:15,038 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-12-09 13:58:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:15,039 INFO L225 Difference]: With dead ends: 132 [2020-12-09 13:58:15,039 INFO L226 Difference]: Without dead ends: 132 [2020-12-09 13:58:15,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2020-12-09 13:58:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-12-09 13:58:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 73. [2020-12-09 13:58:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-09 13:58:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2020-12-09 13:58:15,041 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 18 [2020-12-09 13:58:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:15,041 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2020-12-09 13:58:15,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 13:58:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2020-12-09 13:58:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 13:58:15,041 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:15,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:15,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-12-09 13:58:15,243 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:15,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:15,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1179459719, now seen corresponding path program 1 times [2020-12-09 13:58:15,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:15,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943677478] [2020-12-09 13:58:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:15,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 13:58:15,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:15,413 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:15,414 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 13:58:15,415 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:15,429 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-12-09 13:58:15,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:58:15,430 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:58:15,430 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 13:58:15,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:58:15,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:58:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:21,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:21,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943677478] [2020-12-09 13:58:21,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:21,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 13:58:21,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547365538] [2020-12-09 13:58:21,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 13:58:21,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:21,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 13:58:21,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=63, Unknown=1, NotChecked=0, Total=90 [2020-12-09 13:58:21,857 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 10 states. [2020-12-09 13:58:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:28,467 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2020-12-09 13:58:28,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 13:58:28,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-09 13:58:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:28,468 INFO L225 Difference]: With dead ends: 80 [2020-12-09 13:58:28,468 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 13:58:28,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 11 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=36, Invalid=94, Unknown=2, NotChecked=0, Total=132 [2020-12-09 13:58:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 13:58:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2020-12-09 13:58:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 13:58:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2020-12-09 13:58:28,469 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 20 [2020-12-09 13:58:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:28,470 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2020-12-09 13:58:28,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 13:58:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-12-09 13:58:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 13:58:28,470 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:28,470 INFO L422 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] [2020-12-09 13:58:28,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-12-09 13:58:28,671 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:28,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash -373354461, now seen corresponding path program 1 times [2020-12-09 13:58:28,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:28,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512884324] [2020-12-09 13:58:28,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:28,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 13:58:28,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:28,767 INFO L382 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 [2020-12-09 13:58:28,768 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:28,769 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,769 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:58:28,782 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:28,783 INFO L382 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 13 treesize of output 17 [2020-12-09 13:58:28,783 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,785 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:28,785 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,785 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2020-12-09 13:58:28,800 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 13:58:28,800 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,808 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:28,811 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 13:58:28,812 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:28,819 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,819 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2020-12-09 13:58:28,839 INFO L382 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 [2020-12-09 13:58:28,839 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:28,849 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,849 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:26 [2020-12-09 13:58:28,896 INFO L382 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2020-12-09 13:58:28,897 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,910 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:28,930 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:28,930 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 69 [2020-12-09 13:58:28,932 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 13:58:28,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 13:58:28,932 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,943 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:28,944 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,944 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:28 [2020-12-09 13:58:28,987 INFO L382 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 25 treesize of output 17 [2020-12-09 13:58:28,988 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:28,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:28,998 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 13:58:28,998 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2020-12-09 13:58:29,074 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:29,074 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2020-12-09 13:58:29,076 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 13:58:29,077 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:29,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:29,078 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:29,079 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2020-12-09 13:58:29,136 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:29,136 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2020-12-09 13:58:29,137 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:29,147 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-12-09 13:58:29,148 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:58:29,148 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2020-12-09 13:58:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:29,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:29,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512884324] [2020-12-09 13:58:29,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:29,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-09 13:58:29,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804511779] [2020-12-09 13:58:29,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 13:58:29,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:29,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 13:58:29,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-12-09 13:58:29,176 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 15 states. [2020-12-09 13:58:29,749 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-09 13:58:29,887 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-12-09 13:58:30,027 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-12-09 13:58:30,319 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-12-09 13:58:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:36,898 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2020-12-09 13:58:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 13:58:36,898 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-12-09 13:58:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:36,899 INFO L225 Difference]: With dead ends: 120 [2020-12-09 13:58:36,899 INFO L226 Difference]: Without dead ends: 120 [2020-12-09 13:58:36,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2020-12-09 13:58:36,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-12-09 13:58:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 64. [2020-12-09 13:58:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 13:58:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2020-12-09 13:58:36,901 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 23 [2020-12-09 13:58:36,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:36,901 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-12-09 13:58:36,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 13:58:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2020-12-09 13:58:36,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 13:58:36,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:36,901 INFO L422 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] [2020-12-09 13:58:37,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-12-09 13:58:37,103 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:37,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:37,104 INFO L82 PathProgramCache]: Analyzing trace with hash -373354460, now seen corresponding path program 1 times [2020-12-09 13:58:37,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:37,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085666888] [2020-12-09 13:58:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:37,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 34 conjunts are in the unsatisfiable core [2020-12-09 13:58:37,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:37,300 INFO L382 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 [2020-12-09 13:58:37,300 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,303 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,304 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:58:37,317 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,317 INFO L382 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 13 treesize of output 17 [2020-12-09 13:58:37,318 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,320 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,320 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2020-12-09 13:58:37,336 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 13:58:37,337 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,345 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,348 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 13:58:37,348 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,356 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,356 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2020-12-09 13:58:37,397 INFO L382 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 [2020-12-09 13:58:37,398 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,418 INFO L382 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 [2020-12-09 13:58:37,418 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,433 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,433 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:34 [2020-12-09 13:58:37,528 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,528 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 73 [2020-12-09 13:58:37,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 13:58:37,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 13:58:37,531 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,550 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,554 INFO L382 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2020-12-09 13:58:37,555 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,570 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,571 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:60 [2020-12-09 13:58:37,750 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 47 [2020-12-09 13:58:37,751 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:58:37,766 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,776 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,776 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2020-12-09 13:58:37,777 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 13:58:37,778 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,785 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,785 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,785 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:14 [2020-12-09 13:58:37,861 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,861 INFO L382 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 13 treesize of output 17 [2020-12-09 13:58:37,862 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,873 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,875 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-12-09 13:58:37,876 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:37,887 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:37,887 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:9 [2020-12-09 13:58:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:37,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:37,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085666888] [2020-12-09 13:58:37,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:37,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-09 13:58:37,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385093759] [2020-12-09 13:58:37,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 13:58:37,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:37,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 13:58:37,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-12-09 13:58:37,921 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 17 states. [2020-12-09 13:58:38,640 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2020-12-09 13:58:38,899 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-12-09 13:58:39,207 WARN L197 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-12-09 13:58:39,547 WARN L197 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2020-12-09 13:58:39,811 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2020-12-09 13:58:40,169 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-12-09 13:58:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:42,914 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2020-12-09 13:58:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 13:58:42,915 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2020-12-09 13:58:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:42,916 INFO L225 Difference]: With dead ends: 118 [2020-12-09 13:58:42,916 INFO L226 Difference]: Without dead ends: 118 [2020-12-09 13:58:42,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 13:58:42,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-12-09 13:58:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 63. [2020-12-09 13:58:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 13:58:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2020-12-09 13:58:42,918 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 23 [2020-12-09 13:58:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:42,919 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2020-12-09 13:58:42,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 13:58:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2020-12-09 13:58:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 13:58:42,919 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:42,919 INFO L422 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] [2020-12-09 13:58:43,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-12-09 13:58:43,119 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:43,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:43,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1310912065, now seen corresponding path program 1 times [2020-12-09 13:58:43,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:43,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053433614] [2020-12-09 13:58:43,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:43,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:58:43,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:43,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:43,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053433614] [2020-12-09 13:58:43,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:43,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:58:43,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300065865] [2020-12-09 13:58:43,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:58:43,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:43,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:58:43,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:58:43,206 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 4 states. [2020-12-09 13:58:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:43,246 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2020-12-09 13:58:43,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:58:43,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-09 13:58:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:43,247 INFO L225 Difference]: With dead ends: 101 [2020-12-09 13:58:43,247 INFO L226 Difference]: Without dead ends: 101 [2020-12-09 13:58:43,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-12-09 13:58:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 65. [2020-12-09 13:58:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 13:58:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2020-12-09 13:58:43,249 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 24 [2020-12-09 13:58:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:43,250 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2020-12-09 13:58:43,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:58:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-12-09 13:58:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 13:58:43,250 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:43,250 INFO L422 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] [2020-12-09 13:58:43,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2020-12-09 13:58:43,451 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:43,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:43,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1312759107, now seen corresponding path program 1 times [2020-12-09 13:58:43,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:43,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069529843] [2020-12-09 13:58:43,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:43,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 13:58:43,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:43,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:43,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069529843] [2020-12-09 13:58:43,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:43,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:58:43,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455918121] [2020-12-09 13:58:43,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:58:43,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:43,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:58:43,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:58:43,552 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 4 states. [2020-12-09 13:58:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:43,642 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-12-09 13:58:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:58:43,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-09 13:58:43,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:43,643 INFO L225 Difference]: With dead ends: 69 [2020-12-09 13:58:43,643 INFO L226 Difference]: Without dead ends: 69 [2020-12-09 13:58:43,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:43,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-12-09 13:58:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2020-12-09 13:58:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 13:58:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2020-12-09 13:58:43,644 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 24 [2020-12-09 13:58:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:43,644 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2020-12-09 13:58:43,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:58:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2020-12-09 13:58:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 13:58:43,645 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:43,645 INFO L422 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] [2020-12-09 13:58:43,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2020-12-09 13:58:43,846 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:43,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1312759108, now seen corresponding path program 1 times [2020-12-09 13:58:43,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:43,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365656438] [2020-12-09 13:58:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:43,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-09 13:58:43,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:44,010 INFO L382 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 [2020-12-09 13:58:44,011 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,021 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,024 INFO L382 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 [2020-12-09 13:58:44,024 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,033 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,033 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,033 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 13:58:44,067 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,068 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 13:58:44,068 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,080 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,082 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 13:58:44,083 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,092 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,093 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,093 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:11 [2020-12-09 13:58:44,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 13:58:44,116 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 13:58:44,117 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,128 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,139 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,139 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 13:58:44,140 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,152 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,153 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,154 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:11 [2020-12-09 13:58:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:44,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:44,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365656438] [2020-12-09 13:58:44,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:44,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 13:58:44,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528078684] [2020-12-09 13:58:44,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 13:58:44,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:44,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 13:58:44,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-09 13:58:44,202 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 8 states. [2020-12-09 13:58:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:44,556 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2020-12-09 13:58:44,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 13:58:44,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-09 13:58:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:44,557 INFO L225 Difference]: With dead ends: 108 [2020-12-09 13:58:44,557 INFO L226 Difference]: Without dead ends: 108 [2020-12-09 13:58:44,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-12-09 13:58:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-12-09 13:58:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 65. [2020-12-09 13:58:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 13:58:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2020-12-09 13:58:44,559 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 24 [2020-12-09 13:58:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:44,559 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2020-12-09 13:58:44,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 13:58:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-12-09 13:58:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 13:58:44,559 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:44,560 INFO L422 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] [2020-12-09 13:58:44,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2020-12-09 13:58:44,761 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:44,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:44,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1983617125, now seen corresponding path program 1 times [2020-12-09 13:58:44,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:44,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965368774] [2020-12-09 13:58:44,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:44,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-09 13:58:44,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:44,917 INFO L382 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 [2020-12-09 13:58:44,918 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,925 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,928 INFO L382 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 [2020-12-09 13:58:44,928 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,934 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,934 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,935 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 13:58:44,969 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,969 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 13:58:44,970 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,980 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,983 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-12-09 13:58:44,984 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,994 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:44,995 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:44,995 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-09 13:58:45,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 13:58:45,015 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-12-09 13:58:45,016 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:45,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:45,036 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:45,036 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 13:58:45,037 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:45,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:45,049 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:45,049 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-09 13:58:45,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 13:58:45,092 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 13:58:45,093 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:45,105 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:45,112 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:45,112 INFO L382 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 13 treesize of output 17 [2020-12-09 13:58:45,113 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:45,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:45,123 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:45,123 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-09 13:58:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:45,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:45,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965368774] [2020-12-09 13:58:45,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:45,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 13:58:45,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987805995] [2020-12-09 13:58:45,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 13:58:45,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:45,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 13:58:45,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-09 13:58:45,148 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 9 states. [2020-12-09 13:58:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:45,463 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-12-09 13:58:45,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 13:58:45,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-12-09 13:58:45,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:45,464 INFO L225 Difference]: With dead ends: 70 [2020-12-09 13:58:45,464 INFO L226 Difference]: Without dead ends: 70 [2020-12-09 13:58:45,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-12-09 13:58:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-12-09 13:58:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2020-12-09 13:58:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 13:58:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-12-09 13:58:45,466 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 25 [2020-12-09 13:58:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:45,466 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-12-09 13:58:45,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 13:58:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-12-09 13:58:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 13:58:45,466 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:45,466 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:45,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2020-12-09 13:58:45,668 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:45,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:45,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1565587052, now seen corresponding path program 1 times [2020-12-09 13:58:45,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:45,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103525760] [2020-12-09 13:58:45,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:45,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 13:58:45,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:45,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:45,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103525760] [2020-12-09 13:58:45,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:45,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:58:45,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286422099] [2020-12-09 13:58:45,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:58:45,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:45,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:58:45,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:45,782 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2020-12-09 13:58:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:45,918 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2020-12-09 13:58:45,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 13:58:45,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-12-09 13:58:45,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:45,919 INFO L225 Difference]: With dead ends: 66 [2020-12-09 13:58:45,919 INFO L226 Difference]: Without dead ends: 66 [2020-12-09 13:58:45,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:58:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-12-09 13:58:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2020-12-09 13:58:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 13:58:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-12-09 13:58:45,920 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2020-12-09 13:58:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:45,920 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-12-09 13:58:45,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:58:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-12-09 13:58:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 13:58:45,920 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:45,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:46,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2020-12-09 13:58:46,122 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:46,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:46,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1565587051, now seen corresponding path program 1 times [2020-12-09 13:58:46,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:46,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613529306] [2020-12-09 13:58:46,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:46,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-09 13:58:46,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:46,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:46,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613529306] [2020-12-09 13:58:46,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:46,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 13:58:46,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346012505] [2020-12-09 13:58:46,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 13:58:46,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:46,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 13:58:46,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-09 13:58:46,314 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 8 states. [2020-12-09 13:58:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:46,519 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-12-09 13:58:46,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 13:58:46,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-12-09 13:58:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:46,520 INFO L225 Difference]: With dead ends: 59 [2020-12-09 13:58:46,520 INFO L226 Difference]: Without dead ends: 59 [2020-12-09 13:58:46,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2020-12-09 13:58:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-12-09 13:58:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-12-09 13:58:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-12-09 13:58:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-12-09 13:58:46,521 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 27 [2020-12-09 13:58:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:46,522 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-12-09 13:58:46,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 13:58:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-12-09 13:58:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 13:58:46,522 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:46,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:46,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2020-12-09 13:58:46,723 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:46,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:46,723 INFO L82 PathProgramCache]: Analyzing trace with hash 239500490, now seen corresponding path program 1 times [2020-12-09 13:58:46,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:46,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128119607] [2020-12-09 13:58:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:46,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 47 conjunts are in the unsatisfiable core [2020-12-09 13:58:46,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:46,904 INFO L382 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 [2020-12-09 13:58:46,905 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:46,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:46,918 INFO L382 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 [2020-12-09 13:58:46,919 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:46,926 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:46,927 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:46,927 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2020-12-09 13:58:46,965 INFO L382 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 15 treesize of output 7 [2020-12-09 13:58:46,966 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:46,971 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:46,972 INFO L382 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 15 treesize of output 7 [2020-12-09 13:58:46,973 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:46,976 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:46,976 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:46,976 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2020-12-09 13:58:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:47,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:47,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128119607] [2020-12-09 13:58:47,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:47,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 13:58:47,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962443268] [2020-12-09 13:58:47,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 13:58:47,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:47,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 13:58:47,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-12-09 13:58:47,030 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 12 states. [2020-12-09 13:58:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:47,621 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2020-12-09 13:58:47,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 13:58:47,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-12-09 13:58:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:47,622 INFO L225 Difference]: With dead ends: 97 [2020-12-09 13:58:47,622 INFO L226 Difference]: Without dead ends: 97 [2020-12-09 13:58:47,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2020-12-09 13:58:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-12-09 13:58:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2020-12-09 13:58:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 13:58:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2020-12-09 13:58:47,623 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 32 [2020-12-09 13:58:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:47,623 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2020-12-09 13:58:47,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 13:58:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-12-09 13:58:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 13:58:47,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:47,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:47,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2020-12-09 13:58:47,825 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash 239500747, now seen corresponding path program 1 times [2020-12-09 13:58:47,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:47,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97525240] [2020-12-09 13:58:47,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:47,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:58:47,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:47,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:47,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97525240] [2020-12-09 13:58:47,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:47,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:58:47,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121453684] [2020-12-09 13:58:47,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:58:47,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:47,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:58:47,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:58:47,948 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 4 states. [2020-12-09 13:58:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:47,980 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2020-12-09 13:58:47,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:58:47,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-12-09 13:58:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:47,980 INFO L225 Difference]: With dead ends: 64 [2020-12-09 13:58:47,980 INFO L226 Difference]: Without dead ends: 64 [2020-12-09 13:58:47,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-09 13:58:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-12-09 13:58:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 13:58:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2020-12-09 13:58:47,982 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 32 [2020-12-09 13:58:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:47,982 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-12-09 13:58:47,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:58:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2020-12-09 13:58:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 13:58:47,982 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:47,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:48,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2020-12-09 13:58:48,183 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:48,184 INFO L82 PathProgramCache]: Analyzing trace with hash 962650099, now seen corresponding path program 1 times [2020-12-09 13:58:48,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:48,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812571132] [2020-12-09 13:58:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:48,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-09 13:58:48,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:48,403 INFO L382 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 [2020-12-09 13:58:48,404 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:48,408 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:48,408 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:48,409 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2020-12-09 13:58:48,442 INFO L382 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 15 treesize of output 7 [2020-12-09 13:58:48,443 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:48,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:48,445 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:48,445 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-12-09 13:58:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:48,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:48,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812571132] [2020-12-09 13:58:48,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:48,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 13:58:48,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675946863] [2020-12-09 13:58:48,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 13:58:48,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:48,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 13:58:48,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-12-09 13:58:48,492 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 14 states. [2020-12-09 13:58:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:48,974 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2020-12-09 13:58:48,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 13:58:48,974 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2020-12-09 13:58:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:48,974 INFO L225 Difference]: With dead ends: 63 [2020-12-09 13:58:48,974 INFO L226 Difference]: Without dead ends: 63 [2020-12-09 13:58:48,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2020-12-09 13:58:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-09 13:58:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-12-09 13:58:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 13:58:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2020-12-09 13:58:48,976 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 33 [2020-12-09 13:58:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:48,976 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2020-12-09 13:58:48,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 13:58:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2020-12-09 13:58:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 13:58:48,976 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:48,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:49,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2020-12-09 13:58:49,178 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:49,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:49,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1165411295, now seen corresponding path program 1 times [2020-12-09 13:58:49,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:49,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506164224] [2020-12-09 13:58:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:49,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 13:58:49,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:49,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:49,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506164224] [2020-12-09 13:58:49,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:49,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:58:49,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024353796] [2020-12-09 13:58:49,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 13:58:49,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:49,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 13:58:49,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 13:58:49,432 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 6 states. [2020-12-09 13:58:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:49,552 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2020-12-09 13:58:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:58:49,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-12-09 13:58:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:49,553 INFO L225 Difference]: With dead ends: 62 [2020-12-09 13:58:49,553 INFO L226 Difference]: Without dead ends: 62 [2020-12-09 13:58:49,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:58:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-12-09 13:58:49,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-12-09 13:58:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-12-09 13:58:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2020-12-09 13:58:49,554 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 33 [2020-12-09 13:58:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:49,554 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2020-12-09 13:58:49,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 13:58:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2020-12-09 13:58:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 13:58:49,555 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:49,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:49,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2020-12-09 13:58:49,756 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:49,757 INFO L82 PathProgramCache]: Analyzing trace with hash -222617872, now seen corresponding path program 1 times [2020-12-09 13:58:49,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:49,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971156006] [2020-12-09 13:58:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:49,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 44 conjunts are in the unsatisfiable core [2020-12-09 13:58:49,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:50,142 INFO L382 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 [2020-12-09 13:58:50,143 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:50,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:50,159 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:58:50,159 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2020-12-09 13:58:50,242 INFO L382 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 15 treesize of output 7 [2020-12-09 13:58:50,243 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:50,252 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:50,253 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:58:50,253 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2020-12-09 13:58:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:50,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:50,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971156006] [2020-12-09 13:58:50,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:50,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 13:58:50,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232095257] [2020-12-09 13:58:50,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 13:58:50,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:50,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 13:58:50,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-12-09 13:58:50,420 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 15 states. [2020-12-09 13:58:51,593 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2020-12-09 13:58:51,785 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2020-12-09 13:58:51,983 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2020-12-09 13:58:52,188 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2020-12-09 13:58:52,413 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2020-12-09 13:58:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:52,501 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-12-09 13:58:52,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 13:58:52,502 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2020-12-09 13:58:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:52,502 INFO L225 Difference]: With dead ends: 61 [2020-12-09 13:58:52,502 INFO L226 Difference]: Without dead ends: 61 [2020-12-09 13:58:52,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2020-12-09 13:58:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-09 13:58:52,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-12-09 13:58:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 13:58:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-12-09 13:58:52,504 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 34 [2020-12-09 13:58:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:52,504 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-12-09 13:58:52,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 13:58:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-12-09 13:58:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 13:58:52,504 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:52,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:52,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2020-12-09 13:58:52,705 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:52,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:52,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1768011635, now seen corresponding path program 1 times [2020-12-09 13:58:52,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:52,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051215846] [2020-12-09 13:58:52,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:52,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:58:52,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:52,811 INFO L382 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 [2020-12-09 13:58:52,812 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:52,814 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:52,814 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:52,814 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:58:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:52,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:52,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051215846] [2020-12-09 13:58:52,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:52,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:58:52,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358855400] [2020-12-09 13:58:52,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:58:52,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:52,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:58:52,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:58:52,832 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 4 states. [2020-12-09 13:58:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:52,945 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2020-12-09 13:58:52,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:58:52,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-12-09 13:58:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:52,945 INFO L225 Difference]: With dead ends: 81 [2020-12-09 13:58:52,945 INFO L226 Difference]: Without dead ends: 81 [2020-12-09 13:58:52,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-12-09 13:58:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2020-12-09 13:58:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 13:58:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2020-12-09 13:58:52,947 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 34 [2020-12-09 13:58:52,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:52,947 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-12-09 13:58:52,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:58:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2020-12-09 13:58:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 13:58:52,947 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:52,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:53,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2020-12-09 13:58:53,148 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:53,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:53,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1688780693, now seen corresponding path program 1 times [2020-12-09 13:58:53,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:53,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619138513] [2020-12-09 13:58:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:53,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-09 13:58:53,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:53,269 INFO L382 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 [2020-12-09 13:58:53,269 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:53,280 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:53,280 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:53,280 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2020-12-09 13:58:53,343 INFO L382 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 [2020-12-09 13:58:53,343 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:53,350 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:53,351 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:53,351 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2020-12-09 13:58:53,385 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-12-09 13:58:53,385 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:53,387 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:53,387 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:53,387 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2020-12-09 13:58:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:53,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:53,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619138513] [2020-12-09 13:58:53,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:53,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 13:58:53,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999297348] [2020-12-09 13:58:53,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 13:58:53,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:53,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 13:58:53,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-12-09 13:58:53,440 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 14 states. [2020-12-09 13:58:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:54,290 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2020-12-09 13:58:54,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 13:58:54,291 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-12-09 13:58:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:54,291 INFO L225 Difference]: With dead ends: 80 [2020-12-09 13:58:54,291 INFO L226 Difference]: Without dead ends: 80 [2020-12-09 13:58:54,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2020-12-09 13:58:54,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-12-09 13:58:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2020-12-09 13:58:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-09 13:58:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2020-12-09 13:58:54,293 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 35 [2020-12-09 13:58:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:54,293 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2020-12-09 13:58:54,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 13:58:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2020-12-09 13:58:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 13:58:54,293 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:54,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:54,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2020-12-09 13:58:54,495 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:54,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:54,496 INFO L82 PathProgramCache]: Analyzing trace with hash 667712339, now seen corresponding path program 1 times [2020-12-09 13:58:54,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:54,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314811416] [2020-12-09 13:58:54,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:54,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 13:58:54,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:54,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:54,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314811416] [2020-12-09 13:58:54,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:54,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:58:54,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735694917] [2020-12-09 13:58:54,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:58:54,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:54,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:58:54,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:58:54,666 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 4 states. [2020-12-09 13:58:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:58:54,703 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2020-12-09 13:58:54,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:58:54,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-09 13:58:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:58:54,704 INFO L225 Difference]: With dead ends: 76 [2020-12-09 13:58:54,704 INFO L226 Difference]: Without dead ends: 76 [2020-12-09 13:58:54,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:58:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-12-09 13:58:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2020-12-09 13:58:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 13:58:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-12-09 13:58:54,705 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 35 [2020-12-09 13:58:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:58:54,706 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-12-09 13:58:54,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:58:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-12-09 13:58:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 13:58:54,706 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:58:54,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:58:54,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2020-12-09 13:58:54,907 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:58:54,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:58:54,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1650523386, now seen corresponding path program 1 times [2020-12-09 13:58:54,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:58:54,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674442669] [2020-12-09 13:58:54,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2020-12-09 13:58:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:58:55,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 13:58:55,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:58:55,033 INFO L382 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 [2020-12-09 13:58:55,034 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:55,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:55,036 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:55,036 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:58:55,052 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:55,052 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 13:58:55,053 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:55,054 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:58:55,055 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:58:55,055 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-12-09 13:58:55,094 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 13:58:55,094 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:58:55,103 INFO L625 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2020-12-09 13:58:55,104 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:58:55,104 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:13 [2020-12-09 13:58:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:58:55,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:58:55,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674442669] [2020-12-09 13:58:55,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:58:55,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 13:58:55,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386386124] [2020-12-09 13:58:55,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 13:58:55,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:58:55,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 13:58:55,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-09 13:58:55,124 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 8 states. [2020-12-09 13:59:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:59:09,423 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2020-12-09 13:59:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 13:59:09,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-12-09 13:59:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:59:09,424 INFO L225 Difference]: With dead ends: 78 [2020-12-09 13:59:09,424 INFO L226 Difference]: Without dead ends: 78 [2020-12-09 13:59:09,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-12-09 13:59:09,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-12-09 13:59:09,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2020-12-09 13:59:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-12-09 13:59:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-12-09 13:59:09,425 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 37 [2020-12-09 13:59:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:59:09,425 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-12-09 13:59:09,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 13:59:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-12-09 13:59:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 13:59:09,425 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:59:09,425 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:59:09,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2020-12-09 13:59:09,627 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:59:09,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:59:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash -781143081, now seen corresponding path program 1 times [2020-12-09 13:59:09,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:59:09,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325564587] [2020-12-09 13:59:09,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2020-12-09 13:59:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:59:09,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 46 conjunts are in the unsatisfiable core [2020-12-09 13:59:09,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:59:09,785 INFO L382 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 [2020-12-09 13:59:09,785 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:09,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:09,789 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:59:09,789 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 13:59:09,844 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:09,845 INFO L382 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 19 treesize of output 41 [2020-12-09 13:59:09,846 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:09,858 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:09,859 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:59:09,859 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:28 [2020-12-09 13:59:09,938 INFO L382 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 [2020-12-09 13:59:09,939 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:09,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:09,952 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:59:09,952 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2020-12-09 13:59:10,005 INFO L382 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 25 treesize of output 13 [2020-12-09 13:59:10,006 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:10,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:10,012 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:59:10,012 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2020-12-09 13:59:10,102 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2020-12-09 13:59:10,104 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:10,112 INFO L625 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2020-12-09 13:59:10,113 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:59:10,113 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:13 [2020-12-09 13:59:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:59:10,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:59:10,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325564587] [2020-12-09 13:59:10,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:59:10,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-09 13:59:10,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284426769] [2020-12-09 13:59:10,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 13:59:10,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:59:10,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 13:59:10,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-12-09 13:59:10,149 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 17 states. [2020-12-09 13:59:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:59:21,586 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-12-09 13:59:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-09 13:59:21,587 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2020-12-09 13:59:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:59:21,587 INFO L225 Difference]: With dead ends: 71 [2020-12-09 13:59:21,587 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 13:59:21,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=727, Unknown=0, NotChecked=0, Total=992 [2020-12-09 13:59:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 13:59:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2020-12-09 13:59:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 13:59:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-12-09 13:59:21,589 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 38 [2020-12-09 13:59:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:59:21,589 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-12-09 13:59:21,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 13:59:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-12-09 13:59:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 13:59:21,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:59:21,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:59:21,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2020-12-09 13:59:21,790 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:59:21,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:59:21,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1956436716, now seen corresponding path program 1 times [2020-12-09 13:59:21,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:59:21,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62178208] [2020-12-09 13:59:21,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2020-12-09 13:59:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:59:21,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 13:59:21,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:59:21,945 INFO L382 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 [2020-12-09 13:59:21,945 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:21,947 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:21,947 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:59:21,947 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:59:21,961 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:21,961 INFO L382 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 13 treesize of output 17 [2020-12-09 13:59:21,961 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:21,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:21,963 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:59:21,964 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2020-12-09 13:59:21,996 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:21,997 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 13:59:21,997 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:22,003 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:22,003 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:59:22,003 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2020-12-09 13:59:22,110 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 13:59:22,111 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:22,128 INFO L625 ElimStorePlain]: treesize reduction 4, result has 81.0 percent of original size [2020-12-09 13:59:22,128 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:59:22,129 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2020-12-09 13:59:22,173 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:22,174 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2020-12-09 13:59:22,175 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:22,195 INFO L625 ElimStorePlain]: treesize reduction 22, result has 42.1 percent of original size [2020-12-09 13:59:22,196 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 13:59:22,196 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2020-12-09 13:59:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:59:22,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:59:22,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62178208] [2020-12-09 13:59:22,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:59:22,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 13:59:22,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413571237] [2020-12-09 13:59:22,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 13:59:22,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:59:22,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 13:59:22,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-12-09 13:59:22,227 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-12-09 13:59:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:59:52,669 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2020-12-09 13:59:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 13:59:52,669 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2020-12-09 13:59:52,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:59:52,670 INFO L225 Difference]: With dead ends: 79 [2020-12-09 13:59:52,670 INFO L226 Difference]: Without dead ends: 79 [2020-12-09 13:59:52,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2020-12-09 13:59:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-09 13:59:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2020-12-09 13:59:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-09 13:59:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-12-09 13:59:52,671 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 40 [2020-12-09 13:59:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:59:52,671 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-12-09 13:59:52,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 13:59:52,671 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-12-09 13:59:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 13:59:52,672 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:59:52,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:59:52,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3 [2020-12-09 13:59:52,872 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 13:59:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:59:52,873 INFO L82 PathProgramCache]: Analyzing trace with hash -900572292, now seen corresponding path program 1 times [2020-12-09 13:59:52,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:59:52,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842195944] [2020-12-09 13:59:52,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 40 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with mathsat -unsat_core_generation=3 [2020-12-09 13:59:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:59:53,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 51 conjunts are in the unsatisfiable core [2020-12-09 13:59:53,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:59:53,116 INFO L382 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 [2020-12-09 13:59:53,117 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:53,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:53,122 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:59:53,122 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 13:59:53,148 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:53,148 INFO L382 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 13 treesize of output 17 [2020-12-09 13:59:53,148 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:53,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:53,153 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:59:53,154 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2020-12-09 13:59:53,246 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:53,246 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-09 13:59:53,247 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:53,264 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:53,264 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:59:53,264 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:32 [2020-12-09 13:59:53,378 INFO L382 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 [2020-12-09 13:59:53,379 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:53,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:53,395 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:59:53,395 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2020-12-09 13:59:53,476 INFO L382 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 25 treesize of output 13 [2020-12-09 13:59:53,476 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:53,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:53,485 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:59:53,485 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2020-12-09 13:59:53,624 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 19 [2020-12-09 13:59:53,625 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:53,639 INFO L625 ElimStorePlain]: treesize reduction 4, result has 81.0 percent of original size [2020-12-09 13:59:53,639 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:59:53,639 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:17 [2020-12-09 13:59:53,705 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:59:53,705 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2020-12-09 13:59:53,706 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:59:53,729 INFO L625 ElimStorePlain]: treesize reduction 22, result has 45.0 percent of original size [2020-12-09 13:59:53,729 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 13:59:53,729 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:18 [2020-12-09 13:59:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:59:53,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:59:53,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842195944] [2020-12-09 13:59:53,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:59:53,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-12-09 13:59:53,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470054898] [2020-12-09 13:59:53,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 13:59:53,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:59:53,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 13:59:53,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2020-12-09 13:59:53,789 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 21 states. [2020-12-09 14:00:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:00:09,584 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2020-12-09 14:00:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-09 14:00:09,585 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2020-12-09 14:00:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:00:09,585 INFO L225 Difference]: With dead ends: 78 [2020-12-09 14:00:09,585 INFO L226 Difference]: Without dead ends: 78 [2020-12-09 14:00:09,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=395, Invalid=1165, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 14:00:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-12-09 14:00:09,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2020-12-09 14:00:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-12-09 14:00:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-12-09 14:00:09,587 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 41 [2020-12-09 14:00:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:00:09,588 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-12-09 14:00:09,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 14:00:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-12-09 14:00:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 14:00:09,588 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:00:09,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:00:09,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 mathsat -unsat_core_generation=3 [2020-12-09 14:00:09,789 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:00:09,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:00:09,789 INFO L82 PathProgramCache]: Analyzing trace with hash -519995891, now seen corresponding path program 1 times [2020-12-09 14:00:09,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 14:00:09,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136096370] [2020-12-09 14:00:09,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 41 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with mathsat -unsat_core_generation=3 [2020-12-09 14:00:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:00:09,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 14:00:09,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:00:09,930 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:09,931 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 14:00:09,931 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:00:09,944 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-12-09 14:00:09,945 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:00:09,945 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 14:00:09,945 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 14:00:09,945 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:00:09,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:00:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:00:23,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 14:00:23,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136096370] [2020-12-09 14:00:23,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:00:23,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 14:00:23,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070225714] [2020-12-09 14:00:23,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 14:00:23,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 14:00:23,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 14:00:23,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=118, Unknown=2, NotChecked=0, Total=156 [2020-12-09 14:00:23,506 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 13 states. [2020-12-09 14:00:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:00:40,790 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2020-12-09 14:00:40,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 14:00:40,791 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-12-09 14:00:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:00:40,791 INFO L225 Difference]: With dead ends: 77 [2020-12-09 14:00:40,791 INFO L226 Difference]: Without dead ends: 56 [2020-12-09 14:00:40,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 29 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=51, Invalid=185, Unknown=4, NotChecked=0, Total=240 [2020-12-09 14:00:40,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-12-09 14:00:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-12-09 14:00:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 14:00:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2020-12-09 14:00:40,792 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 41 [2020-12-09 14:00:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:00:40,792 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2020-12-09 14:00:40,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 14:00:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2020-12-09 14:00:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-09 14:00:40,793 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:00:40,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:00:40,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 mathsat -unsat_core_generation=3 [2020-12-09 14:00:40,994 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:00:40,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:00:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 430545156, now seen corresponding path program 1 times [2020-12-09 14:00:40,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 14:00:40,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363301753] [2020-12-09 14:00:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 42 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with mathsat -unsat_core_generation=3 [2020-12-09 14:00:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:00:41,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-09 14:00:41,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:00:41,170 INFO L382 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 [2020-12-09 14:00:41,171 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:00:41,178 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:41,178 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:00:41,179 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2020-12-09 14:00:41,211 INFO L382 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 16 treesize of output 8 [2020-12-09 14:00:41,212 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:00:41,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:41,214 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:00:41,214 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2020-12-09 14:00:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:00:41,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 14:00:41,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363301753] [2020-12-09 14:00:41,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:00:41,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-09 14:00:41,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058701699] [2020-12-09 14:00:41,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 14:00:41,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 14:00:41,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 14:00:41,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-12-09 14:00:41,265 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 14 states. [2020-12-09 14:00:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:00:41,840 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2020-12-09 14:00:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 14:00:41,840 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2020-12-09 14:00:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:00:41,840 INFO L225 Difference]: With dead ends: 47 [2020-12-09 14:00:41,840 INFO L226 Difference]: Without dead ends: 47 [2020-12-09 14:00:41,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2020-12-09 14:00:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-09 14:00:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-12-09 14:00:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-09 14:00:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 46 transitions. [2020-12-09 14:00:41,841 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 46 transitions. Word has length 42 [2020-12-09 14:00:41,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:00:41,842 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 46 transitions. [2020-12-09 14:00:41,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 14:00:41,842 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 46 transitions. [2020-12-09 14:00:41,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-09 14:00:41,842 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:00:41,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:00:42,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 mathsat -unsat_core_generation=3 [2020-12-09 14:00:42,043 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:00:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:00:42,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1711698142, now seen corresponding path program 1 times [2020-12-09 14:00:42,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 14:00:42,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760822039] [2020-12-09 14:00:42,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 43 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with mathsat -unsat_core_generation=3 [2020-12-09 14:00:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:00:42,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 58 conjunts are in the unsatisfiable core [2020-12-09 14:00:42,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:00:42,192 INFO L382 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 [2020-12-09 14:00:42,192 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:00:42,196 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:42,197 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:00:42,197 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 14:00:42,229 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:42,229 INFO L382 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 19 treesize of output 41 [2020-12-09 14:00:42,230 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:00:42,237 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:42,238 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:00:42,238 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2020-12-09 14:00:42,308 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:42,308 INFO L382 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 22 treesize of output 69 [2020-12-09 14:00:42,310 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:00:42,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:42,326 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:00:42,326 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2020-12-09 14:00:42,490 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:42,490 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 103 [2020-12-09 14:00:42,492 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:00:42,525 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:42,525 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:00:42,525 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:60 [2020-12-09 14:00:42,718 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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 [2020-12-09 14:00:42,718 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:00:42,753 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:42,754 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:00:42,754 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:76 [2020-12-09 14:00:42,884 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2020-12-09 14:00:42,885 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:00:42,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:42,912 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:00:42,912 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:49 [2020-12-09 14:00:43,168 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2020-12-09 14:00:43,169 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:00:43,205 INFO L625 ElimStorePlain]: treesize reduction 12, result has 75.5 percent of original size [2020-12-09 14:00:43,206 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 14:00:43,206 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:39 [2020-12-09 14:00:43,391 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:43,391 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 73 [2020-12-09 14:00:43,392 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:00:43,424 INFO L625 ElimStorePlain]: treesize reduction 16, result has 67.3 percent of original size [2020-12-09 14:00:43,426 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 14:00:43,426 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2020-12-09 14:00:43,693 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:00:43,693 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 95 [2020-12-09 14:00:43,696 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:00:43,742 INFO L625 ElimStorePlain]: treesize reduction 12, result has 74.5 percent of original size [2020-12-09 14:00:43,744 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 14:00:43,745 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2020-12-09 14:00:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:00:44,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 14:00:44,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760822039] [2020-12-09 14:00:44,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:00:44,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-12-09 14:00:44,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894637177] [2020-12-09 14:00:44,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 14:00:44,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 14:00:44,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 14:00:44,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2020-12-09 14:00:44,331 INFO L87 Difference]: Start difference. First operand 47 states and 46 transitions. Second operand 21 states. [2020-12-09 14:01:19,594 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-12-09 14:01:19,953 WARN L197 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2020-12-09 14:01:20,421 WARN L197 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2020-12-09 14:01:20,878 WARN L197 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2020-12-09 14:01:21,344 WARN L197 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 98 [2020-12-09 14:01:21,901 WARN L197 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 108 [2020-12-09 14:01:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:01:28,866 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2020-12-09 14:01:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 14:01:28,866 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2020-12-09 14:01:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:01:28,867 INFO L225 Difference]: With dead ends: 46 [2020-12-09 14:01:28,867 INFO L226 Difference]: Without dead ends: 46 [2020-12-09 14:01:28,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2020-12-09 14:01:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-09 14:01:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-12-09 14:01:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-09 14:01:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2020-12-09 14:01:28,868 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 44 [2020-12-09 14:01:28,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:01:28,868 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2020-12-09 14:01:28,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 14:01:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2020-12-09 14:01:28,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-09 14:01:28,869 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:01:28,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:01:29,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 mathsat -unsat_core_generation=3 [2020-12-09 14:01:29,070 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:01:29,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:01:29,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1523035011, now seen corresponding path program 1 times [2020-12-09 14:01:29,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 14:01:29,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134820514] [2020-12-09 14:01:29,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/mathsat Starting monitored process 44 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with mathsat -unsat_core_generation=3 [2020-12-09 14:01:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:01:29,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 62 conjunts are in the unsatisfiable core [2020-12-09 14:01:29,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:01:29,274 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:01:29,274 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 14:01:29,275 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:01:29,288 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-12-09 14:01:29,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:01:29,289 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 14:01:29,289 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 14:01:29,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:01:29,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:01:30,017 INFO L382 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 [2020-12-09 14:01:30,018 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:01:30,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:01:30,059 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 14:01:30,059 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:78 [2020-12-09 14:01:30,339 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2020-12-09 14:01:30,340 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:01:30,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:01:30,370 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 14:01:30,370 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:78, output treesize:65 [2020-12-09 14:01:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:01:52,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 14:01:52,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134820514] [2020-12-09 14:01:52,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:01:52,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-12-09 14:01:52,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438959377] [2020-12-09 14:01:52,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 14:01:52,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 14:01:52,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 14:01:52,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=480, Unknown=4, NotChecked=0, Total=552 [2020-12-09 14:01:52,930 INFO L87 Difference]: Start difference. First operand 46 states and 45 transitions. Second operand 24 states. [2020-12-09 14:02:22,574 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-12-09 14:02:31,395 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-12-09 14:02:32,524 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-12-09 14:02:33,418 WARN L197 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-12-09 14:02:34,142 WARN L197 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2020-12-09 14:02:34,964 WARN L197 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2020-12-09 14:02:35,723 WARN L197 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2020-12-09 14:02:36,589 WARN L197 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2020-12-09 14:02:37,474 WARN L197 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2020-12-09 14:02:42,024 WARN L197 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-12-09 14:02:48,830 WARN L197 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-12-09 14:02:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:02:49,052 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2020-12-09 14:02:49,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-09 14:02:49,053 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2020-12-09 14:02:49,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:02:49,054 INFO L225 Difference]: With dead ends: 45 [2020-12-09 14:02:49,054 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 14:02:49,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=196, Invalid=1274, Unknown=12, NotChecked=0, Total=1482 [2020-12-09 14:02:49,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 14:02:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 14:02:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 14:02:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 14:02:49,054 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2020-12-09 14:02:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:02:49,054 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 14:02:49,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 14:02:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 14:02:49,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 14:02:49,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 mathsat -unsat_core_generation=3 [2020-12-09 14:02:49,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:02:49 BoogieIcfgContainer [2020-12-09 14:02:49,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 14:02:49,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 14:02:49,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 14:02:49,263 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 14:02:49,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:57:58" (3/4) ... [2020-12-09 14:02:49,265 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 14:02:49,274 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2020-12-09 14:02:49,275 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-12-09 14:02:49,275 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 14:02:49,308 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3efc3ab3-ddf8-4cc5-9e4c-8a06048a4ed5/bin/utaipan/witness.graphml [2020-12-09 14:02:49,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 14:02:49,308 INFO L168 Benchmark]: Toolchain (without parser) took 291728.08 ms. Allocated memory was 56.6 MB in the beginning and 104.9 MB in the end (delta: 48.2 MB). Free memory was 34.4 MB in the beginning and 81.1 MB in the end (delta: -46.7 MB). Peak memory consumption was 62.2 MB. Max. memory is 16.1 GB. [2020-12-09 14:02:49,309 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 56.6 MB. Free memory was 39.4 MB in the beginning and 39.3 MB in the end (delta: 81.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 14:02:49,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.31 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 34.2 MB in the beginning and 37.8 MB in the end (delta: -3.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 14:02:49,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.19 ms. Allocated memory is still 71.3 MB. Free memory was 37.5 MB in the beginning and 35.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 14:02:49,309 INFO L168 Benchmark]: Boogie Preprocessor took 34.09 ms. Allocated memory is still 71.3 MB. Free memory was 35.1 MB in the beginning and 53.6 MB in the end (delta: -18.4 MB). Peak memory consumption was 2.6 MB. Max. memory is 16.1 GB. [2020-12-09 14:02:49,310 INFO L168 Benchmark]: RCFGBuilder took 421.97 ms. Allocated memory is still 71.3 MB. Free memory was 53.6 MB in the beginning and 40.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-12-09 14:02:49,310 INFO L168 Benchmark]: TraceAbstraction took 290666.55 ms. Allocated memory was 71.3 MB in the beginning and 104.9 MB in the end (delta: 33.6 MB). Free memory was 40.5 MB in the beginning and 24.7 MB in the end (delta: 15.8 MB). Peak memory consumption was 49.4 MB. Max. memory is 16.1 GB. [2020-12-09 14:02:49,310 INFO L168 Benchmark]: Witness Printer took 45.45 ms. Allocated memory is still 104.9 MB. Free memory was 24.7 MB in the beginning and 81.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. [2020-12-09 14:02:49,311 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.11 ms. Allocated memory is still 56.6 MB. Free memory was 39.4 MB in the beginning and 39.3 MB in the end (delta: 81.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 503.31 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 34.2 MB in the beginning and 37.8 MB in the end (delta: -3.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.19 ms. Allocated memory is still 71.3 MB. Free memory was 37.5 MB in the beginning and 35.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.09 ms. Allocated memory is still 71.3 MB. Free memory was 35.1 MB in the beginning and 53.6 MB in the end (delta: -18.4 MB). Peak memory consumption was 2.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 421.97 ms. Allocated memory is still 71.3 MB. Free memory was 53.6 MB in the beginning and 40.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 290666.55 ms. Allocated memory was 71.3 MB in the beginning and 104.9 MB in the end (delta: 33.6 MB). Free memory was 40.5 MB in the beginning and 24.7 MB in the end (delta: 15.8 MB). Peak memory consumption was 49.4 MB. Max. memory is 16.1 GB. * Witness Printer took 45.45 ms. Allocated memory is still 104.9 MB. Free memory was 24.7 MB in the beginning and 81.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 807]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 816]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 807]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 822]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 814]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 784]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 818]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 811]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 811]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 816]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 785]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 798]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 785]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 784]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 788]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 798]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 788]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 814]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 816]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 818]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 818]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 814]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 798]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 79 locations, 29 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 290.6s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 222.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2216 SDtfs, 7585 SDslu, 5256 SDs, 0 SdLazy, 7698 SolverSat, 590 SolverUnsat, 85 SolverUnknown, 0 SolverNotchecked, 176.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1237 GetRequests, 635 SyntacticMatches, 56 SemanticMatches, 546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 93.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 1829 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 54.3s InterpolantComputationTime, 1038 NumberOfCodeBlocks, 1038 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 995 ConstructedInterpolants, 229 QuantifiedInterpolants, 487503 SizeOfPredicates, 665 NumberOfNonLiveVariables, 4753 ConjunctsInSsa, 844 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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 proved your program to be correct! Received shutdown request...