./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.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_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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 960a43474c75eeb33a7f3e9b45605c9175ab42f2 ............................................................................................................................................ 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_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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 960a43474c75eeb33a7f3e9b45605c9175ab42f2 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 13:46:53,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 13:46:53,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 13:46:53,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 13:46:53,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 13:46:53,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 13:46:53,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 13:46:53,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 13:46:53,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 13:46:53,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 13:46:53,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 13:46:53,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 13:46:53,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 13:46:53,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 13:46:53,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 13:46:53,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 13:46:53,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 13:46:53,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 13:46:53,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 13:46:53,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 13:46:53,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 13:46:53,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 13:46:53,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 13:46:53,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 13:46:53,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 13:46:53,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 13:46:53,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 13:46:53,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 13:46:53,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 13:46:53,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 13:46:53,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 13:46:53,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 13:46:53,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 13:46:53,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 13:46:53,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 13:46:53,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 13:46:53,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 13:46:53,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 13:46:53,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 13:46:53,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 13:46:53,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 13:46:53,549 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 13:46:53,569 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 13:46:53,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 13:46:53,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 13:46:53,570 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 13:46:53,570 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 13:46:53,570 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 13:46:53,570 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 13:46:53,570 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 13:46:53,571 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 13:46:53,571 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 13:46:53,571 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 13:46:53,571 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 13:46:53,571 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 13:46:53,571 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 13:46:53,572 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 13:46:53,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 13:46:53,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 13:46:53,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 13:46:53,573 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 13:46:53,573 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 13:46:53,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 13:46:53,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 13:46:53,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 13:46:53,573 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 13:46:53,573 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 13:46:53,573 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 13:46:53,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 13:46:53,574 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 13:46:53,574 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 13:46:53,574 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 13:46:53,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 13:46:53,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 13:46:53,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 13:46:53,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 13:46:53,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 13:46:53,575 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 13:46:53,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 13:46:53,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 13:46:53,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 13:46:53,576 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_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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 -> 960a43474c75eeb33a7f3e9b45605c9175ab42f2 [2020-12-09 13:46:53,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 13:46:53,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 13:46:53,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 13:46:53,781 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 13:46:53,781 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 13:46:53,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2020-12-09 13:46:53,831 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/data/1caafe488/5a6482c9d94743e289ac1d6363d2b42b/FLAG11d3f4b80 [2020-12-09 13:46:54,231 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 13:46:54,231 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2020-12-09 13:46:54,244 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/data/1caafe488/5a6482c9d94743e289ac1d6363d2b42b/FLAG11d3f4b80 [2020-12-09 13:46:54,607 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/data/1caafe488/5a6482c9d94743e289ac1d6363d2b42b [2020-12-09 13:46:54,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 13:46:54,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 13:46:54,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 13:46:54,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 13:46:54,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 13:46:54,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:46:54" (1/1) ... [2020-12-09 13:46:54,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a3d29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:54, skipping insertion in model container [2020-12-09 13:46:54,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:46:54" (1/1) ... [2020-12-09 13:46:54,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 13:46:54,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 13:46:54,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 13:46:54,902 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:46:54,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1f1ba688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:54, skipping insertion in model container [2020-12-09 13:46:54,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 13:46:54,903 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2020-12-09 13:46:54,904 INFO L168 Benchmark]: Toolchain (without parser) took 292.64 ms. Allocated memory is still 134.2 MB. Free memory was 81.1 MB in the beginning and 107.1 MB in the end (delta: -26.0 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. [2020-12-09 13:46:54,905 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 134.2 MB. Free memory was 99.1 MB in the beginning and 98.9 MB in the end (delta: 161.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 13:46:54,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.50 ms. Allocated memory is still 134.2 MB. Free memory was 81.0 MB in the beginning and 107.1 MB in the end (delta: -26.1 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. [2020-12-09 13:46:54,907 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.13 ms. Allocated memory is still 134.2 MB. Free memory was 99.1 MB in the beginning and 98.9 MB in the end (delta: 161.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 290.50 ms. Allocated memory is still 134.2 MB. Free memory was 81.0 MB in the beginning and 107.1 MB in the end (delta: -26.1 MB). Peak memory consumption was 11.3 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:46:56,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 13:46:56,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 13:46:56,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 13:46:56,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 13:46:56,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 13:46:56,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 13:46:56,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 13:46:56,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 13:46:56,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 13:46:56,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 13:46:56,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 13:46:56,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 13:46:56,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 13:46:56,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 13:46:56,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 13:46:56,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 13:46:56,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 13:46:56,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 13:46:56,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 13:46:56,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 13:46:56,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 13:46:56,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 13:46:56,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 13:46:56,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 13:46:56,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 13:46:56,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 13:46:56,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 13:46:56,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 13:46:56,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 13:46:56,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 13:46:56,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 13:46:56,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 13:46:56,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 13:46:56,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 13:46:56,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 13:46:56,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 13:46:56,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 13:46:56,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 13:46:56,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 13:46:56,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 13:46:56,312 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 13:46:56,333 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 13:46:56,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 13:46:56,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 13:46:56,334 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 13:46:56,334 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 13:46:56,334 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 13:46:56,334 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 13:46:56,335 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 13:46:56,335 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 13:46:56,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 13:46:56,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 13:46:56,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 13:46:56,336 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 13:46:56,336 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 13:46:56,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 13:46:56,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 13:46:56,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 13:46:56,337 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 13:46:56,337 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 13:46:56,337 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 13:46:56,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 13:46:56,337 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 13:46:56,337 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 13:46:56,337 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 13:46:56,338 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 13:46:56,338 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 13:46:56,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 13:46:56,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 13:46:56,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 13:46:56,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 13:46:56,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 13:46:56,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 13:46:56,339 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 13:46:56,339 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 13:46:56,339 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 13:46:56,339 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 13:46:56,339 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_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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 -> 960a43474c75eeb33a7f3e9b45605c9175ab42f2 [2020-12-09 13:46:56,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 13:46:56,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 13:46:56,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 13:46:56,594 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 13:46:56,594 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 13:46:56,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2020-12-09 13:46:56,636 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/data/91d101870/f37997d3ea8b4b6a91a98e6c1d4784fe/FLAGe34cd8a00 [2020-12-09 13:46:57,080 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 13:46:57,080 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2020-12-09 13:46:57,091 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/data/91d101870/f37997d3ea8b4b6a91a98e6c1d4784fe/FLAGe34cd8a00 [2020-12-09 13:46:57,101 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/bin/utaipan/data/91d101870/f37997d3ea8b4b6a91a98e6c1d4784fe [2020-12-09 13:46:57,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 13:46:57,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 13:46:57,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 13:46:57,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 13:46:57,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 13:46:57,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:46:57" (1/1) ... [2020-12-09 13:46:57,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8706c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:57, skipping insertion in model container [2020-12-09 13:46:57,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:46:57" (1/1) ... [2020-12-09 13:46:57,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 13:46:57,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 13:46:57,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 13:46:57,436 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-12-09 13:46:57,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 13:46:57,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 13:46:57,498 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 13:46:57,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 13:46:57,615 INFO L208 MainTranslator]: Completed translation [2020-12-09 13:46:57,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:57 WrapperNode [2020-12-09 13:46:57,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 13:46:57,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 13:46:57,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 13:46:57,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 13:46:57,622 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:46:57" (1/1) ... [2020-12-09 13:46:57,646 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:46:57" (1/1) ... [2020-12-09 13:46:57,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 13:46:57,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 13:46:57,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 13:46:57,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 13:46:57,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:57" (1/1) ... [2020-12-09 13:46:57,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:57" (1/1) ... [2020-12-09 13:46:57,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:57" (1/1) ... [2020-12-09 13:46:57,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:57" (1/1) ... [2020-12-09 13:46:57,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:57" (1/1) ... [2020-12-09 13:46:57,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:57" (1/1) ... [2020-12-09 13:46:57,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:57" (1/1) ... [2020-12-09 13:46:57,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 13:46:57,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 13:46:57,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 13:46:57,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 13:46:57,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:46:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 13:46:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 13:46:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 13:46:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 13:46:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 13:46:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 13:46:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 13:46:57,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 13:46:58,119 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 13:46:58,119 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2020-12-09 13:46:58,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:46:58 BoogieIcfgContainer [2020-12-09 13:46:58,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 13:46:58,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 13:46:58,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 13:46:58,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 13:46:58,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:46:57" (1/3) ... [2020-12-09 13:46:58,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91c7518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:46:58, skipping insertion in model container [2020-12-09 13:46:58,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:46:57" (2/3) ... [2020-12-09 13:46:58,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91c7518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:46:58, skipping insertion in model container [2020-12-09 13:46:58,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:46:58" (3/3) ... [2020-12-09 13:46:58,126 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test11_2.i [2020-12-09 13:46:58,135 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 13:46:58,138 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2020-12-09 13:46:58,145 INFO L253 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2020-12-09 13:46:58,159 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 13:46:58,159 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 13:46:58,159 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 13:46:58,159 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 13:46:58,159 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 13:46:58,159 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 13:46:58,159 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 13:46:58,159 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 13:46:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2020-12-09 13:46:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 13:46:58,174 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:46:58,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 13:46:58,174 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:46:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:46:58,178 INFO L82 PathProgramCache]: Analyzing trace with hash 889508829, now seen corresponding path program 1 times [2020-12-09 13:46:58,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:46:58,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163375108] [2020-12-09 13:46:58,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:46:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:46:58,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:46:58,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:46:58,292 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:46:58,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:46:58,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163375108] [2020-12-09 13:46:58,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:46:58,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:46:58,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128873040] [2020-12-09 13:46:58,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:46:58,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:46:58,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:46:58,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:46:58,311 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2020-12-09 13:46:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:46:58,430 INFO L93 Difference]: Finished difference Result 295 states and 317 transitions. [2020-12-09 13:46:58,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:46:58,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 13:46:58,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:46:58,440 INFO L225 Difference]: With dead ends: 295 [2020-12-09 13:46:58,441 INFO L226 Difference]: Without dead ends: 287 [2020-12-09 13:46:58,441 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:46:58,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-09 13:46:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 79. [2020-12-09 13:46:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 13:46:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2020-12-09 13:46:58,471 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 6 [2020-12-09 13:46:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:46:58,471 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2020-12-09 13:46:58,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:46:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2020-12-09 13:46:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 13:46:58,471 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:46:58,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 13:46:58,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 13:46:58,673 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:46:58,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:46:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash 889568411, now seen corresponding path program 1 times [2020-12-09 13:46:58,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:46:58,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896329680] [2020-12-09 13:46:58,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:46:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:46:58,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 13:46:58,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:46:58,764 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:46:58,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:46:58,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896329680] [2020-12-09 13:46:58,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:46:58,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 13:46:58,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676427977] [2020-12-09 13:46:58,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 13:46:58,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:46:58,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 13:46:58,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 13:46:58,768 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 3 states. [2020-12-09 13:46:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:46:58,882 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2020-12-09 13:46:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 13:46:58,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-12-09 13:46:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:46:58,884 INFO L225 Difference]: With dead ends: 150 [2020-12-09 13:46:58,884 INFO L226 Difference]: Without dead ends: 149 [2020-12-09 13:46:58,884 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:46:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-12-09 13:46:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 77. [2020-12-09 13:46:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-09 13:46:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2020-12-09 13:46:58,893 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 6 [2020-12-09 13:46:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:46:58,893 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2020-12-09 13:46:58,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 13:46:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2020-12-09 13:46:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 13:46:58,894 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:46:58,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:46:59,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 13:46:59,096 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:46:59,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:46:59,098 INFO L82 PathProgramCache]: Analyzing trace with hash -592189876, now seen corresponding path program 1 times [2020-12-09 13:46:59,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:46:59,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938903829] [2020-12-09 13:46:59,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:46:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:46:59,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:46:59,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:46:59,209 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:46:59,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:46:59,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938903829] [2020-12-09 13:46:59,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:46:59,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:46:59,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305905643] [2020-12-09 13:46:59,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:46:59,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:46:59,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:46:59,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:46:59,211 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 4 states. [2020-12-09 13:46:59,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:46:59,295 INFO L93 Difference]: Finished difference Result 274 states and 291 transitions. [2020-12-09 13:46:59,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:46:59,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 13:46:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:46:59,297 INFO L225 Difference]: With dead ends: 274 [2020-12-09 13:46:59,297 INFO L226 Difference]: Without dead ends: 274 [2020-12-09 13:46:59,297 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:46:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-12-09 13:46:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 79. [2020-12-09 13:46:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 13:46:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2020-12-09 13:46:59,304 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 9 [2020-12-09 13:46:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:46:59,304 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2020-12-09 13:46:59,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:46:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2020-12-09 13:46:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 13:46:59,305 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:46:59,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:46:59,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 13:46:59,507 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:46:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:46:59,509 INFO L82 PathProgramCache]: Analyzing trace with hash -592189907, now seen corresponding path program 1 times [2020-12-09 13:46:59,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:46:59,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438447579] [2020-12-09 13:46:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:46:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:46:59,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 13:46:59,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:46:59,660 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:46:59,660 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:46:59,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:46:59,663 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:46:59,663 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:46:59,704 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:46:59,704 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:46:59,710 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:46:59,717 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:46:59,722 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:46:59,722 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2020-12-09 13:46:59,757 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:46:59,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:46:59,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438447579] [2020-12-09 13:46:59,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:46:59,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:46:59,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765635793] [2020-12-09 13:46:59,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:46:59,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:46:59,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:46:59,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:46:59,759 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 5 states. [2020-12-09 13:47:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:00,052 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2020-12-09 13:47:00,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:47:00,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 13:47:00,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:00,054 INFO L225 Difference]: With dead ends: 224 [2020-12-09 13:47:00,054 INFO L226 Difference]: Without dead ends: 224 [2020-12-09 13:47:00,055 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:47:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-12-09 13:47:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 90. [2020-12-09 13:47:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-12-09 13:47:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2020-12-09 13:47:00,060 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 9 [2020-12-09 13:47:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:00,061 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2020-12-09 13:47:00,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:47:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2020-12-09 13:47:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 13:47:00,061 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:00,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:47:00,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 13:47:00,263 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:47:00,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash -592189906, now seen corresponding path program 1 times [2020-12-09 13:47:00,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:00,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383201457] [2020-12-09 13:47:00,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:00,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 13:47:00,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:00,438 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:47:00,439 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:00,447 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:00,450 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:47:00,451 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:00,457 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:00,459 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:00,459 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 13:47:00,506 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:00,507 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:47:00,508 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:00,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:00,522 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:47:00,523 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:00,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:00,536 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:47:00,536 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:11 [2020-12-09 13:47:00,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:47:00,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:00,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383201457] [2020-12-09 13:47:00,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:00,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 13:47:00,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853172643] [2020-12-09 13:47:00,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 13:47:00,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:00,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 13:47:00,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 13:47:00,552 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 6 states. [2020-12-09 13:47:00,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:00,871 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2020-12-09 13:47:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:47:00,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-09 13:47:00,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:00,873 INFO L225 Difference]: With dead ends: 168 [2020-12-09 13:47:00,873 INFO L226 Difference]: Without dead ends: 168 [2020-12-09 13:47:00,873 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:47:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-12-09 13:47:00,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2020-12-09 13:47:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-12-09 13:47:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2020-12-09 13:47:00,878 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 9 [2020-12-09 13:47:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:00,879 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2020-12-09 13:47:00,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 13:47:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2020-12-09 13:47:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 13:47:00,879 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:00,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:47:01,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 13:47:01,081 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:47:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:01,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1182817455, now seen corresponding path program 1 times [2020-12-09 13:47:01,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:01,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636838257] [2020-12-09 13:47:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:01,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 13:47:01,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:01,339 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:47:01,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:01,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636838257] [2020-12-09 13:47:01,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:01,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:47:01,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015339605] [2020-12-09 13:47:01,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:47:01,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:01,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:47:01,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:47:01,343 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 4 states. [2020-12-09 13:47:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:01,564 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2020-12-09 13:47:01,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:47:01,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 13:47:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:01,568 INFO L225 Difference]: With dead ends: 145 [2020-12-09 13:47:01,568 INFO L226 Difference]: Without dead ends: 143 [2020-12-09 13:47:01,568 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:47:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-09 13:47:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 79. [2020-12-09 13:47:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 13:47:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2020-12-09 13:47:01,578 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 9 [2020-12-09 13:47:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:01,578 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2020-12-09 13:47:01,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:47:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2020-12-09 13:47:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 13:47:01,579 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:01,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:47:01,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 13:47:01,782 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:47:01,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:01,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1176169776, now seen corresponding path program 1 times [2020-12-09 13:47:01,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:01,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547532482] [2020-12-09 13:47:01,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:01,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 13:47:01,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:01,909 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:47:01,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:01,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547532482] [2020-12-09 13:47:01,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:01,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:47:01,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708258094] [2020-12-09 13:47:01,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:47:01,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:01,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:47:01,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:47:01,911 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 5 states. [2020-12-09 13:47:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:02,020 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2020-12-09 13:47:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 13:47:02,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-09 13:47:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:02,022 INFO L225 Difference]: With dead ends: 141 [2020-12-09 13:47:02,022 INFO L226 Difference]: Without dead ends: 141 [2020-12-09 13:47:02,022 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:47:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-12-09 13:47:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 78. [2020-12-09 13:47:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-12-09 13:47:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2020-12-09 13:47:02,025 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 10 [2020-12-09 13:47:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:02,025 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2020-12-09 13:47:02,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:47:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-12-09 13:47:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 13:47:02,025 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:02,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:47:02,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 13:47:02,227 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:47:02,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash -722750891, now seen corresponding path program 1 times [2020-12-09 13:47:02,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:02,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801183063] [2020-12-09 13:47:02,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:02,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 13:47:02,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:02,372 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:02,373 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:47:02,375 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:02,387 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-12-09 13:47:02,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:47:02,390 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:47:02,390 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 13:47:02,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:47:02,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:47:04,488 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:47:04,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:04,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801183063] [2020-12-09 13:47:04,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:04,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 13:47:04,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136390913] [2020-12-09 13:47:04,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 13:47:04,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:04,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 13:47:04,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2020-12-09 13:47:04,489 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 7 states. [2020-12-09 13:47:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:07,112 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2020-12-09 13:47:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 13:47:07,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-12-09 13:47:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:07,113 INFO L225 Difference]: With dead ends: 154 [2020-12-09 13:47:07,114 INFO L226 Difference]: Without dead ends: 150 [2020-12-09 13:47:07,114 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:47:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-12-09 13:47:07,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 73. [2020-12-09 13:47:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-09 13:47:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2020-12-09 13:47:07,116 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 12 [2020-12-09 13:47:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:07,116 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-12-09 13:47:07,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 13:47:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-12-09 13:47:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 13:47:07,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:07,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:47:07,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 13:47:07,319 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:47:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:07,320 INFO L82 PathProgramCache]: Analyzing trace with hash -493394208, now seen corresponding path program 1 times [2020-12-09 13:47:07,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:07,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761503657] [2020-12-09 13:47:07,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:07,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:47:07,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:07,428 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:47:07,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:07,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761503657] [2020-12-09 13:47:07,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:07,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:47:07,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114665068] [2020-12-09 13:47:07,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:47:07,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:07,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:47:07,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:47:07,429 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 4 states. [2020-12-09 13:47:07,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:07,475 INFO L93 Difference]: Finished difference Result 231 states and 242 transitions. [2020-12-09 13:47:07,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:47:07,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 13:47:07,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:07,477 INFO L225 Difference]: With dead ends: 231 [2020-12-09 13:47:07,477 INFO L226 Difference]: Without dead ends: 231 [2020-12-09 13:47:07,477 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:47:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-12-09 13:47:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 75. [2020-12-09 13:47:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-09 13:47:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-12-09 13:47:07,480 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 14 [2020-12-09 13:47:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:07,480 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-12-09 13:47:07,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:47:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-12-09 13:47:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 13:47:07,480 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:07,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:47:07,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 13:47:07,681 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:47:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:07,681 INFO L82 PathProgramCache]: Analyzing trace with hash -493394216, now seen corresponding path program 1 times [2020-12-09 13:47:07,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:07,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054013822] [2020-12-09 13:47:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:07,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 13:47:07,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:07,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:47:07,752 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:07,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:07,754 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:07,754 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:47:07,784 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:07,785 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:47:07,787 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:07,794 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:07,795 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:47:07,795 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:17 [2020-12-09 13:47:07,823 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:47:07,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:07,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054013822] [2020-12-09 13:47:07,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:07,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:47:07,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459541704] [2020-12-09 13:47:07,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:47:07,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:07,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:47:07,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:47:07,825 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2020-12-09 13:47:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:08,128 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2020-12-09 13:47:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:47:08,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-09 13:47:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:08,130 INFO L225 Difference]: With dead ends: 191 [2020-12-09 13:47:08,130 INFO L226 Difference]: Without dead ends: 191 [2020-12-09 13:47:08,130 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:47:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-09 13:47:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 88. [2020-12-09 13:47:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-12-09 13:47:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2020-12-09 13:47:08,133 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 14 [2020-12-09 13:47:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:08,133 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2020-12-09 13:47:08,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:47:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2020-12-09 13:47:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 13:47:08,134 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:08,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:47:08,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-09 13:47:08,336 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:47:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash -493394215, now seen corresponding path program 1 times [2020-12-09 13:47:08,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:08,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67704112] [2020-12-09 13:47:08,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:08,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 13:47:08,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:08,435 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:47:08,436 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:08,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:08,446 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:47:08,447 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:08,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:08,452 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:08,453 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 13:47:08,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 13:47:08,488 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:47:08,489 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:08,498 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:08,505 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:08,506 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:47:08,507 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:08,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:08,517 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:47:08,517 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2020-12-09 13:47:08,528 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:47:08,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:08,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67704112] [2020-12-09 13:47:08,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:08,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 13:47:08,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276502141] [2020-12-09 13:47:08,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 13:47:08,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:08,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 13:47:08,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 13:47:08,530 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 6 states. [2020-12-09 13:47:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:08,861 INFO L93 Difference]: Finished difference Result 191 states and 198 transitions. [2020-12-09 13:47:08,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 13:47:08,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-09 13:47:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:08,862 INFO L225 Difference]: With dead ends: 191 [2020-12-09 13:47:08,862 INFO L226 Difference]: Without dead ends: 191 [2020-12-09 13:47:08,862 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:47:08,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-09 13:47:08,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 116. [2020-12-09 13:47:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-12-09 13:47:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2020-12-09 13:47:08,865 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 14 [2020-12-09 13:47:08,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:08,865 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2020-12-09 13:47:08,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 13:47:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2020-12-09 13:47:08,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 13:47:08,866 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:08,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:47:09,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-09 13:47:09,067 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:47:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:09,069 INFO L82 PathProgramCache]: Analyzing trace with hash 186664154, now seen corresponding path program 1 times [2020-12-09 13:47:09,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:09,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292569223] [2020-12-09 13:47:09,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:09,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 13:47:09,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:09,174 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:47:09,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:09,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292569223] [2020-12-09 13:47:09,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:09,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:47:09,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447629359] [2020-12-09 13:47:09,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:47:09,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:09,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:47:09,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:47:09,175 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand 4 states. [2020-12-09 13:47:09,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:09,223 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2020-12-09 13:47:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:47:09,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 13:47:09,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:09,224 INFO L225 Difference]: With dead ends: 133 [2020-12-09 13:47:09,224 INFO L226 Difference]: Without dead ends: 131 [2020-12-09 13:47:09,225 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:47:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-12-09 13:47:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2020-12-09 13:47:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-09 13:47:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-12-09 13:47:09,226 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 14 [2020-12-09 13:47:09,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:09,226 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-12-09 13:47:09,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:47:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-12-09 13:47:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 13:47:09,227 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:09,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:47:09,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-12-09 13:47:09,428 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:47:09,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:09,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1886495925, now seen corresponding path program 1 times [2020-12-09 13:47:09,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:09,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651551051] [2020-12-09 13:47:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:09,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 13:47:09,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:09,715 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:47:09,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:09,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651551051] [2020-12-09 13:47:09,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:09,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:47:09,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063393209] [2020-12-09 13:47:09,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 13:47:09,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:09,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 13:47:09,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 13:47:09,716 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2020-12-09 13:47:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:09,813 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2020-12-09 13:47:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:47:09,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 13:47:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:09,814 INFO L225 Difference]: With dead ends: 74 [2020-12-09 13:47:09,814 INFO L226 Difference]: Without dead ends: 74 [2020-12-09 13:47:09,814 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:47:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-09 13:47:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-12-09 13:47:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-12-09 13:47:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2020-12-09 13:47:09,816 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 15 [2020-12-09 13:47:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:09,816 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2020-12-09 13:47:09,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 13:47:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2020-12-09 13:47:09,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 13:47:09,817 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:09,817 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:47:10,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-12-09 13:47:10,018 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:47:10,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:10,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1705438503, now seen corresponding path program 1 times [2020-12-09 13:47:10,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:10,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285184834] [2020-12-09 13:47:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:10,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 13:47:10,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:10,113 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:10,113 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:47:10,115 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:10,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:10,123 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:47:10,124 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2020-12-09 13:47:10,161 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:47:10,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:10,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285184834] [2020-12-09 13:47:10,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:10,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:47:10,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55194657] [2020-12-09 13:47:10,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:47:10,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:10,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:47:10,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:47:10,162 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 5 states. [2020-12-09 13:47:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:10,412 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2020-12-09 13:47:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:47:10,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 13:47:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:10,413 INFO L225 Difference]: With dead ends: 160 [2020-12-09 13:47:10,413 INFO L226 Difference]: Without dead ends: 160 [2020-12-09 13:47:10,413 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:47:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-09 13:47:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 77. [2020-12-09 13:47:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-09 13:47:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-12-09 13:47:10,415 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 16 [2020-12-09 13:47:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:10,416 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-12-09 13:47:10,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:47:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-12-09 13:47:10,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 13:47:10,416 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:10,416 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:47:10,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-12-09 13:47:10,618 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:47:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1705438502, now seen corresponding path program 1 times [2020-12-09 13:47:10,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:10,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012583607] [2020-12-09 13:47:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:10,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 13:47:10,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:10,733 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:47:10,733 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:10,739 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:10,742 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:47:10,742 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:10,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:10,749 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:10,749 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 13:47:10,787 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:10,788 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:47:10,789 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:10,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:10,802 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:47:10,803 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:10,812 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:10,814 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:47:10,814 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-09 13:47:10,840 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:10,841 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:47:10,842 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:10,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:10,853 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:47:10,855 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:10,863 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:10,864 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:47:10,864 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:11 [2020-12-09 13:47:10,880 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:47:10,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:10,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012583607] [2020-12-09 13:47:10,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:10,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 13:47:10,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114415349] [2020-12-09 13:47:10,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 13:47:10,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:10,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 13:47:10,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:47:10,881 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 7 states. [2020-12-09 13:47:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:11,248 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2020-12-09 13:47:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 13:47:11,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-09 13:47:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:11,249 INFO L225 Difference]: With dead ends: 133 [2020-12-09 13:47:11,249 INFO L226 Difference]: Without dead ends: 133 [2020-12-09 13:47:11,249 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:47:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-09 13:47:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 76. [2020-12-09 13:47:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-09 13:47:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2020-12-09 13:47:11,251 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 16 [2020-12-09 13:47:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:11,251 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2020-12-09 13:47:11,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 13:47:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2020-12-09 13:47:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 13:47:11,252 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:11,252 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:47:11,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-12-09 13:47:11,453 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:47:11,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:11,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1648180201, now seen corresponding path program 1 times [2020-12-09 13:47:11,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:11,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983504733] [2020-12-09 13:47:11,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:11,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 13:47:11,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:11,542 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:47:11,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:11,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983504733] [2020-12-09 13:47:11,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:11,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:47:11,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778518727] [2020-12-09 13:47:11,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:47:11,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:11,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:47:11,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:47:11,544 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 4 states. [2020-12-09 13:47:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:11,589 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2020-12-09 13:47:11,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:47:11,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-09 13:47:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:11,591 INFO L225 Difference]: With dead ends: 123 [2020-12-09 13:47:11,591 INFO L226 Difference]: Without dead ends: 123 [2020-12-09 13:47:11,591 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:47:11,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-09 13:47:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 72. [2020-12-09 13:47:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-12-09 13:47:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2020-12-09 13:47:11,593 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 16 [2020-12-09 13:47:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:11,593 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2020-12-09 13:47:11,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:47:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2020-12-09 13:47:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 13:47:11,593 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:11,594 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:47:11,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-12-09 13:47:11,795 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:47:11,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1751106330, now seen corresponding path program 1 times [2020-12-09 13:47:11,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:11,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298052420] [2020-12-09 13:47:11,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:11,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-09 13:47:11,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:11,916 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:47:11,917 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:11,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:11,923 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:11,923 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-12-09 13:47:11,940 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:47:11,941 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:11,949 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:11,950 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:11,950 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:21 [2020-12-09 13:47:12,005 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:12,006 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:47:12,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-12-09 13:47:12,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 13:47:12,009 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-09 13:47:12,048 INFO L625 ElimStorePlain]: treesize reduction 23, result has 67.6 percent of original size [2020-12-09 13:47:12,049 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 13:47:12,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:47:12,050 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:47:12,050 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:47 [2020-12-09 13:47:12,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:47:12,127 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:12,127 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 30 treesize of output 25 [2020-12-09 13:47:12,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:47:12,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:47:12,131 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:47:12,136 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:47:12,137 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:12,161 INFO L625 ElimStorePlain]: treesize reduction 8, result has 75.8 percent of original size [2020-12-09 13:47:12,163 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:47:12,163 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:27 [2020-12-09 13:47:12,206 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:47:12,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:12,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298052420] [2020-12-09 13:47:12,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:12,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 13:47:12,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101049241] [2020-12-09 13:47:12,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 13:47:12,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:12,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 13:47:12,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-12-09 13:47:12,209 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 13 states. [2020-12-09 13:47:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:12,873 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2020-12-09 13:47:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 13:47:12,873 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-12-09 13:47:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:12,874 INFO L225 Difference]: With dead ends: 83 [2020-12-09 13:47:12,874 INFO L226 Difference]: Without dead ends: 83 [2020-12-09 13:47:12,874 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:47:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-12-09 13:47:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2020-12-09 13:47:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-09 13:47:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2020-12-09 13:47:12,876 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 18 [2020-12-09 13:47:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:12,876 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2020-12-09 13:47:12,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 13:47:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2020-12-09 13:47:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 13:47:12,877 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:12,877 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:47:13,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-12-09 13:47:13,078 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:47:13,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:13,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1751106331, now seen corresponding path program 1 times [2020-12-09 13:47:13,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:13,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194517042] [2020-12-09 13:47:13,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:13,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 13:47:13,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:13,164 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:47:13,164 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,166 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,166 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,166 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:47:13,182 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_34|], 3=[|v_#valid_60|]} [2020-12-09 13:47:13,186 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:47:13,186 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,197 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,215 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,215 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:47:13,217 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,228 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,228 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2020-12-09 13:47:13,272 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:47:13,273 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,292 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:47:13,293 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,308 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,308 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:39 [2020-12-09 13:47:13,342 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_35|], 3=[|v_#valid_61|]} [2020-12-09 13:47:13,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 13:47:13,350 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:47:13,351 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,376 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,396 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,396 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:47:13,397 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,424 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:47:13,424 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:29 [2020-12-09 13:47:13,479 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,479 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:47:13,481 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 13:47:13,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 13:47:13,482 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,497 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,501 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:47:13,502 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,516 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:47:13,516 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:27 [2020-12-09 13:47:13,578 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:47:13,579 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,591 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,593 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 27 treesize of output 15 [2020-12-09 13:47:13,594 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:13,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:13,601 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:47:13,601 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:9 [2020-12-09 13:47:13,643 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:47:13,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:13,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194517042] [2020-12-09 13:47:13,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:13,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 13:47:13,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765353647] [2020-12-09 13:47:13,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 13:47:13,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:13,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 13:47:13,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-12-09 13:47:13,645 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 13 states. [2020-12-09 13:47:14,245 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-12-09 13:47:14,426 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-12-09 13:47:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:15,191 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2020-12-09 13:47:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 13:47:15,192 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-12-09 13:47:15,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:15,192 INFO L225 Difference]: With dead ends: 132 [2020-12-09 13:47:15,192 INFO L226 Difference]: Without dead ends: 132 [2020-12-09 13:47:15,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2020-12-09 13:47:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-12-09 13:47:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 73. [2020-12-09 13:47:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-09 13:47:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2020-12-09 13:47:15,195 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 18 [2020-12-09 13:47:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:15,195 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2020-12-09 13:47:15,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 13:47:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2020-12-09 13:47:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 13:47:15,196 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:15,196 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:47:15,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-12-09 13:47:15,397 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:47:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:15,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1179459719, now seen corresponding path program 1 times [2020-12-09 13:47:15,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:15,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174246140] [2020-12-09 13:47:15,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:15,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 13:47:15,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:15,479 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:15,480 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:47:15,481 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:15,492 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-12-09 13:47:15,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:47:15,493 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:47:15,493 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 13:47:15,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:47:15,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:47:21,926 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:47:21,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:21,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174246140] [2020-12-09 13:47:21,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:21,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 13:47:21,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138206743] [2020-12-09 13:47:21,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 13:47:21,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:21,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 13:47:21,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=63, Unknown=1, NotChecked=0, Total=90 [2020-12-09 13:47:21,928 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 10 states. [2020-12-09 13:47:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:28,569 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2020-12-09 13:47:28,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 13:47:28,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-09 13:47:28,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:28,570 INFO L225 Difference]: With dead ends: 80 [2020-12-09 13:47:28,570 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 13:47:28,570 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:47:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 13:47:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2020-12-09 13:47:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 13:47:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2020-12-09 13:47:28,571 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 20 [2020-12-09 13:47:28,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:28,571 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2020-12-09 13:47:28,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 13:47:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-12-09 13:47:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 13:47:28,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:28,572 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:47:28,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-12-09 13:47:28,774 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:47:28,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:28,775 INFO L82 PathProgramCache]: Analyzing trace with hash -373354461, now seen corresponding path program 1 times [2020-12-09 13:47:28,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:28,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195322783] [2020-12-09 13:47:28,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:28,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 13:47:28,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:28,868 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:47:28,869 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:28,870 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:28,871 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:28,871 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:47:28,884 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:28,885 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:47:28,886 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:28,887 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:28,888 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:28,888 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2020-12-09 13:47:28,906 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:47:28,907 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:28,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:28,919 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:47:28,920 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:28,927 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:28,928 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:28,928 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2020-12-09 13:47:28,950 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:47:28,951 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:28,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:28,961 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:28,961 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:26 [2020-12-09 13:47:29,011 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:47:29,013 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:29,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:29,048 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:29,049 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:47:29,050 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 13:47:29,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 13:47:29,051 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:29,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:29,062 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:47:29,062 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:28 [2020-12-09 13:47:29,109 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:47:29,109 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:29,117 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:29,118 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:47:29,118 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2020-12-09 13:47:29,190 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:29,190 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:47:29,191 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 13:47:29,192 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:29,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:29,194 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:47:29,194 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2020-12-09 13:47:29,250 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:29,250 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 12 treesize of output 28 [2020-12-09 13:47:29,251 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:29,262 INFO L625 ElimStorePlain]: treesize reduction 14, result has 48.1 percent of original size [2020-12-09 13:47:29,262 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:47:29,262 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2020-12-09 13:47:29,292 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:47:29,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:29,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195322783] [2020-12-09 13:47:29,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:29,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-09 13:47:29,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618223611] [2020-12-09 13:47:29,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 13:47:29,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 13:47:29,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-12-09 13:47:29,295 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 15 states. [2020-12-09 13:47:30,141 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-12-09 13:47:30,417 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-12-09 13:47:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:32,421 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2020-12-09 13:47:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 13:47:32,422 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-12-09 13:47:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:32,422 INFO L225 Difference]: With dead ends: 120 [2020-12-09 13:47:32,422 INFO L226 Difference]: Without dead ends: 120 [2020-12-09 13:47:32,423 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:47:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-12-09 13:47:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 64. [2020-12-09 13:47:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 13:47:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2020-12-09 13:47:32,424 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 23 [2020-12-09 13:47:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:32,425 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-12-09 13:47:32,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 13:47:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2020-12-09 13:47:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 13:47:32,425 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:32,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] [2020-12-09 13:47:32,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-12-09 13:47:32,627 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:47:32,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:32,628 INFO L82 PathProgramCache]: Analyzing trace with hash -373354460, now seen corresponding path program 1 times [2020-12-09 13:47:32,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:32,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271984456] [2020-12-09 13:47:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:32,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 34 conjunts are in the unsatisfiable core [2020-12-09 13:47:32,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:32,747 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:47:32,748 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:32,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:32,750 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:32,750 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:47:32,764 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:32,764 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:47:32,765 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:32,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:32,767 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:32,767 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2020-12-09 13:47:32,783 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:47:32,784 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:32,796 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:32,799 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:47:32,800 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:32,808 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:32,809 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:32,809 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2020-12-09 13:47:32,859 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:47:32,859 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:32,877 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:32,881 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:47:32,882 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:32,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:32,897 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:32,898 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:34 [2020-12-09 13:47:33,004 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:33,004 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:47:33,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 13:47:33,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 13:47:33,006 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:33,021 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:33,024 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:47:33,025 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:33,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:33,038 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:47:33,038 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:60 [2020-12-09 13:47:33,214 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 82 treesize of output 49 [2020-12-09 13:47:33,216 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:47:33,228 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:33,236 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:33,236 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:47:33,238 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 13:47:33,239 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:33,244 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:33,244 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:47:33,244 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:16 [2020-12-09 13:47:33,322 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:33,322 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:47:33,323 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:33,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:33,336 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:47:33,337 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:33,345 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:33,347 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:47:33,347 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:9 [2020-12-09 13:47:33,378 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:47:33,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:33,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271984456] [2020-12-09 13:47:33,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:33,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-09 13:47:33,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035777291] [2020-12-09 13:47:33,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 13:47:33,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:33,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 13:47:33,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-12-09 13:47:33,379 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 17 states. [2020-12-09 13:47:34,098 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2020-12-09 13:47:34,388 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-12-09 13:47:34,639 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-12-09 13:47:34,943 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-12-09 13:47:35,174 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2020-12-09 13:47:35,468 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2020-12-09 13:47:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:39,096 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2020-12-09 13:47:39,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 13:47:39,097 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2020-12-09 13:47:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:39,097 INFO L225 Difference]: With dead ends: 118 [2020-12-09 13:47:39,097 INFO L226 Difference]: Without dead ends: 118 [2020-12-09 13:47:39,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 13:47:39,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-12-09 13:47:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 63. [2020-12-09 13:47:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 13:47:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2020-12-09 13:47:39,099 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 23 [2020-12-09 13:47:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:39,099 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2020-12-09 13:47:39,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 13:47:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2020-12-09 13:47:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 13:47:39,100 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:39,100 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:47:39,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-12-09 13:47:39,301 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:47:39,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:39,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1310912065, now seen corresponding path program 1 times [2020-12-09 13:47:39,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:39,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274128388] [2020-12-09 13:47:39,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:39,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:47:39,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:39,436 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:47:39,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:39,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274128388] [2020-12-09 13:47:39,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:39,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:47:39,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643053109] [2020-12-09 13:47:39,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:47:39,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:39,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:47:39,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:47:39,438 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 4 states. [2020-12-09 13:47:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:39,469 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2020-12-09 13:47:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:47:39,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-09 13:47:39,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:39,470 INFO L225 Difference]: With dead ends: 101 [2020-12-09 13:47:39,470 INFO L226 Difference]: Without dead ends: 101 [2020-12-09 13:47:39,471 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:47:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-12-09 13:47:39,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 65. [2020-12-09 13:47:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 13:47:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2020-12-09 13:47:39,472 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 24 [2020-12-09 13:47:39,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:39,472 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2020-12-09 13:47:39,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:47:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-12-09 13:47:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 13:47:39,473 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:39,473 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:47:39,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2020-12-09 13:47:39,674 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:47:39,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:39,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1312759107, now seen corresponding path program 1 times [2020-12-09 13:47:39,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:39,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62128370] [2020-12-09 13:47:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:39,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 13:47:39,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:39,884 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:47:39,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:39,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62128370] [2020-12-09 13:47:39,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:39,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:47:39,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333925753] [2020-12-09 13:47:39,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:47:39,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:39,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:47:39,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:47:39,885 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 4 states. [2020-12-09 13:47:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:39,984 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-12-09 13:47:39,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:47:39,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-09 13:47:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:39,985 INFO L225 Difference]: With dead ends: 69 [2020-12-09 13:47:39,985 INFO L226 Difference]: Without dead ends: 69 [2020-12-09 13:47:39,985 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:47:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-12-09 13:47:39,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2020-12-09 13:47:39,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 13:47:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2020-12-09 13:47:39,986 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 24 [2020-12-09 13:47:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:39,986 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2020-12-09 13:47:39,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:47:39,987 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2020-12-09 13:47:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 13:47:39,987 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:39,987 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:47:40,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2020-12-09 13:47:40,188 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:47:40,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:40,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1312759108, now seen corresponding path program 1 times [2020-12-09 13:47:40,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:40,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684435162] [2020-12-09 13:47:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:40,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-09 13:47:40,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:40,338 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:47:40,338 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:40,345 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:40,347 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:47:40,347 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:40,352 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:40,352 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:40,352 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 13:47:40,386 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:40,386 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:47:40,387 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:40,397 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:40,400 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:47:40,401 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:40,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:40,410 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:47:40,410 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:11 [2020-12-09 13:47:40,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 13:47:40,432 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:47:40,432 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:40,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:40,456 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:40,456 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:47:40,457 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:40,469 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:40,471 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:47:40,471 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:11 [2020-12-09 13:47:40,513 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:47:40,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:40,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684435162] [2020-12-09 13:47:40,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:40,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 13:47:40,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790390494] [2020-12-09 13:47:40,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 13:47:40,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:40,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 13:47:40,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-09 13:47:40,515 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 8 states. [2020-12-09 13:47:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:40,872 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2020-12-09 13:47:40,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 13:47:40,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-09 13:47:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:40,873 INFO L225 Difference]: With dead ends: 108 [2020-12-09 13:47:40,873 INFO L226 Difference]: Without dead ends: 108 [2020-12-09 13:47:40,873 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:47:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-12-09 13:47:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 65. [2020-12-09 13:47:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 13:47:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2020-12-09 13:47:40,874 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 24 [2020-12-09 13:47:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:40,875 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2020-12-09 13:47:40,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 13:47:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-12-09 13:47:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 13:47:40,875 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:40,875 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:47:41,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2020-12-09 13:47:41,077 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:47:41,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:41,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1983617125, now seen corresponding path program 1 times [2020-12-09 13:47:41,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:41,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877548163] [2020-12-09 13:47:41,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:41,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-09 13:47:41,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:41,220 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:47:41,220 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:41,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:41,229 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:47:41,230 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:41,235 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:41,236 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:41,236 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 13:47:41,269 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:41,270 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:47:41,270 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:41,280 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:41,282 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:47:41,283 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:41,292 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:41,294 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:47:41,294 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-09 13:47:41,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 13:47:41,316 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:47:41,317 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:41,327 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:41,336 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:41,336 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:47:41,337 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:41,350 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:41,351 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:47:41,351 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-09 13:47:41,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 13:47:41,392 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:47:41,393 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:41,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:41,413 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:41,413 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:47:41,414 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:41,425 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:41,426 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:47:41,426 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2020-12-09 13:47:41,446 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:47:41,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:41,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877548163] [2020-12-09 13:47:41,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:41,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 13:47:41,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509848527] [2020-12-09 13:47:41,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 13:47:41,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:41,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 13:47:41,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-09 13:47:41,447 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 9 states. [2020-12-09 13:47:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:41,719 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-12-09 13:47:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 13:47:41,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-12-09 13:47:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:41,720 INFO L225 Difference]: With dead ends: 70 [2020-12-09 13:47:41,720 INFO L226 Difference]: Without dead ends: 70 [2020-12-09 13:47:41,720 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:47:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-12-09 13:47:41,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2020-12-09 13:47:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 13:47:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-12-09 13:47:41,721 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 25 [2020-12-09 13:47:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:41,722 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-12-09 13:47:41,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 13:47:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-12-09 13:47:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 13:47:41,722 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:41,722 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:47:41,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2020-12-09 13:47:41,923 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:47:41,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:41,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1565587052, now seen corresponding path program 1 times [2020-12-09 13:47:41,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:41,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762472534] [2020-12-09 13:47:41,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:42,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 13:47:42,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:42,071 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:47:42,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:42,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762472534] [2020-12-09 13:47:42,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:42,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:47:42,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338978575] [2020-12-09 13:47:42,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:47:42,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:42,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:47:42,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:47:42,072 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2020-12-09 13:47:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:42,185 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2020-12-09 13:47:42,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 13:47:42,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-12-09 13:47:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:42,186 INFO L225 Difference]: With dead ends: 66 [2020-12-09 13:47:42,186 INFO L226 Difference]: Without dead ends: 66 [2020-12-09 13:47:42,186 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:47:42,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-12-09 13:47:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2020-12-09 13:47:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 13:47:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-12-09 13:47:42,187 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2020-12-09 13:47:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:42,187 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-12-09 13:47:42,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:47:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-12-09 13:47:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 13:47:42,188 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:42,188 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:47:42,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2020-12-09 13:47:42,388 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:47:42,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:42,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1565587051, now seen corresponding path program 1 times [2020-12-09 13:47:42,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:42,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648487005] [2020-12-09 13:47:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:42,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-09 13:47:42,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:42,531 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:47:42,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:42,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648487005] [2020-12-09 13:47:42,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:42,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 13:47:42,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179641808] [2020-12-09 13:47:42,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 13:47:42,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:42,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 13:47:42,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-09 13:47:42,532 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 8 states. [2020-12-09 13:47:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:42,739 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-12-09 13:47:42,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 13:47:42,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-12-09 13:47:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:42,740 INFO L225 Difference]: With dead ends: 59 [2020-12-09 13:47:42,740 INFO L226 Difference]: Without dead ends: 59 [2020-12-09 13:47:42,740 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:47:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-12-09 13:47:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-12-09 13:47:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-12-09 13:47:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-12-09 13:47:42,742 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 27 [2020-12-09 13:47:42,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:42,742 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-12-09 13:47:42,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 13:47:42,742 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-12-09 13:47:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 13:47:42,742 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:42,742 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:47:42,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2020-12-09 13:47:42,944 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:47:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash 239500490, now seen corresponding path program 1 times [2020-12-09 13:47:42,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:42,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436608616] [2020-12-09 13:47:42,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:43,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 47 conjunts are in the unsatisfiable core [2020-12-09 13:47:43,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:43,211 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:47:43,212 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:43,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:43,222 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:47:43,222 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:43,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:43,229 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:43,229 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2020-12-09 13:47:43,266 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:47:43,266 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:43,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:43,273 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:47:43,274 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:43,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:43,277 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:47:43,277 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2020-12-09 13:47:43,341 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:47:43,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:43,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436608616] [2020-12-09 13:47:43,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:43,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 13:47:43,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62755881] [2020-12-09 13:47:43,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 13:47:43,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:43,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 13:47:43,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-12-09 13:47:43,342 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 12 states. [2020-12-09 13:47:43,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:43,894 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2020-12-09 13:47:43,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 13:47:43,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-12-09 13:47:43,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:43,895 INFO L225 Difference]: With dead ends: 53 [2020-12-09 13:47:43,895 INFO L226 Difference]: Without dead ends: 53 [2020-12-09 13:47:43,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2020-12-09 13:47:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-09 13:47:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-12-09 13:47:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 13:47:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-12-09 13:47:43,897 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 32 [2020-12-09 13:47:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:43,897 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-12-09 13:47:43,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 13:47:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-12-09 13:47:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 13:47:43,897 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:43,897 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:47:44,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2020-12-09 13:47:44,098 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:47:44,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:44,098 INFO L82 PathProgramCache]: Analyzing trace with hash 239500747, now seen corresponding path program 1 times [2020-12-09 13:47:44,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:44,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225465498] [2020-12-09 13:47:44,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:44,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:47:44,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:44,193 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:47:44,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:44,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225465498] [2020-12-09 13:47:44,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:44,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:47:44,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715028495] [2020-12-09 13:47:44,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:47:44,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:44,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:47:44,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:47:44,194 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 4 states. [2020-12-09 13:47:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:44,221 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-12-09 13:47:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:47:44,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-12-09 13:47:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:44,222 INFO L225 Difference]: With dead ends: 52 [2020-12-09 13:47:44,222 INFO L226 Difference]: Without dead ends: 52 [2020-12-09 13:47:44,222 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:47:44,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-09 13:47:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-12-09 13:47:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 13:47:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-12-09 13:47:44,223 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 32 [2020-12-09 13:47:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:44,223 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-12-09 13:47:44,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:47:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-12-09 13:47:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 13:47:44,223 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:44,224 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:47:44,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2020-12-09 13:47:44,425 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:47:44,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:44,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1165411295, now seen corresponding path program 1 times [2020-12-09 13:47:44,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:44,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585795324] [2020-12-09 13:47:44,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:44,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 13:47:44,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:44,699 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:47:44,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:44,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585795324] [2020-12-09 13:47:44,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:44,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:47:44,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725336349] [2020-12-09 13:47:44,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 13:47:44,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:44,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 13:47:44,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 13:47:44,700 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 6 states. [2020-12-09 13:47:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:44,810 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-12-09 13:47:44,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:47:44,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-12-09 13:47:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:44,811 INFO L225 Difference]: With dead ends: 51 [2020-12-09 13:47:44,811 INFO L226 Difference]: Without dead ends: 51 [2020-12-09 13:47:44,811 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:47:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-09 13:47:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-12-09 13:47:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-09 13:47:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-12-09 13:47:44,812 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 33 [2020-12-09 13:47:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:44,813 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-12-09 13:47:44,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 13:47:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-12-09 13:47:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 13:47:44,813 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:44,813 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:47:45,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2020-12-09 13:47:45,014 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:47:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1768011635, now seen corresponding path program 1 times [2020-12-09 13:47:45,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:45,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141482251] [2020-12-09 13:47:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:45,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:47:45,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:45,102 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:47:45,102 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:45,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:45,104 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:45,104 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:47:45,120 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:47:45,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:45,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141482251] [2020-12-09 13:47:45,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:45,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:47:45,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791880658] [2020-12-09 13:47:45,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:47:45,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:45,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:47:45,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:47:45,121 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 4 states. [2020-12-09 13:47:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:47:45,208 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2020-12-09 13:47:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:47:45,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-12-09 13:47:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:47:45,209 INFO L225 Difference]: With dead ends: 63 [2020-12-09 13:47:45,209 INFO L226 Difference]: Without dead ends: 63 [2020-12-09 13:47:45,209 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:47:45,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-09 13:47:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2020-12-09 13:47:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-12-09 13:47:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-12-09 13:47:45,210 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 34 [2020-12-09 13:47:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:47:45,211 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-12-09 13:47:45,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:47:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-12-09 13:47:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 13:47:45,211 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:47:45,211 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:47:45,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2020-12-09 13:47:45,412 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:47:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:47:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1650523386, now seen corresponding path program 1 times [2020-12-09 13:47:45,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:47:45,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380721559] [2020-12-09 13:47:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:47:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:47:45,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 13:47:45,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:47:45,741 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:47:45,741 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:45,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:45,743 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:45,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:47:45,758 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:45,758 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:47:45,759 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:45,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:47:45,761 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:47:45,761 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2020-12-09 13:47:45,799 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:47:45,800 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:47:45,808 INFO L625 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2020-12-09 13:47:45,809 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:47:45,809 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:13 [2020-12-09 13:47:45,828 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:47:45,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:47:45,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380721559] [2020-12-09 13:47:45,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:47:45,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 13:47:45,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093011546] [2020-12-09 13:47:45,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 13:47:45,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:47:45,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 13:47:45,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-09 13:47:45,830 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 8 states. [2020-12-09 13:48:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:48:00,076 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2020-12-09 13:48:00,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 13:48:00,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-12-09 13:48:00,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:48:00,077 INFO L225 Difference]: With dead ends: 71 [2020-12-09 13:48:00,077 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 13:48:00,077 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-12-09 13:48:00,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 13:48:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2020-12-09 13:48:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-09 13:48:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-12-09 13:48:00,078 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 37 [2020-12-09 13:48:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:48:00,078 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-12-09 13:48:00,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 13:48:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-12-09 13:48:00,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 13:48:00,079 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:48:00,079 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:48:00,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2020-12-09 13:48:00,280 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:48:00,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:48:00,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1956436716, now seen corresponding path program 1 times [2020-12-09 13:48:00,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:48:00,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5254644] [2020-12-09 13:48:00,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:48:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:48:00,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 13:48:00,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:48:00,442 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:48:00,442 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:48:00,443 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:48:00,444 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:48:00,444 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:48:00,457 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:48:00,457 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:48:00,458 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:48:00,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:48:00,461 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:48:00,461 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-12-09 13:48:00,492 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:48:00,493 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:48:00,494 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:48:00,499 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:48:00,500 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:48:00,500 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2020-12-09 13:48:00,612 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:48:00,613 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:48:00,626 INFO L625 ElimStorePlain]: treesize reduction 4, result has 81.0 percent of original size [2020-12-09 13:48:00,627 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:48:00,627 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2020-12-09 13:48:00,678 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:48:00,678 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:48:00,679 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:48:00,701 INFO L625 ElimStorePlain]: treesize reduction 22, result has 45.0 percent of original size [2020-12-09 13:48:00,701 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:48:00,702 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:16 [2020-12-09 13:48:00,736 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:48:00,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:48:00,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5254644] [2020-12-09 13:48:00,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:48:00,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 13:48:00,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276557299] [2020-12-09 13:48:00,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 13:48:00,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:48:00,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 13:48:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-12-09 13:48:00,737 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 14 states. [2020-12-09 13:48:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:48:21,203 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2020-12-09 13:48:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 13:48:21,203 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2020-12-09 13:48:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:48:21,204 INFO L225 Difference]: With dead ends: 69 [2020-12-09 13:48:21,204 INFO L226 Difference]: Without dead ends: 69 [2020-12-09 13:48:21,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2020-12-09 13:48:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-12-09 13:48:21,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2020-12-09 13:48:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 13:48:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-12-09 13:48:21,205 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 40 [2020-12-09 13:48:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:48:21,206 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-12-09 13:48:21,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 13:48:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-12-09 13:48:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 13:48:21,206 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:48:21,206 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:48:21,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2020-12-09 13:48:21,407 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:48:21,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:48:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash -519995891, now seen corresponding path program 1 times [2020-12-09 13:48:21,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:48:21,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315587870] [2020-12-09 13:48:21,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:48:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:48:21,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 13:48:21,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:48:21,690 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:48:21,690 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:48:21,691 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:48:21,705 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-12-09 13:48:21,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:48:21,706 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:48:21,706 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 13:48:21,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:48:21,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 13:48:35,169 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:48:35,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 13:48:35,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315587870] [2020-12-09 13:48:35,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:48:35,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 13:48:35,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891806596] [2020-12-09 13:48:35,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 13:48:35,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:48:35,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 13:48:35,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=118, Unknown=2, NotChecked=0, Total=156 [2020-12-09 13:48:35,170 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 13 states. [2020-12-09 13:48:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:48:52,350 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2020-12-09 13:48:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 13:48:52,350 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-12-09 13:48:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:48:52,350 INFO L225 Difference]: With dead ends: 68 [2020-12-09 13:48:52,350 INFO L226 Difference]: Without dead ends: 43 [2020-12-09 13:48:52,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 29 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=51, Invalid=185, Unknown=4, NotChecked=0, Total=240 [2020-12-09 13:48:52,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-09 13:48:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-12-09 13:48:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-09 13:48:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2020-12-09 13:48:52,352 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 41 [2020-12-09 13:48:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:48:52,352 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2020-12-09 13:48:52,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 13:48:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2020-12-09 13:48:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-09 13:48:52,352 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:48:52,352 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 13:48:52,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2020-12-09 13:48:52,553 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:48:52,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:48:52,554 INFO L82 PathProgramCache]: Analyzing trace with hash 430545156, now seen corresponding path program 1 times [2020-12-09 13:48:52,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:48:52,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606409913] [2020-12-09 13:48:52,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d1d1b27-4697-4ba0-a999-8adcccac2ed9/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:48:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 13:48:52,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 13:48:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 13:48:52,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 13:48:52,890 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-12-09 13:48:52,890 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 13:48:53,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2020-12-09 13:48:53,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:48:53 BoogieIcfgContainer [2020-12-09 13:48:53,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 13:48:53,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 13:48:53,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 13:48:53,138 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 13:48:53,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:46:58" (3/4) ... [2020-12-09 13:48:53,140 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 13:48:53,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 13:48:53,141 INFO L168 Benchmark]: Toolchain (without parser) took 116036.87 ms. Allocated memory was 73.4 MB in the beginning and 113.2 MB in the end (delta: 39.8 MB). Free memory was 57.0 MB in the beginning and 41.1 MB in the end (delta: 15.9 MB). Peak memory consumption was 55.5 MB. Max. memory is 16.1 GB. [2020-12-09 13:48:53,141 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 73.4 MB. Free memory is still 56.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 13:48:53,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.35 ms. Allocated memory was 73.4 MB in the beginning and 94.4 MB in the end (delta: 21.0 MB). Free memory was 56.8 MB in the beginning and 64.1 MB in the end (delta: -7.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 16.1 GB. [2020-12-09 13:48:53,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.72 ms. Allocated memory is still 94.4 MB. Free memory was 64.1 MB in the beginning and 61.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 13:48:53,142 INFO L168 Benchmark]: Boogie Preprocessor took 24.30 ms. Allocated memory is still 94.4 MB. Free memory was 61.3 MB in the beginning and 59.6 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 13:48:53,142 INFO L168 Benchmark]: RCFGBuilder took 425.44 ms. Allocated memory is still 94.4 MB. Free memory was 59.6 MB in the beginning and 55.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. [2020-12-09 13:48:53,142 INFO L168 Benchmark]: TraceAbstraction took 115016.18 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 54.4 MB in the beginning and 41.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2020-12-09 13:48:53,142 INFO L168 Benchmark]: Witness Printer took 2.45 ms. Allocated memory is still 113.2 MB. Free memory is still 41.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 13:48:53,143 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 73.4 MB. Free memory is still 56.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 511.35 ms. Allocated memory was 73.4 MB in the beginning and 94.4 MB in the end (delta: 21.0 MB). Free memory was 56.8 MB in the beginning and 64.1 MB in the end (delta: -7.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.72 ms. Allocated memory is still 94.4 MB. Free memory was 64.1 MB in the beginning and 61.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.30 ms. Allocated memory is still 94.4 MB. Free memory was 61.3 MB in the beginning and 59.6 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 425.44 ms. Allocated memory is still 94.4 MB. Free memory was 59.6 MB in the beginning and 55.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 115016.18 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 54.4 MB in the beginning and 41.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * Witness Printer took 2.45 ms. Allocated memory is still 113.2 MB. Free memory is still 41.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 822]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 822. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={15:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={15:0}] [L802] struct ldv_i2c_client *c11 = (struct ldv_i2c_client *)ldv_malloc(sizeof(struct ldv_i2c_client)); [L803] COND FALSE !(!c11) [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={15:0}] [L804-L805] struct ldv_m88ts2022_config *cfg = (struct ldv_m88ts2022_config *) ldv_malloc(sizeof(struct ldv_m88ts2022_config)); [L806] COND FALSE !(!cfg) VAL [ldv_global_msg_list={15:0}] [L807] c11->dev.platform_data = cfg VAL [ldv_global_msg_list={15:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={15:0}] [L808-L809] struct ldv_dvb_frontend *fe = (struct ldv_dvb_frontend *) ldv_malloc(sizeof(struct ldv_dvb_frontend)); [L810] COND FALSE !(!fe) VAL [ldv_global_msg_list={15:0}] [L811] cfg->fe = fe VAL [ldv_global_msg_list={15:0}] [L784] EXPR client->dev.platform_data VAL [ldv_global_msg_list={15:0}] [L784] struct ldv_m88ts2022_config *cfg = client->dev.platform_data; [L785] EXPR cfg->fe VAL [ldv_global_msg_list={15:0}] [L785] struct ldv_dvb_frontend *fe = cfg->fe; [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={15:0}] [L786] struct Data11 *priv = (struct Data11*)ldv_malloc(sizeof(struct Data11)); [L787] COND FALSE !(!priv) VAL [ldv_global_msg_list={15:0}] [L788] fe->tuner_priv = priv VAL [ldv_global_msg_list={15:0}] [L623] dev->driver_data = data VAL [ldv_global_msg_list={15:0}] [L790] return 0; VAL [ldv_global_msg_list={15:0}] [L619] EXPR dev->driver_data VAL [ldv_global_msg_list={15:0}] [L619] return dev->driver_data; [L774] return ldv_dev_get_drvdata(&dev->dev); [L796] void *priv = (struct Data11*)ldv_i2c_get_clientdata(client); [L797] COND FALSE !(\read(*priv)) VAL [ldv_global_msg_list={15:0}] [L814] free(fe) VAL [ldv_global_msg_list={15:0}] [L814] free(fe) VAL [ldv_global_msg_list={15:0}] [L814] free(fe) [L816] free(cfg) VAL [ldv_global_msg_list={15:0}] [L816] free(cfg) VAL [ldv_global_msg_list={15:0}] [L816] free(cfg) [L818] free(c11) VAL [ldv_global_msg_list={15:0}] [L818] free(c11) VAL [ldv_global_msg_list={15:0}] [L818] free(c11) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 79 locations, 29 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 114.9s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 76.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1948 SDtfs, 5763 SDslu, 3988 SDs, 0 SdLazy, 4651 SolverSat, 439 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 63.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 790 GetRequests, 439 SyntacticMatches, 41 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 35.0s 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.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 1780 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 733 NumberOfCodeBlocks, 733 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 657 ConstructedInterpolants, 136 QuantifiedInterpolants, 203490 SizeOfPredicates, 323 NumberOfNonLiveVariables, 3214 ConjunctsInSsa, 455 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...