./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-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_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 f3eebd0d696af164582cbeee8be4a910d35e299c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 f3eebd0d696af164582cbeee8be4a910d35e299c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 19:55:34,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 19:55:34,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 19:55:34,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 19:55:34,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 19:55:34,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 19:55:34,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 19:55:34,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 19:55:34,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 19:55:34,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 19:55:34,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 19:55:34,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 19:55:34,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 19:55:34,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 19:55:34,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 19:55:34,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 19:55:34,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 19:55:34,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 19:55:34,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 19:55:34,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 19:55:34,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 19:55:34,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 19:55:34,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 19:55:34,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 19:55:34,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 19:55:34,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 19:55:34,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 19:55:34,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 19:55:34,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 19:55:34,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 19:55:34,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 19:55:34,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 19:55:34,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 19:55:34,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 19:55:34,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 19:55:34,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 19:55:34,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 19:55:34,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 19:55:34,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 19:55:34,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 19:55:34,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 19:55:34,088 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 19:55:34,104 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 19:55:34,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 19:55:34,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 19:55:34,105 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 19:55:34,105 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 19:55:34,105 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 19:55:34,106 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 19:55:34,106 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 19:55:34,106 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 19:55:34,106 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 19:55:34,106 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 19:55:34,106 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 19:55:34,106 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 19:55:34,106 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 19:55:34,106 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 19:55:34,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 19:55:34,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 19:55:34,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 19:55:34,107 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 19:55:34,107 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 19:55:34,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 19:55:34,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 19:55:34,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 19:55:34,108 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 19:55:34,108 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 19:55:34,108 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 19:55:34,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 19:55:34,108 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 19:55:34,108 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 19:55:34,108 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 19:55:34,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 19:55:34,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 19:55:34,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:55:34,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 19:55:34,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 19:55:34,109 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 19:55:34,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 19:55:34,109 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 19:55:34,109 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 19:55:34,109 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_d93f7358-d610-4097-b4bf-6d7e18b38a66/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_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 -> f3eebd0d696af164582cbeee8be4a910d35e299c [2020-12-09 19:55:34,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 19:55:34,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 19:55:34,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 19:55:34,311 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 19:55:34,311 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 19:55:34,312 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2020-12-09 19:55:34,351 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/data/5bbb20a40/8d7e95f2e5b44a5787ff60e3792de55f/FLAG3b0e7335d [2020-12-09 19:55:34,798 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 19:55:34,798 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2020-12-09 19:55:34,808 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/data/5bbb20a40/8d7e95f2e5b44a5787ff60e3792de55f/FLAG3b0e7335d [2020-12-09 19:55:34,820 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/data/5bbb20a40/8d7e95f2e5b44a5787ff60e3792de55f [2020-12-09 19:55:34,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 19:55:34,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 19:55:34,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 19:55:34,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 19:55:34,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 19:55:34,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:55:34" (1/1) ... [2020-12-09 19:55:34,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7232b704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:34, skipping insertion in model container [2020-12-09 19:55:34,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:55:34" (1/1) ... [2020-12-09 19:55:34,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 19:55:34,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 19:55:35,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:55:35,056 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 19:55:35,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:55:35,126 INFO L208 MainTranslator]: Completed translation [2020-12-09 19:55:35,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:35 WrapperNode [2020-12-09 19:55:35,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 19:55:35,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 19:55:35,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 19:55:35,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 19:55:35,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:35" (1/1) ... [2020-12-09 19:55:35,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:35" (1/1) ... [2020-12-09 19:55:35,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 19:55:35,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 19:55:35,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 19:55:35,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 19:55:35,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:35" (1/1) ... [2020-12-09 19:55:35,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:35" (1/1) ... [2020-12-09 19:55:35,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:35" (1/1) ... [2020-12-09 19:55:35,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:35" (1/1) ... [2020-12-09 19:55:35,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:35" (1/1) ... [2020-12-09 19:55:35,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:35" (1/1) ... [2020-12-09 19:55:35,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:35" (1/1) ... [2020-12-09 19:55:35,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 19:55:35,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 19:55:35,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 19:55:35,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 19:55:35,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:55:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 19:55:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 19:55:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 19:55:35,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 19:55:35,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 19:55:35,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 19:55:35,625 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 19:55:35,625 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-09 19:55:35,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:55:35 BoogieIcfgContainer [2020-12-09 19:55:35,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 19:55:35,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 19:55:35,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 19:55:35,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 19:55:35,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:55:34" (1/3) ... [2020-12-09 19:55:35,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d34265e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:55:35, skipping insertion in model container [2020-12-09 19:55:35,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:55:35" (2/3) ... [2020-12-09 19:55:35,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d34265e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:55:35, skipping insertion in model container [2020-12-09 19:55:35,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:55:35" (3/3) ... [2020-12-09 19:55:35,632 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca-2.i [2020-12-09 19:55:35,642 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 19:55:35,645 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2020-12-09 19:55:35,656 INFO L253 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2020-12-09 19:55:35,675 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 19:55:35,675 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 19:55:35,675 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 19:55:35,675 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 19:55:35,675 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 19:55:35,675 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 19:55:35,676 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 19:55:35,676 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 19:55:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-12-09 19:55:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 19:55:35,694 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:35,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 19:55:35,695 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:35,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:35,700 INFO L82 PathProgramCache]: Analyzing trace with hash 154498, now seen corresponding path program 1 times [2020-12-09 19:55:35,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:35,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014592001] [2020-12-09 19:55:35,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:35,846 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 19:55:35,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014592001] [2020-12-09 19:55:35,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:35,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 19:55:35,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577169023] [2020-12-09 19:55:35,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:55:35,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:35,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:55:35,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:55:35,862 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2020-12-09 19:55:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:35,899 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-12-09 19:55:35,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:55:35,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 19:55:35,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:35,908 INFO L225 Difference]: With dead ends: 37 [2020-12-09 19:55:35,909 INFO L226 Difference]: Without dead ends: 36 [2020-12-09 19:55:35,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 19:55:35,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-09 19:55:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-12-09 19:55:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-09 19:55:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-12-09 19:55:35,937 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 3 [2020-12-09 19:55:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:35,938 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-12-09 19:55:35,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:55:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-12-09 19:55:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 19:55:35,938 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:35,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 19:55:35,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 19:55:35,938 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:35,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:35,939 INFO L82 PathProgramCache]: Analyzing trace with hash 154499, now seen corresponding path program 1 times [2020-12-09 19:55:35,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:35,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591003811] [2020-12-09 19:55:35,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:35,993 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 19:55:35,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591003811] [2020-12-09 19:55:35,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:35,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:55:35,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22216578] [2020-12-09 19:55:35,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:55:35,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:35,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:55:35,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:55:35,996 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 4 states. [2020-12-09 19:55:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:36,047 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-12-09 19:55:36,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:55:36,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2020-12-09 19:55:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:36,048 INFO L225 Difference]: With dead ends: 35 [2020-12-09 19:55:36,048 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 19:55:36,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 19:55:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 19:55:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-12-09 19:55:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-09 19:55:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2020-12-09 19:55:36,052 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 3 [2020-12-09 19:55:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:36,052 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2020-12-09 19:55:36,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:55:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-12-09 19:55:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 19:55:36,053 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:36,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 19:55:36,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 19:55:36,053 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:36,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:36,054 INFO L82 PathProgramCache]: Analyzing trace with hash 4886077, now seen corresponding path program 1 times [2020-12-09 19:55:36,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:36,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268704146] [2020-12-09 19:55:36,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:36,076 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 19:55:36,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268704146] [2020-12-09 19:55:36,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:36,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 19:55:36,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761248261] [2020-12-09 19:55:36,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:55:36,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:36,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:55:36,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:55:36,078 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 3 states. [2020-12-09 19:55:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:36,102 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-12-09 19:55:36,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:55:36,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 19:55:36,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:36,103 INFO L225 Difference]: With dead ends: 33 [2020-12-09 19:55:36,103 INFO L226 Difference]: Without dead ends: 33 [2020-12-09 19:55:36,103 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 19:55:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-09 19:55:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-12-09 19:55:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-12-09 19:55:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2020-12-09 19:55:36,106 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 4 [2020-12-09 19:55:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:36,106 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2020-12-09 19:55:36,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:55:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-12-09 19:55:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 19:55:36,106 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:36,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 19:55:36,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 19:55:36,106 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:36,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:36,107 INFO L82 PathProgramCache]: Analyzing trace with hash 4886078, now seen corresponding path program 1 times [2020-12-09 19:55:36,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:36,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607982625] [2020-12-09 19:55:36,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:36,149 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 19:55:36,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607982625] [2020-12-09 19:55:36,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:36,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:55:36,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055366178] [2020-12-09 19:55:36,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:55:36,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:36,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:55:36,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:55:36,150 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 5 states. [2020-12-09 19:55:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:36,212 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2020-12-09 19:55:36,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:55:36,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2020-12-09 19:55:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:36,213 INFO L225 Difference]: With dead ends: 62 [2020-12-09 19:55:36,213 INFO L226 Difference]: Without dead ends: 62 [2020-12-09 19:55:36,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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 19:55:36,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-12-09 19:55:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 35. [2020-12-09 19:55:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-09 19:55:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2020-12-09 19:55:36,221 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 4 [2020-12-09 19:55:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:36,221 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2020-12-09 19:55:36,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:55:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2020-12-09 19:55:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 19:55:36,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:36,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 19:55:36,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 19:55:36,222 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash 4888660, now seen corresponding path program 1 times [2020-12-09 19:55:36,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:36,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010674128] [2020-12-09 19:55:36,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:36,256 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 19:55:36,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010674128] [2020-12-09 19:55:36,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:36,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 19:55:36,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292941504] [2020-12-09 19:55:36,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:55:36,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:36,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:55:36,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:55:36,258 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2020-12-09 19:55:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:36,277 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-12-09 19:55:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:55:36,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 19:55:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:36,278 INFO L225 Difference]: With dead ends: 34 [2020-12-09 19:55:36,278 INFO L226 Difference]: Without dead ends: 34 [2020-12-09 19:55:36,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 19:55:36,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-12-09 19:55:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-12-09 19:55:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-09 19:55:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2020-12-09 19:55:36,281 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 4 [2020-12-09 19:55:36,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:36,281 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2020-12-09 19:55:36,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:55:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-12-09 19:55:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 19:55:36,281 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:36,282 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 19:55:36,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 19:55:36,282 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:36,282 INFO L82 PathProgramCache]: Analyzing trace with hash 151548454, now seen corresponding path program 1 times [2020-12-09 19:55:36,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:36,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410044977] [2020-12-09 19:55:36,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:55:36,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410044977] [2020-12-09 19:55:36,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:36,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 19:55:36,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001853463] [2020-12-09 19:55:36,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:55:36,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:36,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:55:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:55:36,314 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2020-12-09 19:55:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:36,335 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-12-09 19:55:36,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:55:36,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 19:55:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:36,336 INFO L225 Difference]: With dead ends: 33 [2020-12-09 19:55:36,336 INFO L226 Difference]: Without dead ends: 33 [2020-12-09 19:55:36,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 19:55:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-09 19:55:36,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-12-09 19:55:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-12-09 19:55:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2020-12-09 19:55:36,339 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 5 [2020-12-09 19:55:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:36,339 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2020-12-09 19:55:36,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:55:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-12-09 19:55:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 19:55:36,339 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:36,339 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2020-12-09 19:55:36,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 19:55:36,339 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:36,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:36,340 INFO L82 PathProgramCache]: Analyzing trace with hash 400626091, now seen corresponding path program 1 times [2020-12-09 19:55:36,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:36,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223263720] [2020-12-09 19:55:36,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:55:36,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223263720] [2020-12-09 19:55:36,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072381025] [2020-12-09 19:55:36,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:55:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:36,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 19:55:36,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:55:36,496 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:55:36,496 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:55:36,498 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:55:36,514 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-12-09 19:55:36,516 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:55:36,516 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-12-09 19:55:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:55:36,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:55:36,578 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:55:36,604 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:55:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:55:36,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [580702155] [2020-12-09 19:55:36,637 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2020-12-09 19:55:36,637 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:55:36,640 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:55:36,644 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:55:36,644 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:55:37,121 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:55:37,748 WARN L197 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2020-12-09 19:55:37,852 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:55:37,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:55:37,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2020-12-09 19:55:37,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140338208] [2020-12-09 19:55:37,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 19:55:37,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:37,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 19:55:37,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-12-09 19:55:37,853 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 11 states. [2020-12-09 19:55:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:37,997 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2020-12-09 19:55:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 19:55:37,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2020-12-09 19:55:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:37,998 INFO L225 Difference]: With dead ends: 83 [2020-12-09 19:55:37,998 INFO L226 Difference]: Without dead ends: 83 [2020-12-09 19:55:37,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2020-12-09 19:55:37,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-12-09 19:55:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 30. [2020-12-09 19:55:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-12-09 19:55:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2020-12-09 19:55:38,001 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 6 [2020-12-09 19:55:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:38,001 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2020-12-09 19:55:38,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 19:55:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-12-09 19:55:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 19:55:38,002 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:38,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:38,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-09 19:55:38,204 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:38,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:38,205 INFO L82 PathProgramCache]: Analyzing trace with hash -390761238, now seen corresponding path program 1 times [2020-12-09 19:55:38,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:38,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004705593] [2020-12-09 19:55:38,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:38,298 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 19:55:38,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004705593] [2020-12-09 19:55:38,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:38,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:55:38,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342107288] [2020-12-09 19:55:38,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:55:38,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:38,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:55:38,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:55:38,305 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2020-12-09 19:55:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:38,344 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-12-09 19:55:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:55:38,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-12-09 19:55:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:38,345 INFO L225 Difference]: With dead ends: 28 [2020-12-09 19:55:38,345 INFO L226 Difference]: Without dead ends: 28 [2020-12-09 19:55:38,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:55:38,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-09 19:55:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-12-09 19:55:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 19:55:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-12-09 19:55:38,347 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 7 [2020-12-09 19:55:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:38,347 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-12-09 19:55:38,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:55:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-12-09 19:55:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 19:55:38,348 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:38,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:38,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-09 19:55:38,348 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:38,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:38,348 INFO L82 PathProgramCache]: Analyzing trace with hash -390761237, now seen corresponding path program 1 times [2020-12-09 19:55:38,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:38,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289645866] [2020-12-09 19:55:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:38,400 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 19:55:38,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289645866] [2020-12-09 19:55:38,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:38,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:55:38,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886827800] [2020-12-09 19:55:38,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:55:38,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:38,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:55:38,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:55:38,402 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 5 states. [2020-12-09 19:55:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:38,446 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2020-12-09 19:55:38,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:55:38,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-12-09 19:55:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:38,447 INFO L225 Difference]: With dead ends: 40 [2020-12-09 19:55:38,447 INFO L226 Difference]: Without dead ends: 40 [2020-12-09 19:55:38,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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 19:55:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-12-09 19:55:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2020-12-09 19:55:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 19:55:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2020-12-09 19:55:38,451 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 7 [2020-12-09 19:55:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:38,451 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-12-09 19:55:38,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:55:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-12-09 19:55:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 19:55:38,452 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:38,452 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:38,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-09 19:55:38,452 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:38,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:38,452 INFO L82 PathProgramCache]: Analyzing trace with hash 771302905, now seen corresponding path program 1 times [2020-12-09 19:55:38,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:38,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990052412] [2020-12-09 19:55:38,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:38,527 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 19:55:38,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990052412] [2020-12-09 19:55:38,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:38,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:55:38,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879960084] [2020-12-09 19:55:38,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:55:38,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:38,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:55:38,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:55:38,528 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2020-12-09 19:55:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:38,555 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2020-12-09 19:55:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:55:38,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 19:55:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:38,556 INFO L225 Difference]: With dead ends: 31 [2020-12-09 19:55:38,556 INFO L226 Difference]: Without dead ends: 28 [2020-12-09 19:55:38,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:55:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-09 19:55:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-12-09 19:55:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 19:55:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-12-09 19:55:38,558 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 8 [2020-12-09 19:55:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:38,558 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-12-09 19:55:38,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:55:38,558 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-12-09 19:55:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 19:55:38,558 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:38,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:38,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-09 19:55:38,558 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:38,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:38,559 INFO L82 PathProgramCache]: Analyzing trace with hash 771305038, now seen corresponding path program 1 times [2020-12-09 19:55:38,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:38,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097146570] [2020-12-09 19:55:38,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:38,580 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 19:55:38,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097146570] [2020-12-09 19:55:38,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:38,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:55:38,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691267155] [2020-12-09 19:55:38,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:55:38,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:38,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:55:38,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:55:38,582 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2020-12-09 19:55:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:38,605 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-12-09 19:55:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:55:38,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 19:55:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:38,605 INFO L225 Difference]: With dead ends: 27 [2020-12-09 19:55:38,605 INFO L226 Difference]: Without dead ends: 27 [2020-12-09 19:55:38,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:55:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-09 19:55:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-12-09 19:55:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 19:55:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-12-09 19:55:38,607 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 8 [2020-12-09 19:55:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:38,607 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-12-09 19:55:38,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:55:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-12-09 19:55:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 19:55:38,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:38,608 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:38,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-09 19:55:38,608 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:38,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:38,608 INFO L82 PathProgramCache]: Analyzing trace with hash 771305039, now seen corresponding path program 1 times [2020-12-09 19:55:38,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:38,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703290145] [2020-12-09 19:55:38,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:38,642 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 19:55:38,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703290145] [2020-12-09 19:55:38,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:38,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:55:38,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736270242] [2020-12-09 19:55:38,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:55:38,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:55:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:55:38,643 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 5 states. [2020-12-09 19:55:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:38,701 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-12-09 19:55:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:55:38,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-09 19:55:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:38,702 INFO L225 Difference]: With dead ends: 27 [2020-12-09 19:55:38,702 INFO L226 Difference]: Without dead ends: 27 [2020-12-09 19:55:38,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:55:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-09 19:55:38,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-12-09 19:55:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 19:55:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-12-09 19:55:38,704 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 8 [2020-12-09 19:55:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:38,704 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-12-09 19:55:38,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:55:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-12-09 19:55:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 19:55:38,704 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:38,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:38,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-09 19:55:38,704 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:38,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1805198929, now seen corresponding path program 1 times [2020-12-09 19:55:38,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:38,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596954569] [2020-12-09 19:55:38,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:38,722 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 19:55:38,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596954569] [2020-12-09 19:55:38,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:38,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:55:38,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738987848] [2020-12-09 19:55:38,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:55:38,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:38,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:55:38,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:55:38,723 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2020-12-09 19:55:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:38,747 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-12-09 19:55:38,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:55:38,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 19:55:38,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:38,747 INFO L225 Difference]: With dead ends: 26 [2020-12-09 19:55:38,747 INFO L226 Difference]: Without dead ends: 26 [2020-12-09 19:55:38,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:55:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-09 19:55:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-09 19:55:38,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 19:55:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-12-09 19:55:38,749 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2020-12-09 19:55:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:38,749 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-12-09 19:55:38,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:55:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-12-09 19:55:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 19:55:38,749 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:38,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:38,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-09 19:55:38,750 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:38,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:38,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1805198928, now seen corresponding path program 1 times [2020-12-09 19:55:38,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:38,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320989247] [2020-12-09 19:55:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:38,787 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 19:55:38,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320989247] [2020-12-09 19:55:38,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:38,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:55:38,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170124655] [2020-12-09 19:55:38,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:55:38,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:38,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:55:38,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:55:38,788 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2020-12-09 19:55:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:38,834 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-12-09 19:55:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:55:38,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 19:55:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:38,834 INFO L225 Difference]: With dead ends: 31 [2020-12-09 19:55:38,834 INFO L226 Difference]: Without dead ends: 31 [2020-12-09 19:55:38,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-09 19:55:38,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-12-09 19:55:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-12-09 19:55:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 19:55:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-12-09 19:55:38,837 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2020-12-09 19:55:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:38,837 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-12-09 19:55:38,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:55:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-12-09 19:55:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 19:55:38,838 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:38,838 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:38,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-09 19:55:38,838 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:38,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:38,838 INFO L82 PathProgramCache]: Analyzing trace with hash -126600612, now seen corresponding path program 1 times [2020-12-09 19:55:38,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:38,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417950181] [2020-12-09 19:55:38,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:38,861 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 19:55:38,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417950181] [2020-12-09 19:55:38,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:38,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:55:38,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777808444] [2020-12-09 19:55:38,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:55:38,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:38,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:55:38,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:55:38,862 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2020-12-09 19:55:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:38,883 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-12-09 19:55:38,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:55:38,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-09 19:55:38,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:38,884 INFO L225 Difference]: With dead ends: 26 [2020-12-09 19:55:38,884 INFO L226 Difference]: Without dead ends: 26 [2020-12-09 19:55:38,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 19:55:38,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-09 19:55:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-09 19:55:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 19:55:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-12-09 19:55:38,885 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 11 [2020-12-09 19:55:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:38,885 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-12-09 19:55:38,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:55:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-12-09 19:55:38,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 19:55:38,886 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:38,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:38,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-09 19:55:38,886 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:38,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:38,886 INFO L82 PathProgramCache]: Analyzing trace with hash -126600611, now seen corresponding path program 1 times [2020-12-09 19:55:38,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:38,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741024430] [2020-12-09 19:55:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:38,950 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 19:55:38,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741024430] [2020-12-09 19:55:38,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:38,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:55:38,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99533949] [2020-12-09 19:55:38,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 19:55:38,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 19:55:38,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:55:38,951 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 7 states. [2020-12-09 19:55:39,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:39,057 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-12-09 19:55:39,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 19:55:39,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-12-09 19:55:39,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:39,057 INFO L225 Difference]: With dead ends: 31 [2020-12-09 19:55:39,057 INFO L226 Difference]: Without dead ends: 29 [2020-12-09 19:55:39,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-09 19:55:39,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-12-09 19:55:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2020-12-09 19:55:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-09 19:55:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-12-09 19:55:39,059 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2020-12-09 19:55:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:39,059 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-12-09 19:55:39,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 19:55:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-12-09 19:55:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 19:55:39,060 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:39,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:39,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-09 19:55:39,060 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1395691926, now seen corresponding path program 1 times [2020-12-09 19:55:39,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:39,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771265557] [2020-12-09 19:55:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:55:39,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771265557] [2020-12-09 19:55:39,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:55:39,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 19:55:39,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800364120] [2020-12-09 19:55:39,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 19:55:39,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:39,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 19:55:39,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-09 19:55:39,154 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2020-12-09 19:55:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:39,258 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-12-09 19:55:39,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 19:55:39,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-12-09 19:55:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:39,258 INFO L225 Difference]: With dead ends: 37 [2020-12-09 19:55:39,258 INFO L226 Difference]: Without dead ends: 27 [2020-12-09 19:55:39,259 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-12-09 19:55:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-09 19:55:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-12-09 19:55:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 19:55:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-12-09 19:55:39,260 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2020-12-09 19:55:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:39,260 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-12-09 19:55:39,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 19:55:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-12-09 19:55:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 19:55:39,260 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:39,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:39,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-09 19:55:39,261 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:39,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:39,261 INFO L82 PathProgramCache]: Analyzing trace with hash 576312871, now seen corresponding path program 1 times [2020-12-09 19:55:39,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:39,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251240982] [2020-12-09 19:55:39,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:55:39,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251240982] [2020-12-09 19:55:39,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002248493] [2020-12-09 19:55:39,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:55:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:39,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 19:55:39,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:55:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:55:39,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:55:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:55:39,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [283239881] [2020-12-09 19:55:39,602 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2020-12-09 19:55:39,602 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:55:39,602 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:55:39,602 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:55:39,602 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:55:39,977 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:55:40,017 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:55:40,401 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:55:40,675 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2020-12-09 19:55:41,094 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2020-12-09 19:55:41,453 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2020-12-09 19:55:41,818 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2020-12-09 19:55:42,445 WARN L197 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 123 [2020-12-09 19:55:43,139 WARN L197 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 128 [2020-12-09 19:55:44,347 WARN L197 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 159 DAG size of output: 139 [2020-12-09 19:55:45,604 WARN L197 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 168 DAG size of output: 142 [2020-12-09 19:55:46,466 WARN L197 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 141 [2020-12-09 19:55:47,338 WARN L197 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 143 [2020-12-09 19:55:47,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:55:47,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 5, 5] total 28 [2020-12-09 19:55:47,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439941902] [2020-12-09 19:55:47,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 19:55:47,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 19:55:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2020-12-09 19:55:47,341 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 13 states. [2020-12-09 19:55:47,546 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2020-12-09 19:55:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:47,730 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-12-09 19:55:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 19:55:47,731 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-12-09 19:55:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:47,731 INFO L225 Difference]: With dead ends: 36 [2020-12-09 19:55:47,731 INFO L226 Difference]: Without dead ends: 28 [2020-12-09 19:55:47,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2020-12-09 19:55:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-09 19:55:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-12-09 19:55:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 19:55:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-12-09 19:55:47,733 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2020-12-09 19:55:47,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:47,733 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-12-09 19:55:47,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 19:55:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-12-09 19:55:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 19:55:47,733 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:47,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:47,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-12-09 19:55:47,935 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:47,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1833901542, now seen corresponding path program 1 times [2020-12-09 19:55:47,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:47,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661928881] [2020-12-09 19:55:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:55:48,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661928881] [2020-12-09 19:55:48,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191883604] [2020-12-09 19:55:48,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:55:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:48,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 19:55:48,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:55:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:55:48,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:55:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:55:48,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [777646798] [2020-12-09 19:55:48,183 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 19:55:48,183 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:55:48,183 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:55:48,184 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:55:48,184 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:55:48,303 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:55:48,316 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:55:48,862 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:55:49,185 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 89 [2020-12-09 19:55:49,913 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-12-09 19:55:50,471 WARN L197 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 119 [2020-12-09 19:55:51,017 WARN L197 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2020-12-09 19:55:51,200 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2020-12-09 19:55:51,585 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:55:51,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:55:51,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2020-12-09 19:55:51,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700023453] [2020-12-09 19:55:51,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 19:55:51,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:51,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 19:55:51,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2020-12-09 19:55:51,587 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 17 states. [2020-12-09 19:55:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:51,736 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-12-09 19:55:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 19:55:51,736 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2020-12-09 19:55:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:51,736 INFO L225 Difference]: With dead ends: 35 [2020-12-09 19:55:51,736 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 19:55:51,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=217, Invalid=1115, Unknown=0, NotChecked=0, Total=1332 [2020-12-09 19:55:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 19:55:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2020-12-09 19:55:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-09 19:55:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-12-09 19:55:51,739 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 17 [2020-12-09 19:55:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:51,739 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-12-09 19:55:51,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 19:55:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-12-09 19:55:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 19:55:51,740 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:51,740 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:51,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:55:51,942 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:51,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:51,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1016371456, now seen corresponding path program 1 times [2020-12-09 19:55:51,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:51,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620023356] [2020-12-09 19:55:51,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:55:52,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620023356] [2020-12-09 19:55:52,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052310015] [2020-12-09 19:55:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:55:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:52,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-09 19:55:52,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:55:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:55:52,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:55:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:55:52,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1391819932] [2020-12-09 19:55:52,232 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 19:55:52,232 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:55:52,232 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:55:52,232 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:55:52,232 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:55:52,515 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:55:52,532 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:55:52,969 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:55:53,335 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 98 [2020-12-09 19:55:53,580 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2020-12-09 19:55:54,226 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-12-09 19:55:54,761 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 119 [2020-12-09 19:55:55,399 WARN L197 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 128 [2020-12-09 19:55:55,594 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2020-12-09 19:55:55,953 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:55:55,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:55:55,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2020-12-09 19:55:55,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520714658] [2020-12-09 19:55:55,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 19:55:55,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:55:55,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 19:55:55,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2020-12-09 19:55:55,954 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 18 states. [2020-12-09 19:55:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:55:56,139 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-12-09 19:55:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 19:55:56,140 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2020-12-09 19:55:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:55:56,140 INFO L225 Difference]: With dead ends: 32 [2020-12-09 19:55:56,140 INFO L226 Difference]: Without dead ends: 32 [2020-12-09 19:55:56,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 19:55:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-09 19:55:56,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-12-09 19:55:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-12-09 19:55:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-12-09 19:55:56,142 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2020-12-09 19:55:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:55:56,142 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-12-09 19:55:56,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 19:55:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-12-09 19:55:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 19:55:56,142 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:55:56,142 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:55:56,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:55:56,344 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:55:56,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:55:56,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1775392223, now seen corresponding path program 1 times [2020-12-09 19:55:56,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:55:56,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042042019] [2020-12-09 19:55:56,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:55:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:55:56,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042042019] [2020-12-09 19:55:56,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136658776] [2020-12-09 19:55:56,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:55:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:55:56,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-09 19:55:56,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:55:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:55:56,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:55:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:55:56,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [899704612] [2020-12-09 19:55:56,823 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 19:55:56,823 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:55:56,823 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:55:56,823 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:55:56,823 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:55:56,914 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:55:57,374 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:55:57,554 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2020-12-09 19:55:58,375 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-12-09 19:55:58,981 WARN L197 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 119 [2020-12-09 19:55:59,628 WARN L197 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2020-12-09 19:55:59,854 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2020-12-09 19:56:00,280 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:56:00,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:56:00,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2020-12-09 19:56:00,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802516940] [2020-12-09 19:56:00,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 19:56:00,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:56:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 19:56:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2020-12-09 19:56:00,281 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 25 states. [2020-12-09 19:56:00,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:00,853 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-12-09 19:56:00,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 19:56:00,854 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2020-12-09 19:56:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:00,854 INFO L225 Difference]: With dead ends: 35 [2020-12-09 19:56:00,854 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 19:56:00,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=339, Invalid=2013, Unknown=0, NotChecked=0, Total=2352 [2020-12-09 19:56:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 19:56:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2020-12-09 19:56:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-09 19:56:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-12-09 19:56:00,856 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2020-12-09 19:56:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:00,856 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-12-09 19:56:00,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 19:56:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-12-09 19:56:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 19:56:00,857 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:00,857 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:01,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable194 [2020-12-09 19:56:01,058 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:01,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:01,059 INFO L82 PathProgramCache]: Analyzing trace with hash 797407244, now seen corresponding path program 1 times [2020-12-09 19:56:01,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:56:01,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218233234] [2020-12-09 19:56:01,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:56:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:56:01,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218233234] [2020-12-09 19:56:01,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848934364] [2020-12-09 19:56:01,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:56:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:01,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-09 19:56:01,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:56:01,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:56:01,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [329238831] [2020-12-09 19:56:01,371 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 19:56:01,371 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:56:01,372 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:56:01,372 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:56:01,372 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:56:01,471 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:56:01,966 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:56:02,156 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2020-12-09 19:56:02,955 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-12-09 19:56:03,521 WARN L197 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 119 [2020-12-09 19:56:04,176 WARN L197 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2020-12-09 19:56:04,373 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2020-12-09 19:56:05,090 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:56:05,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:56:05,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2020-12-09 19:56:05,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661702045] [2020-12-09 19:56:05,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-09 19:56:05,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:56:05,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-09 19:56:05,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 19:56:05,091 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 20 states. [2020-12-09 19:56:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:05,299 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-12-09 19:56:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 19:56:05,299 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2020-12-09 19:56:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:05,300 INFO L225 Difference]: With dead ends: 38 [2020-12-09 19:56:05,300 INFO L226 Difference]: Without dead ends: 36 [2020-12-09 19:56:05,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2020-12-09 19:56:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-09 19:56:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2020-12-09 19:56:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-12-09 19:56:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-12-09 19:56:05,302 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2020-12-09 19:56:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:05,302 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-12-09 19:56:05,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-09 19:56:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-12-09 19:56:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 19:56:05,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:05,302 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:05,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:56:05,503 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:05,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:05,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1812593753, now seen corresponding path program 2 times [2020-12-09 19:56:05,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:56:05,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140649016] [2020-12-09 19:56:05,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:56:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:56:05,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140649016] [2020-12-09 19:56:05,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198331570] [2020-12-09 19:56:05,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:56:05,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 19:56:05,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 19:56:05,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 59 conjunts are in the unsatisfiable core [2020-12-09 19:56:05,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:56:06,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:06,557 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2020-12-09 19:56:06,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1231216522] [2020-12-09 19:56:06,558 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 19:56:06,558 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:56:06,559 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:56:06,559 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:56:06,559 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:56:06,567 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@693c6275 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:568) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:441) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:239) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:313) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:153) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 19:56:06,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-09 19:56:06,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-12-09 19:56:06,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774484877] [2020-12-09 19:56:06,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 19:56:06,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:56:06,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 19:56:06,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2020-12-09 19:56:06,569 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 12 states. [2020-12-09 19:56:06,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-09 19:56:06,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:56:06,771 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@693c6275 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:356) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:204) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:61) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:63) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 19:56:06,777 INFO L168 Benchmark]: Toolchain (without parser) took 31953.17 ms. Allocated memory was 88.1 MB in the beginning and 188.7 MB in the end (delta: 100.7 MB). Free memory was 57.3 MB in the beginning and 103.6 MB in the end (delta: -46.2 MB). Peak memory consumption was 57.0 MB. Max. memory is 16.1 GB. [2020-12-09 19:56:06,778 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 69.2 MB. Free memory was 34.3 MB in the beginning and 34.2 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:56:06,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.16 ms. Allocated memory is still 88.1 MB. Free memory was 57.1 MB in the beginning and 62.4 MB in the end (delta: -5.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:56:06,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.60 ms. Allocated memory is still 88.1 MB. Free memory was 62.1 MB in the beginning and 60.5 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:56:06,778 INFO L168 Benchmark]: Boogie Preprocessor took 22.02 ms. Allocated memory is still 88.1 MB. Free memory was 60.5 MB in the beginning and 59.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:56:06,779 INFO L168 Benchmark]: RCFGBuilder took 433.31 ms. Allocated memory is still 88.1 MB. Free memory was 58.8 MB in the beginning and 57.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 16.1 GB. [2020-12-09 19:56:06,779 INFO L168 Benchmark]: TraceAbstraction took 31147.67 ms. Allocated memory was 88.1 MB in the beginning and 188.7 MB in the end (delta: 100.7 MB). Free memory was 56.5 MB in the beginning and 103.6 MB in the end (delta: -47.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 16.1 GB. [2020-12-09 19:56:06,780 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 69.2 MB. Free memory was 34.3 MB in the beginning and 34.2 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 303.16 ms. Allocated memory is still 88.1 MB. Free memory was 57.1 MB in the beginning and 62.4 MB in the end (delta: -5.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.60 ms. Allocated memory is still 88.1 MB. Free memory was 62.1 MB in the beginning and 60.5 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.02 ms. Allocated memory is still 88.1 MB. Free memory was 60.5 MB in the beginning and 59.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 433.31 ms. Allocated memory is still 88.1 MB. Free memory was 58.8 MB in the beginning and 57.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 31147.67 ms. Allocated memory was 88.1 MB in the beginning and 188.7 MB in the end (delta: 100.7 MB). Free memory was 56.5 MB in the beginning and 103.6 MB in the end (delta: -47.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@693c6275 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@693c6275: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) 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 19:56:08,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 19:56:08,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 19:56:08,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 19:56:08,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 19:56:08,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 19:56:08,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 19:56:08,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 19:56:08,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 19:56:08,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 19:56:08,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 19:56:08,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 19:56:08,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 19:56:08,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 19:56:08,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 19:56:08,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 19:56:08,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 19:56:08,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 19:56:08,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 19:56:08,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 19:56:08,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 19:56:08,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 19:56:08,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 19:56:08,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 19:56:08,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 19:56:08,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 19:56:08,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 19:56:08,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 19:56:08,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 19:56:08,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 19:56:08,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 19:56:08,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 19:56:08,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 19:56:08,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 19:56:08,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 19:56:08,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 19:56:08,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 19:56:08,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 19:56:08,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 19:56:08,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 19:56:08,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 19:56:08,369 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 19:56:08,395 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 19:56:08,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 19:56:08,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 19:56:08,396 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 19:56:08,396 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 19:56:08,396 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 19:56:08,396 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 19:56:08,397 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 19:56:08,397 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 19:56:08,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 19:56:08,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 19:56:08,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 19:56:08,398 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 19:56:08,398 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 19:56:08,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 19:56:08,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 19:56:08,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 19:56:08,398 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 19:56:08,398 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 19:56:08,398 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 19:56:08,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 19:56:08,399 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 19:56:08,399 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 19:56:08,399 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 19:56:08,399 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 19:56:08,399 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 19:56:08,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 19:56:08,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 19:56:08,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 19:56:08,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:56:08,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 19:56:08,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 19:56:08,400 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 19:56:08,400 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 19:56:08,400 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 19:56:08,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 19:56:08,401 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_d93f7358-d610-4097-b4bf-6d7e18b38a66/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_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 -> f3eebd0d696af164582cbeee8be4a910d35e299c [2020-12-09 19:56:08,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 19:56:08,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 19:56:08,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 19:56:08,638 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 19:56:08,638 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 19:56:08,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2020-12-09 19:56:08,679 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/data/9672f69b4/3f37afa7915e4fb1935b9e39376d2697/FLAGef7eea560 [2020-12-09 19:56:09,112 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 19:56:09,113 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2020-12-09 19:56:09,124 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/data/9672f69b4/3f37afa7915e4fb1935b9e39376d2697/FLAGef7eea560 [2020-12-09 19:56:09,137 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/data/9672f69b4/3f37afa7915e4fb1935b9e39376d2697 [2020-12-09 19:56:09,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 19:56:09,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 19:56:09,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 19:56:09,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 19:56:09,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 19:56:09,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:56:09" (1/1) ... [2020-12-09 19:56:09,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b992217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09, skipping insertion in model container [2020-12-09 19:56:09,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:56:09" (1/1) ... [2020-12-09 19:56:09,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 19:56:09,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 19:56:09,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:56:09,404 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 19:56:09,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:56:09,499 INFO L208 MainTranslator]: Completed translation [2020-12-09 19:56:09,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09 WrapperNode [2020-12-09 19:56:09,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 19:56:09,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 19:56:09,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 19:56:09,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 19:56:09,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09" (1/1) ... [2020-12-09 19:56:09,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09" (1/1) ... [2020-12-09 19:56:09,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 19:56:09,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 19:56:09,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 19:56:09,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 19:56:09,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09" (1/1) ... [2020-12-09 19:56:09,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09" (1/1) ... [2020-12-09 19:56:09,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09" (1/1) ... [2020-12-09 19:56:09,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09" (1/1) ... [2020-12-09 19:56:09,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09" (1/1) ... [2020-12-09 19:56:09,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09" (1/1) ... [2020-12-09 19:56:09,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09" (1/1) ... [2020-12-09 19:56:09,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 19:56:09,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 19:56:09,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 19:56:09,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 19:56:09,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:09,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-12-09 19:56:09,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 19:56:09,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-12-09 19:56:09,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 19:56:09,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 19:56:09,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 19:56:09,980 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 19:56:09,980 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-09 19:56:09,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:56:09 BoogieIcfgContainer [2020-12-09 19:56:09,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 19:56:09,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 19:56:09,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 19:56:09,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 19:56:09,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:56:09" (1/3) ... [2020-12-09 19:56:09,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdab295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:56:09, skipping insertion in model container [2020-12-09 19:56:09,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:56:09" (2/3) ... [2020-12-09 19:56:09,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdab295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:56:09, skipping insertion in model container [2020-12-09 19:56:09,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:56:09" (3/3) ... [2020-12-09 19:56:09,987 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca-2.i [2020-12-09 19:56:09,996 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 19:56:09,999 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2020-12-09 19:56:10,006 INFO L253 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2020-12-09 19:56:10,020 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 19:56:10,020 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 19:56:10,020 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 19:56:10,021 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 19:56:10,021 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 19:56:10,021 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 19:56:10,021 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 19:56:10,021 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 19:56:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2020-12-09 19:56:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 19:56:10,034 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:10,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:10,035 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:10,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:10,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2020-12-09 19:56:10,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:10,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956964921] [2020-12-09 19:56:10,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:10,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:56:10,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:10,160 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 19:56:10,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:10,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956964921] [2020-12-09 19:56:10,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:10,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:56:10,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348833534] [2020-12-09 19:56:10,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:56:10,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:10,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:56:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:56:10,175 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 4 states. [2020-12-09 19:56:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:10,222 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-12-09 19:56:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:56:10,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-12-09 19:56:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:10,230 INFO L225 Difference]: With dead ends: 100 [2020-12-09 19:56:10,230 INFO L226 Difference]: Without dead ends: 96 [2020-12-09 19:56:10,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:56:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-12-09 19:56:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 55. [2020-12-09 19:56:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 19:56:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2020-12-09 19:56:10,255 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 7 [2020-12-09 19:56:10,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:10,255 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2020-12-09 19:56:10,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:56:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2020-12-09 19:56:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 19:56:10,256 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:10,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:10,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 19:56:10,457 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:10,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:10,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2020-12-09 19:56:10,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:10,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767161336] [2020-12-09 19:56:10,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:10,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 19:56:10,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:10,586 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-12-09 19:56:10,586 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 19 treesize of output 18 [2020-12-09 19:56:10,589 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:10,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:10,601 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 19:56:10,601 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2020-12-09 19:56:10,623 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 19:56:10,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:10,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767161336] [2020-12-09 19:56:10,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:10,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:56:10,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983341346] [2020-12-09 19:56:10,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:56:10,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:10,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:56:10,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:56:10,626 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 3 states. [2020-12-09 19:56:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:10,713 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2020-12-09 19:56:10,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:56:10,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 19:56:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:10,714 INFO L225 Difference]: With dead ends: 53 [2020-12-09 19:56:10,714 INFO L226 Difference]: Without dead ends: 53 [2020-12-09 19:56:10,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 19:56:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-09 19:56:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-12-09 19:56:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 19:56:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2020-12-09 19:56:10,721 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 7 [2020-12-09 19:56:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:10,722 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2020-12-09 19:56:10,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:56:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2020-12-09 19:56:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 19:56:10,722 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:10,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:10,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 19:56:10,925 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:10,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2020-12-09 19:56:10,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:10,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533264196] [2020-12-09 19:56:10,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:11,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:56:11,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:11,091 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_31|]} [2020-12-09 19:56:11,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:11,097 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 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:11,098 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:11,112 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:11,118 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:56:11,120 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:11,133 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:11,137 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:11,137 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2020-12-09 19:56:11,151 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 19:56:11,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:11,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533264196] [2020-12-09 19:56:11,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:11,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:56:11,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091345572] [2020-12-09 19:56:11,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:56:11,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:11,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:56:11,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:56:11,154 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2020-12-09 19:56:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:11,371 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2020-12-09 19:56:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:56:11,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-12-09 19:56:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:11,373 INFO L225 Difference]: With dead ends: 97 [2020-12-09 19:56:11,373 INFO L226 Difference]: Without dead ends: 97 [2020-12-09 19:56:11,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 19:56:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-12-09 19:56:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2020-12-09 19:56:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 19:56:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2020-12-09 19:56:11,380 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 7 [2020-12-09 19:56:11,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:11,381 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2020-12-09 19:56:11,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:56:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2020-12-09 19:56:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 19:56:11,381 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:11,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:11,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 19:56:11,583 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:11,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash -533876960, now seen corresponding path program 1 times [2020-12-09 19:56:11,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:11,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341356378] [2020-12-09 19:56:11,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:11,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 19:56:11,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:11,705 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|v_#valid_32|]} [2020-12-09 19:56:11,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:11,710 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 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:11,711 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:11,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:11,726 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:56:11,727 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:11,740 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:11,742 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 19:56:11,742 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2020-12-09 19:56:11,755 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 19:56:11,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:11,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341356378] [2020-12-09 19:56:11,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:11,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:56:11,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159478903] [2020-12-09 19:56:11,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:56:11,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:11,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:56:11,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:56:11,757 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 4 states. [2020-12-09 19:56:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:11,842 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2020-12-09 19:56:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:56:11,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 19:56:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:11,843 INFO L225 Difference]: With dead ends: 94 [2020-12-09 19:56:11,844 INFO L226 Difference]: Without dead ends: 94 [2020-12-09 19:56:11,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:56:11,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-12-09 19:56:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2020-12-09 19:56:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 19:56:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2020-12-09 19:56:11,848 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 9 [2020-12-09 19:56:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:11,848 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2020-12-09 19:56:11,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:56:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2020-12-09 19:56:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 19:56:11,849 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:11,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:12,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 19:56:12,051 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:12,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:12,052 INFO L82 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2020-12-09 19:56:12,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:12,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003581760] [2020-12-09 19:56:12,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:12,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:56:12,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:12,159 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 19:56:12,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:12,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003581760] [2020-12-09 19:56:12,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:12,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:56:12,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114876790] [2020-12-09 19:56:12,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:56:12,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:12,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:56:12,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:56:12,161 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 4 states. [2020-12-09 19:56:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:12,215 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2020-12-09 19:56:12,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:56:12,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 19:56:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:12,217 INFO L225 Difference]: With dead ends: 109 [2020-12-09 19:56:12,217 INFO L226 Difference]: Without dead ends: 109 [2020-12-09 19:56:12,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:56:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-12-09 19:56:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 74. [2020-12-09 19:56:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-12-09 19:56:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2020-12-09 19:56:12,224 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 9 [2020-12-09 19:56:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:12,224 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2020-12-09 19:56:12,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:56:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2020-12-09 19:56:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 19:56:12,225 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:12,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:12,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 19:56:12,427 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:12,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:12,429 INFO L82 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2020-12-09 19:56:12,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:12,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23743860] [2020-12-09 19:56:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:12,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:56:12,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:12,529 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-12-09 19:56:12,530 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 1 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:12,531 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:12,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:12,535 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 19:56:12,535 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:13 [2020-12-09 19:56:12,545 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 19:56:12,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:12,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23743860] [2020-12-09 19:56:12,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:12,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:56:12,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093583800] [2020-12-09 19:56:12,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:56:12,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:12,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:56:12,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:56:12,546 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 3 states. [2020-12-09 19:56:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:12,601 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2020-12-09 19:56:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:56:12,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-09 19:56:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:12,602 INFO L225 Difference]: With dead ends: 72 [2020-12-09 19:56:12,602 INFO L226 Difference]: Without dead ends: 72 [2020-12-09 19:56:12,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 19:56:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-12-09 19:56:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-12-09 19:56:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-12-09 19:56:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2020-12-09 19:56:12,606 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 9 [2020-12-09 19:56:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:12,606 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2020-12-09 19:56:12,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:56:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2020-12-09 19:56:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 19:56:12,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:12,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:12,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 19:56:12,809 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:12,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:12,810 INFO L82 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2020-12-09 19:56:12,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:12,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608590009] [2020-12-09 19:56:12,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:12,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 19:56:12,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:12,879 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:12,879 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:56:12,881 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:12,904 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 19:56:12,906 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:12,906 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2020-12-09 19:56:12,932 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 19:56:12,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:12,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608590009] [2020-12-09 19:56:12,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:12,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:56:12,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078450638] [2020-12-09 19:56:12,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:56:12,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:12,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:56:12,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:56:12,934 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 5 states. [2020-12-09 19:56:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:13,119 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2020-12-09 19:56:13,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:56:13,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 19:56:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:13,121 INFO L225 Difference]: With dead ends: 113 [2020-12-09 19:56:13,121 INFO L226 Difference]: Without dead ends: 113 [2020-12-09 19:56:13,122 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 19:56:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-12-09 19:56:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 76. [2020-12-09 19:56:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-09 19:56:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2020-12-09 19:56:13,127 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 9 [2020-12-09 19:56:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:13,128 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2020-12-09 19:56:13,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:56:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2020-12-09 19:56:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 19:56:13,128 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:13,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:13,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 19:56:13,330 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:13,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1241130402, now seen corresponding path program 1 times [2020-12-09 19:56:13,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:13,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057391779] [2020-12-09 19:56:13,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:13,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:56:13,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:13,401 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_25|], 1=[|v_#valid_34|]} [2020-12-09 19:56:13,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:13,407 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 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:13,408 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:13,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:13,430 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:56:13,432 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:13,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:13,449 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 19:56:13,449 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 19:56:13,486 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 19:56:13,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:13,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057391779] [2020-12-09 19:56:13,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:13,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:56:13,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309977398] [2020-12-09 19:56:13,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:56:13,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:13,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:56:13,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:56:13,488 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand 5 states. [2020-12-09 19:56:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:13,728 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2020-12-09 19:56:13,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:56:13,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 19:56:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:13,730 INFO L225 Difference]: With dead ends: 121 [2020-12-09 19:56:13,730 INFO L226 Difference]: Without dead ends: 121 [2020-12-09 19:56:13,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 19:56:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-09 19:56:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 76. [2020-12-09 19:56:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-09 19:56:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2020-12-09 19:56:13,735 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 9 [2020-12-09 19:56:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:13,735 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2020-12-09 19:56:13,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:56:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2020-12-09 19:56:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 19:56:13,736 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:13,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:13,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 19:56:13,938 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:13,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:13,939 INFO L82 PathProgramCache]: Analyzing trace with hash 629683418, now seen corresponding path program 1 times [2020-12-09 19:56:13,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:13,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165797525] [2020-12-09 19:56:13,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:14,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 19:56:14,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:14,104 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:14,105 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:56:14,106 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:14,128 INFO L625 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-12-09 19:56:14,130 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:14,130 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-12-09 19:56:14,142 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 19:56:14,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:14,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165797525] [2020-12-09 19:56:14,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:14,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:56:14,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231198430] [2020-12-09 19:56:14,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:56:14,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:14,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:56:14,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:56:14,144 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand 4 states. [2020-12-09 19:56:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:14,281 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2020-12-09 19:56:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:56:14,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 19:56:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:14,283 INFO L225 Difference]: With dead ends: 109 [2020-12-09 19:56:14,283 INFO L226 Difference]: Without dead ends: 109 [2020-12-09 19:56:14,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:56:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-12-09 19:56:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2020-12-09 19:56:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 19:56:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2020-12-09 19:56:14,286 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 10 [2020-12-09 19:56:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:14,286 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2020-12-09 19:56:14,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:56:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2020-12-09 19:56:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 19:56:14,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:14,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:14,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 19:56:14,488 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:14,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:14,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1890276516, now seen corresponding path program 1 times [2020-12-09 19:56:14,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:14,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82880403] [2020-12-09 19:56:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:14,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:56:14,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:14,597 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:14,597 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:56:14,598 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:14,625 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 19:56:14,627 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:14,627 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 19:56:14,669 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 19:56:14,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:14,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82880403] [2020-12-09 19:56:14,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:14,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:56:14,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460071977] [2020-12-09 19:56:14,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:56:14,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:14,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:56:14,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:56:14,670 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 6 states. [2020-12-09 19:56:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:14,892 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2020-12-09 19:56:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:56:14,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 19:56:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:14,894 INFO L225 Difference]: With dead ends: 114 [2020-12-09 19:56:14,894 INFO L226 Difference]: Without dead ends: 114 [2020-12-09 19:56:14,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 19:56:14,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-12-09 19:56:14,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 75. [2020-12-09 19:56:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-09 19:56:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2020-12-09 19:56:14,898 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 10 [2020-12-09 19:56:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:14,898 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2020-12-09 19:56:14,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:56:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2020-12-09 19:56:14,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 19:56:14,899 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:14,899 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:15,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-09 19:56:15,101 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:15,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2020-12-09 19:56:15,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:15,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868389050] [2020-12-09 19:56:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:15,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 19:56:15,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:15,175 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_35|]} [2020-12-09 19:56:15,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:15,185 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 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:15,186 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:15,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:15,208 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:56:15,210 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:15,223 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:15,225 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 19:56:15,225 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 19:56:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:15,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:15,781 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 19:56:15,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:15,786 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:15,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:15,787 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 19:56:15,787 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:15,787 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:1 [2020-12-09 19:56:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:15,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868389050] [2020-12-09 19:56:15,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [897834813] [2020-12-09 19:56:15,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:56:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:15,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 19:56:15,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:15,863 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_37|]} [2020-12-09 19:56:15,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:15,869 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 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:15,869 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:15,885 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:15,890 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:56:15,891 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:15,904 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:15,906 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 19:56:15,906 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 19:56:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:15,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:16,425 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 19:56:16,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:16,429 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:16,429 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:16,429 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 19:56:16,430 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:16,430 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2020-12-09 19:56:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:16,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637619957] [2020-12-09 19:56:16,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:56:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:16,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 19:56:16,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:16,474 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_32|], 1=[|v_#valid_39|]} [2020-12-09 19:56:16,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:16,478 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 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:16,479 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:16,493 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:16,498 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:56:16,499 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:16,512 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:16,514 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 19:56:16,514 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 19:56:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:16,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:16,557 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 19:56:16,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:16,560 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:16,561 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:16,561 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 19:56:16,562 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:16,562 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:1 [2020-12-09 19:56:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:16,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 19:56:16,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5, 4] total 16 [2020-12-09 19:56:16,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929708166] [2020-12-09 19:56:16,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 19:56:16,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 19:56:16,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2020-12-09 19:56:16,565 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2020-12-09 19:56:17,109 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-12-09 19:56:17,331 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2020-12-09 19:56:17,882 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2020-12-09 19:56:18,442 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2020-12-09 19:56:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:18,966 INFO L93 Difference]: Finished difference Result 251 states and 290 transitions. [2020-12-09 19:56:18,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 19:56:18,967 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 11 [2020-12-09 19:56:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:18,968 INFO L225 Difference]: With dead ends: 251 [2020-12-09 19:56:18,969 INFO L226 Difference]: Without dead ends: 251 [2020-12-09 19:56:18,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2020-12-09 19:56:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-12-09 19:56:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 99. [2020-12-09 19:56:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-12-09 19:56:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2020-12-09 19:56:18,972 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 11 [2020-12-09 19:56:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:18,972 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2020-12-09 19:56:18,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 19:56:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2020-12-09 19:56:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 19:56:18,973 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:18,973 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:19,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt,12 mathsat -unsat_core_generation=3 [2020-12-09 19:56:19,576 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:19,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:19,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1518446106, now seen corresponding path program 1 times [2020-12-09 19:56:19,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:19,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106837463] [2020-12-09 19:56:19,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:19,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 19:56:19,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:19,671 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 19:56:19,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:19,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106837463] [2020-12-09 19:56:19,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:19,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:56:19,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104629357] [2020-12-09 19:56:19,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:56:19,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:19,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:56:19,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:56:19,674 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 4 states. [2020-12-09 19:56:19,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:19,763 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2020-12-09 19:56:19,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:56:19,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-09 19:56:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:19,765 INFO L225 Difference]: With dead ends: 97 [2020-12-09 19:56:19,765 INFO L226 Difference]: Without dead ends: 97 [2020-12-09 19:56:19,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 19:56:19,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-12-09 19:56:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-12-09 19:56:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-12-09 19:56:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2020-12-09 19:56:19,767 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 13 [2020-12-09 19:56:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:19,768 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2020-12-09 19:56:19,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:56:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-12-09 19:56:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 19:56:19,768 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:19,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:19,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-12-09 19:56:19,969 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:19,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1518446105, now seen corresponding path program 1 times [2020-12-09 19:56:19,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:19,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374825742] [2020-12-09 19:56:19,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:20,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:56:20,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:20,075 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 19:56:20,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:20,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374825742] [2020-12-09 19:56:20,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:20,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:56:20,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302390380] [2020-12-09 19:56:20,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:56:20,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:20,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:56:20,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:56:20,077 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 6 states. [2020-12-09 19:56:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:20,323 INFO L93 Difference]: Finished difference Result 150 states and 177 transitions. [2020-12-09 19:56:20,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:56:20,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 19:56:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:20,324 INFO L225 Difference]: With dead ends: 150 [2020-12-09 19:56:20,324 INFO L226 Difference]: Without dead ends: 150 [2020-12-09 19:56:20,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 19:56:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-12-09 19:56:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 115. [2020-12-09 19:56:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-12-09 19:56:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 144 transitions. [2020-12-09 19:56:20,327 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 144 transitions. Word has length 13 [2020-12-09 19:56:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:20,327 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 144 transitions. [2020-12-09 19:56:20,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:56:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 144 transitions. [2020-12-09 19:56:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 19:56:20,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:20,328 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:20,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-12-09 19:56:20,529 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:20,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:20,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2020-12-09 19:56:20,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:20,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406839507] [2020-12-09 19:56:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:20,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:56:20,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:20,621 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:20,621 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:56:20,622 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:20,657 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 19:56:20,658 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:20,659 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 19:56:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:20,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:21,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406839507] [2020-12-09 19:56:21,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [270110678] [2020-12-09 19:56:21,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:56:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:21,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:56:21,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:21,191 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:21,192 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:56:21,193 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:21,217 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 19:56:21,218 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:21,218 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 19:56:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:21,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:21,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443190823] [2020-12-09 19:56:21,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:56:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:21,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 19:56:21,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:21,305 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:21,306 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:56:21,307 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:21,331 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 19:56:21,332 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:21,333 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 19:56:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:21,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:22,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 19:56:22,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 5, 6, 6] total 16 [2020-12-09 19:56:22,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944083521] [2020-12-09 19:56:22,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 19:56:22,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:22,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 19:56:22,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-12-09 19:56:22,115 INFO L87 Difference]: Start difference. First operand 115 states and 144 transitions. Second operand 17 states. [2020-12-09 19:56:22,996 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2020-12-09 19:56:23,141 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2020-12-09 19:56:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:23,463 INFO L93 Difference]: Finished difference Result 210 states and 254 transitions. [2020-12-09 19:56:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 19:56:23,465 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2020-12-09 19:56:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:23,467 INFO L225 Difference]: With dead ends: 210 [2020-12-09 19:56:23,467 INFO L226 Difference]: Without dead ends: 210 [2020-12-09 19:56:23,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2020-12-09 19:56:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-12-09 19:56:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 108. [2020-12-09 19:56:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-12-09 19:56:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2020-12-09 19:56:23,472 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 13 [2020-12-09 19:56:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:23,472 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2020-12-09 19:56:23,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 19:56:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2020-12-09 19:56:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 19:56:23,473 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:23,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:24,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 cvc4 --incremental --print-success --lang smt [2020-12-09 19:56:24,076 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:24,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:24,077 INFO L82 PathProgramCache]: Analyzing trace with hash -817381527, now seen corresponding path program 1 times [2020-12-09 19:56:24,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:24,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707037360] [2020-12-09 19:56:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:24,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:56:24,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:24,186 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 19:56:24,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:24,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707037360] [2020-12-09 19:56:24,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:24,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:56:24,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219168104] [2020-12-09 19:56:24,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:56:24,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:24,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:56:24,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:56:24,187 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand 6 states. [2020-12-09 19:56:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:24,382 INFO L93 Difference]: Finished difference Result 123 states and 147 transitions. [2020-12-09 19:56:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:56:24,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 19:56:24,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:24,383 INFO L225 Difference]: With dead ends: 123 [2020-12-09 19:56:24,383 INFO L226 Difference]: Without dead ends: 123 [2020-12-09 19:56:24,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 19:56:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-09 19:56:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2020-12-09 19:56:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-12-09 19:56:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2020-12-09 19:56:24,385 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 13 [2020-12-09 19:56:24,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:24,385 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2020-12-09 19:56:24,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:56:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-12-09 19:56:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 19:56:24,386 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:24,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:24,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-12-09 19:56:24,587 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:24,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash 172810365, now seen corresponding path program 1 times [2020-12-09 19:56:24,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:24,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761508022] [2020-12-09 19:56:24,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:24,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 19:56:24,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:24,670 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 19:56:24,670 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:24,672 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:24,672 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:24,672 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 19:56:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:26,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:26,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761508022] [2020-12-09 19:56:26,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:26,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:56:26,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751590530] [2020-12-09 19:56:26,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:56:26,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:26,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:56:26,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=17, Unknown=1, NotChecked=0, Total=30 [2020-12-09 19:56:26,733 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 6 states. [2020-12-09 19:56:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:36,869 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2020-12-09 19:56:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:56:36,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-09 19:56:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:36,870 INFO L225 Difference]: With dead ends: 96 [2020-12-09 19:56:36,870 INFO L226 Difference]: Without dead ends: 92 [2020-12-09 19:56:36,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2020-12-09 19:56:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-12-09 19:56:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-12-09 19:56:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-12-09 19:56:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2020-12-09 19:56:36,872 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 14 [2020-12-09 19:56:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:36,872 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2020-12-09 19:56:36,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:56:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2020-12-09 19:56:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 19:56:36,872 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:36,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:37,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-12-09 19:56:37,074 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:37,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:37,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1062174023, now seen corresponding path program 1 times [2020-12-09 19:56:37,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:37,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027144740] [2020-12-09 19:56:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:37,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 19:56:37,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:37,150 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-12-09 19:56:37,151 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 1 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:37,151 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:37,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:37,156 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 19:56:37,156 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:13 [2020-12-09 19:56:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:37,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:37,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027144740] [2020-12-09 19:56:37,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:37,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:56:37,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637545876] [2020-12-09 19:56:37,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:56:37,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:37,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:56:37,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:56:37,177 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand 5 states. [2020-12-09 19:56:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:37,272 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2020-12-09 19:56:37,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:56:37,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-09 19:56:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:37,273 INFO L225 Difference]: With dead ends: 91 [2020-12-09 19:56:37,273 INFO L226 Difference]: Without dead ends: 91 [2020-12-09 19:56:37,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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 19:56:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-12-09 19:56:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-12-09 19:56:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-12-09 19:56:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2020-12-09 19:56:37,275 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 15 [2020-12-09 19:56:37,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:37,275 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2020-12-09 19:56:37,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:56:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2020-12-09 19:56:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 19:56:37,275 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:37,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:37,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-12-09 19:56:37,477 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:37,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:37,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1062174024, now seen corresponding path program 1 times [2020-12-09 19:56:37,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:37,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215382579] [2020-12-09 19:56:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:37,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 19:56:37,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:37,590 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:37,590 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:56:37,591 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:37,611 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-12-09 19:56:37,613 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:37,613 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-12-09 19:56:37,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:37,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:37,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215382579] [2020-12-09 19:56:37,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:37,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:56:37,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934241376] [2020-12-09 19:56:37,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:56:37,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:37,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:56:37,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:56:37,646 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand 6 states. [2020-12-09 19:56:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:37,851 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2020-12-09 19:56:37,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:56:37,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 19:56:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:37,852 INFO L225 Difference]: With dead ends: 121 [2020-12-09 19:56:37,852 INFO L226 Difference]: Without dead ends: 121 [2020-12-09 19:56:37,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-09 19:56:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-09 19:56:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2020-12-09 19:56:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-12-09 19:56:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2020-12-09 19:56:37,854 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 15 [2020-12-09 19:56:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:37,855 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2020-12-09 19:56:37,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:56:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2020-12-09 19:56:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 19:56:37,855 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:37,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:38,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2020-12-09 19:56:38,056 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:38,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:38,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1320339462, now seen corresponding path program 1 times [2020-12-09 19:56:38,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:38,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511072780] [2020-12-09 19:56:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:38,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 19:56:38,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:38,241 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:38,242 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:56:38,242 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:38,272 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 19:56:38,273 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:38,274 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2020-12-09 19:56:38,319 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 19:56:38,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:38,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511072780] [2020-12-09 19:56:38,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:38,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:56:38,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517914358] [2020-12-09 19:56:38,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:56:38,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:38,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:56:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:56:38,320 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand 6 states. [2020-12-09 19:56:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:38,498 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2020-12-09 19:56:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:56:38,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 19:56:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:38,499 INFO L225 Difference]: With dead ends: 99 [2020-12-09 19:56:38,499 INFO L226 Difference]: Without dead ends: 99 [2020-12-09 19:56:38,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-09 19:56:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-12-09 19:56:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2020-12-09 19:56:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-12-09 19:56:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2020-12-09 19:56:38,501 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 15 [2020-12-09 19:56:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:38,501 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2020-12-09 19:56:38,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:56:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2020-12-09 19:56:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 19:56:38,502 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:38,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:38,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2020-12-09 19:56:38,703 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1452978584, now seen corresponding path program 1 times [2020-12-09 19:56:38,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:38,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873086951] [2020-12-09 19:56:38,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:38,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 19:56:38,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:38,804 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 19:56:38,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:38,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873086951] [2020-12-09 19:56:38,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:38,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:56:38,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536064403] [2020-12-09 19:56:38,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:56:38,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:38,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:56:38,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:56:38,805 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand 5 states. [2020-12-09 19:56:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:38,917 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2020-12-09 19:56:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:56:38,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-09 19:56:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:38,918 INFO L225 Difference]: With dead ends: 90 [2020-12-09 19:56:38,918 INFO L226 Difference]: Without dead ends: 90 [2020-12-09 19:56:38,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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 19:56:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-12-09 19:56:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-12-09 19:56:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-12-09 19:56:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2020-12-09 19:56:38,920 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 17 [2020-12-09 19:56:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:38,920 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2020-12-09 19:56:38,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:56:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2020-12-09 19:56:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 19:56:38,920 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:38,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:39,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2020-12-09 19:56:39,122 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:39,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:39,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1452978583, now seen corresponding path program 1 times [2020-12-09 19:56:39,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:39,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934976036] [2020-12-09 19:56:39,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:39,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 19:56:39,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:39,359 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 19:56:39,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:39,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934976036] [2020-12-09 19:56:39,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:39,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 19:56:39,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629112675] [2020-12-09 19:56:39,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 19:56:39,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 19:56:39,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:56:39,360 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand 7 states. [2020-12-09 19:56:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:39,655 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2020-12-09 19:56:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:56:39,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-12-09 19:56:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:39,656 INFO L225 Difference]: With dead ends: 129 [2020-12-09 19:56:39,656 INFO L226 Difference]: Without dead ends: 129 [2020-12-09 19:56:39,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-12-09 19:56:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-12-09 19:56:39,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 106. [2020-12-09 19:56:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-12-09 19:56:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2020-12-09 19:56:39,659 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 17 [2020-12-09 19:56:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:39,659 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2020-12-09 19:56:39,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 19:56:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2020-12-09 19:56:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 19:56:39,659 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:39,659 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:39,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2020-12-09 19:56:39,860 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:39,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1562125035, now seen corresponding path program 1 times [2020-12-09 19:56:39,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:39,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426048870] [2020-12-09 19:56:39,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:39,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 19:56:39,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:39,992 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 19:56:39,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:39,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426048870] [2020-12-09 19:56:39,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:39,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:56:39,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847842231] [2020-12-09 19:56:39,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:56:39,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:39,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:56:39,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:56:39,994 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand 6 states. [2020-12-09 19:56:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:40,147 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2020-12-09 19:56:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:56:40,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-09 19:56:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:40,148 INFO L225 Difference]: With dead ends: 112 [2020-12-09 19:56:40,148 INFO L226 Difference]: Without dead ends: 112 [2020-12-09 19:56:40,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-09 19:56:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-09 19:56:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2020-12-09 19:56:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-12-09 19:56:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2020-12-09 19:56:40,150 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 17 [2020-12-09 19:56:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:40,150 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2020-12-09 19:56:40,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:56:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2020-12-09 19:56:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 19:56:40,151 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:40,151 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:40,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2020-12-09 19:56:40,352 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:40,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:40,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1532417320, now seen corresponding path program 1 times [2020-12-09 19:56:40,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:40,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6872472] [2020-12-09 19:56:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:40,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 19:56:40,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:40,434 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_42|], 1=[|v_#valid_48|]} [2020-12-09 19:56:40,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:40,443 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:40,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:40,464 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:56:40,465 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:40,478 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:40,480 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 19:56:40,480 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 19:56:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:40,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:41,252 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:56:41,254 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:56:41,257 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 19:56:41,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:41,262 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,264 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 19:56:41,266 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 19:56:41,267 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,267 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:41,267 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 19:56:41,268 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,268 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:83, output treesize:1 [2020-12-09 19:56:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:41,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6872472] [2020-12-09 19:56:41,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [700761868] [2020-12-09 19:56:41,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:56:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:41,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 19:56:41,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:41,345 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_44|], 1=[|v_#valid_50|]} [2020-12-09 19:56:41,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:41,349 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 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:41,350 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,363 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:41,368 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:56:41,369 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,382 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:41,384 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 19:56:41,384 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 19:56:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:41,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:41,742 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-09 19:56:41,748 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:56:41,748 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:56:41,752 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 19:56:41,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:41,756 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,758 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 19:56:41,760 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 19:56:41,761 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:41,761 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 19:56:41,762 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,762 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:1 [2020-12-09 19:56:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:41,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919704998] [2020-12-09 19:56:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:56:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:41,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 19:56:41,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:41,804 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_46|], 1=[|v_#valid_52|]} [2020-12-09 19:56:41,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:41,808 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 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:41,809 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:41,827 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:56:41,829 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,842 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:41,843 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 19:56:41,844 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 19:56:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:41,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:41,937 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:56:41,938 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:56:41,942 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 19:56:41,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:41,947 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,949 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 19:56:41,951 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 19:56:41,951 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,952 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:41,952 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 19:56:41,953 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:41,953 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:1 [2020-12-09 19:56:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:41,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 19:56:41,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8, 8, 8] total 16 [2020-12-09 19:56:41,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77765930] [2020-12-09 19:56:41,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 19:56:41,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:41,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 19:56:41,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2020-12-09 19:56:41,956 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand 17 states. [2020-12-09 19:56:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:42,678 INFO L93 Difference]: Finished difference Result 184 states and 206 transitions. [2020-12-09 19:56:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 19:56:42,679 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2020-12-09 19:56:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:42,680 INFO L225 Difference]: With dead ends: 184 [2020-12-09 19:56:42,680 INFO L226 Difference]: Without dead ends: 184 [2020-12-09 19:56:42,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2020-12-09 19:56:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-12-09 19:56:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 82. [2020-12-09 19:56:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-12-09 19:56:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2020-12-09 19:56:42,682 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 17 [2020-12-09 19:56:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:42,682 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2020-12-09 19:56:42,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 19:56:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2020-12-09 19:56:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 19:56:42,683 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:42,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:43,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 cvc4 --incremental --print-success --lang smt,28 mathsat -unsat_core_generation=3 [2020-12-09 19:56:43,286 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:43,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:43,287 INFO L82 PathProgramCache]: Analyzing trace with hash -448353975, now seen corresponding path program 1 times [2020-12-09 19:56:43,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:43,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179819212] [2020-12-09 19:56:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:43,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:56:43,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:43,408 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-12-09 19:56:43,408 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 1 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:43,409 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:43,412 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:43,413 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 19:56:43,413 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:13 [2020-12-09 19:56:43,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 19:56:43,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:43,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179819212] [2020-12-09 19:56:43,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:43,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:56:43,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37967567] [2020-12-09 19:56:43,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:56:43,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:43,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:56:43,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:56:43,437 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand 5 states. [2020-12-09 19:56:43,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:43,537 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2020-12-09 19:56:43,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:56:43,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-09 19:56:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:43,538 INFO L225 Difference]: With dead ends: 81 [2020-12-09 19:56:43,538 INFO L226 Difference]: Without dead ends: 81 [2020-12-09 19:56:43,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 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 19:56:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-12-09 19:56:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-12-09 19:56:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-12-09 19:56:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2020-12-09 19:56:43,540 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 19 [2020-12-09 19:56:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:43,540 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2020-12-09 19:56:43,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:56:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2020-12-09 19:56:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 19:56:43,541 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:43,541 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:43,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2020-12-09 19:56:43,742 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash -448353974, now seen corresponding path program 1 times [2020-12-09 19:56:43,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:43,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456180968] [2020-12-09 19:56:43,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:43,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 19:56:43,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:43,855 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:43,855 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:56:43,856 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:43,874 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-12-09 19:56:43,875 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:43,876 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-12-09 19:56:43,916 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 19:56:43,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:43,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456180968] [2020-12-09 19:56:43,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:43,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 19:56:43,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483368104] [2020-12-09 19:56:43,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 19:56:43,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:43,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 19:56:43,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:56:43,917 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 7 states. [2020-12-09 19:56:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:44,195 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2020-12-09 19:56:44,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 19:56:44,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-12-09 19:56:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:44,196 INFO L225 Difference]: With dead ends: 116 [2020-12-09 19:56:44,196 INFO L226 Difference]: Without dead ends: 113 [2020-12-09 19:56:44,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-09 19:56:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-12-09 19:56:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 89. [2020-12-09 19:56:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-12-09 19:56:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2020-12-09 19:56:44,198 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 19 [2020-12-09 19:56:44,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:44,198 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2020-12-09 19:56:44,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 19:56:44,198 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2020-12-09 19:56:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 19:56:44,199 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:44,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:44,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2020-12-09 19:56:44,400 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:44,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:44,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1469422328, now seen corresponding path program 1 times [2020-12-09 19:56:44,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:44,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926981429] [2020-12-09 19:56:44,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:44,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 19:56:44,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:44,495 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:44,495 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:56:44,496 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:44,525 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 19:56:44,526 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:44,527 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2020-12-09 19:56:44,595 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 19:56:44,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:44,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926981429] [2020-12-09 19:56:44,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:44,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 19:56:44,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496668514] [2020-12-09 19:56:44,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 19:56:44,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:44,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 19:56:44,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-09 19:56:44,596 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 8 states. [2020-12-09 19:56:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:44,918 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2020-12-09 19:56:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 19:56:44,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-12-09 19:56:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:44,920 INFO L225 Difference]: With dead ends: 97 [2020-12-09 19:56:44,920 INFO L226 Difference]: Without dead ends: 94 [2020-12-09 19:56:44,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-12-09 19:56:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-12-09 19:56:44,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2020-12-09 19:56:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-12-09 19:56:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2020-12-09 19:56:44,922 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 19 [2020-12-09 19:56:44,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:44,922 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2020-12-09 19:56:44,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 19:56:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2020-12-09 19:56:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 19:56:44,923 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:44,923 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] [2020-12-09 19:56:45,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2020-12-09 19:56:45,124 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:45,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1075479959, now seen corresponding path program 1 times [2020-12-09 19:56:45,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:45,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595544884] [2020-12-09 19:56:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:45,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 19:56:45,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:45,343 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2020-12-09 19:56:45,344 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:45,348 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:45,349 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:45,349 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-12-09 19:56:45,502 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:45,502 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2020-12-09 19:56:45,504 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 19:56:45,506 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 19:56:45,506 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 19:56:45,523 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:45,526 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:56:45,526 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:13 [2020-12-09 19:56:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:45,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:45,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595544884] [2020-12-09 19:56:45,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:45,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 19:56:45,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001708752] [2020-12-09 19:56:45,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 19:56:45,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:45,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 19:56:45,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-12-09 19:56:45,561 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand 11 states. [2020-12-09 19:56:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:47,977 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2020-12-09 19:56:47,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 19:56:47,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-12-09 19:56:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:47,978 INFO L225 Difference]: With dead ends: 91 [2020-12-09 19:56:47,978 INFO L226 Difference]: Without dead ends: 77 [2020-12-09 19:56:47,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2020-12-09 19:56:47,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-12-09 19:56:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-12-09 19:56:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-09 19:56:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2020-12-09 19:56:47,980 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2020-12-09 19:56:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:47,980 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2020-12-09 19:56:47,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 19:56:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2020-12-09 19:56:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 19:56:47,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:47,980 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] [2020-12-09 19:56:48,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2020-12-09 19:56:48,182 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:48,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:48,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1225342631, now seen corresponding path program 1 times [2020-12-09 19:56:48,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:48,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106831141] [2020-12-09 19:56:48,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:48,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 19:56:48,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:48,313 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 15 treesize of output 11 [2020-12-09 19:56:48,314 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:48,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:48,329 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:56:48,329 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2020-12-09 19:56:48,574 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 19:56:48,602 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:48,602 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 45 [2020-12-09 19:56:48,603 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 19:56:48,603 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 19:56:48,605 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 19:56:48,605 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 19:56:48,606 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 19:56:48,658 INFO L625 ElimStorePlain]: treesize reduction 15, result has 70.6 percent of original size [2020-12-09 19:56:48,663 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:56:48,663 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:13 [2020-12-09 19:56:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:48,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:56:48,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106831141] [2020-12-09 19:56:48,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:56:48,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 19:56:48,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365763989] [2020-12-09 19:56:48,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 19:56:48,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:48,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 19:56:48,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-12-09 19:56:48,710 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 13 states. [2020-12-09 19:56:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:56:51,598 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2020-12-09 19:56:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 19:56:51,599 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-12-09 19:56:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:56:51,600 INFO L225 Difference]: With dead ends: 90 [2020-12-09 19:56:51,600 INFO L226 Difference]: Without dead ends: 80 [2020-12-09 19:56:51,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2020-12-09 19:56:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-12-09 19:56:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2020-12-09 19:56:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-09 19:56:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2020-12-09 19:56:51,601 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 21 [2020-12-09 19:56:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:56:51,602 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2020-12-09 19:56:51,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 19:56:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2020-12-09 19:56:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 19:56:51,602 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:56:51,602 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 19:56:51,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2020-12-09 19:56:51,803 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:56:51,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:56:51,804 INFO L82 PathProgramCache]: Analyzing trace with hash -591263241, now seen corresponding path program 2 times [2020-12-09 19:56:51,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:56:51,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699647480] [2020-12-09 19:56:51,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/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 19:56:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:56:51,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 19:56:51,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:51,907 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_50|], 1=[|v_#valid_55|]} [2020-12-09 19:56:51,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:51,912 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 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:51,913 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:51,929 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:51,935 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:56:51,937 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:51,952 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:51,953 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 19:56:51,953 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 19:56:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:52,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:53,443 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 19:56:53,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:53,448 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:53,449 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:53,449 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 19:56:53,449 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:53,449 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:1 [2020-12-09 19:56:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:53,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699647480] [2020-12-09 19:56:53,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [37886467] [2020-12-09 19:56:53,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:56:53,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 19:56:53,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 19:56:53,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 19:56:53,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:53,539 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_52|], 1=[|v_#valid_57|]} [2020-12-09 19:56:53,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:53,543 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:53,544 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:53,561 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:53,567 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:56:53,569 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:53,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:53,586 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 19:56:53,587 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 19:56:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:53,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:55,884 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 19:56:55,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:55,888 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:55,889 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:55,889 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 19:56:55,889 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:55,889 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:1 [2020-12-09 19:56:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:55,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692516693] [2020-12-09 19:56:55,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:56:55,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 19:56:55,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 19:56:55,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 19:56:55,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:56:55,948 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_54|], 1=[|v_#valid_59|]} [2020-12-09 19:56:55,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:55,953 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 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:56:55,954 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:55,969 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:55,974 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:56:55,975 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:55,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:55,993 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 19:56:55,993 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 19:56:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:56,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:56:56,170 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 19:56:56,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:56:56,175 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:56:56,175 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:56:56,175 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 19:56:56,176 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:56:56,176 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2020-12-09 19:56:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:56:56,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 19:56:56,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 9, 8, 8] total 33 [2020-12-09 19:56:56,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491502684] [2020-12-09 19:56:56,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-09 19:56:56,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:56:56,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-09 19:56:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 19:56:56,181 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 34 states. [2020-12-09 19:56:59,144 WARN L197 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2020-12-09 19:57:00,688 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-09 19:57:05,414 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-12-09 19:57:06,491 WARN L197 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-12-09 19:57:08,353 WARN L197 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-12-09 19:57:10,637 WARN L197 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-12-09 19:57:11,439 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-12-09 19:57:13,013 WARN L197 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-12-09 19:57:15,079 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-12-09 19:57:15,748 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2020-12-09 19:57:17,109 WARN L197 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2020-12-09 19:57:19,030 WARN L197 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2020-12-09 19:57:20,808 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2020-12-09 19:57:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:57:22,670 INFO L93 Difference]: Finished difference Result 435 states and 460 transitions. [2020-12-09 19:57:22,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-09 19:57:22,672 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 23 [2020-12-09 19:57:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:57:22,673 INFO L225 Difference]: With dead ends: 435 [2020-12-09 19:57:22,674 INFO L226 Difference]: Without dead ends: 435 [2020-12-09 19:57:22,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=711, Invalid=1941, Unknown=0, NotChecked=0, Total=2652 [2020-12-09 19:57:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-12-09 19:57:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 125. [2020-12-09 19:57:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-09 19:57:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2020-12-09 19:57:22,678 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 23 [2020-12-09 19:57:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:57:22,678 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2020-12-09 19:57:22,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-09 19:57:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2020-12-09 19:57:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 19:57:22,678 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:57:22,678 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 19:57:23,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 mathsat -unsat_core_generation=3,37 cvc4 --incremental --print-success --lang smt [2020-12-09 19:57:23,280 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:57:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:57:23,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2109068310, now seen corresponding path program 1 times [2020-12-09 19:57:23,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:57:23,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100539804] [2020-12-09 19:57:23,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2020-12-09 19:57:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:57:23,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 19:57:23,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:57:23,392 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:57:23,393 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:23,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:23,399 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:23,399 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-12-09 19:57:23,415 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 12 treesize of output 8 [2020-12-09 19:57:23,416 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:23,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:23,422 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:23,422 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-12-09 19:57:23,440 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 24 treesize of output 23 [2020-12-09 19:57:23,441 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:23,457 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:23,458 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 19:57:23,458 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:27 [2020-12-09 19:57:23,580 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2020-12-09 19:57:23,581 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:23,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:23,586 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:23,586 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2020-12-09 19:57:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:57:23,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:57:23,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100539804] [2020-12-09 19:57:23,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:57:23,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 19:57:23,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900183647] [2020-12-09 19:57:23,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 19:57:23,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:57:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 19:57:23,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-09 19:57:23,605 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand 9 states. [2020-12-09 19:57:25,892 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-12-09 19:57:26,349 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-12-09 19:57:26,564 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-09 19:57:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:57:26,604 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2020-12-09 19:57:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 19:57:26,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-12-09 19:57:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:57:26,605 INFO L225 Difference]: With dead ends: 141 [2020-12-09 19:57:26,605 INFO L226 Difference]: Without dead ends: 122 [2020-12-09 19:57:26,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-09 19:57:26,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-12-09 19:57:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-12-09 19:57:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-12-09 19:57:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2020-12-09 19:57:26,608 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 25 [2020-12-09 19:57:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:57:26,608 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2020-12-09 19:57:26,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 19:57:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2020-12-09 19:57:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 19:57:26,609 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:57:26,609 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 19:57:26,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3 [2020-12-09 19:57:26,810 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:57:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:57:26,810 INFO L82 PathProgramCache]: Analyzing trace with hash 380460652, now seen corresponding path program 1 times [2020-12-09 19:57:26,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:57:26,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645860008] [2020-12-09 19:57:26,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/mathsat Starting monitored process 40 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with mathsat -unsat_core_generation=3 [2020-12-09 19:57:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:57:26,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 19:57:26,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:57:26,899 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_56|], 1=[|v_#valid_62|]} [2020-12-09 19:57:26,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:57:26,904 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 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 19:57:26,905 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:26,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:26,924 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:57:26,925 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:26,938 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:26,938 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:26,938 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2020-12-09 19:57:26,967 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 17 treesize of output 13 [2020-12-09 19:57:26,967 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:26,986 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:26,987 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:26,987 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2020-12-09 19:57:27,020 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 31 treesize of output 30 [2020-12-09 19:57:27,021 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:27,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:27,048 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 19:57:27,048 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2020-12-09 19:57:27,249 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:27,249 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 34 treesize of output 25 [2020-12-09 19:57:27,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:27,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:27,252 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 19:57:27,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:27,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:27,268 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:57:27,268 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:27 [2020-12-09 19:57:27,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:27,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:57:27,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:57:29,653 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2020-12-09 19:57:29,671 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 27 [2020-12-09 19:57:29,674 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 19:57:29,678 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 19:57:29,679 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:29,693 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2020-12-09 19:57:29,718 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 27 [2020-12-09 19:57:29,721 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2020-12-09 19:57:29,725 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 19:57:29,725 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:29,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:29,748 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-09 19:57:29,748 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:49, output treesize:23 [2020-12-09 19:57:29,866 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 19:57:29,871 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:57:29,872 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:29,878 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:29,879 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 19:57:29,880 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:29,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:29,886 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:29,887 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:24, output treesize:7 [2020-12-09 19:57:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:57:29,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645860008] [2020-12-09 19:57:29,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [469136101] [2020-12-09 19:57:29,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/cvc4 Starting monitored process 41 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:57:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:57:30,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 19:57:30,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:57:30,057 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:57:30,058 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:30,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:30,067 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:30,067 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-09 19:57:30,135 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 15 treesize of output 11 [2020-12-09 19:57:30,135 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:30,194 INFO L625 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2020-12-09 19:57:30,195 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:57:30,195 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2020-12-09 19:57:30,288 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 26 treesize of output 25 [2020-12-09 19:57:30,289 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:30,319 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:30,320 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 19:57:30,320 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-12-09 19:57:32,769 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:32,770 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 29 treesize of output 23 [2020-12-09 19:57:32,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:32,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:32,772 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 19:57:32,790 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:32,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:32,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 19:57:32,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 19:57:32,793 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 19:57:32,794 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:30 [2020-12-09 19:57:32,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:32,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 19:57:32,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 19:57:33,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:33,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 19:57:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:57:33,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:57:33,809 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:57:33,821 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-12-09 19:57:33,822 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:33,838 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 6 [2020-12-09 19:57:33,839 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:33,917 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:33,933 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2020-12-09 19:57:33,954 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 27 [2020-12-09 19:57:33,956 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2020-12-09 19:57:33,959 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 19:57:33,960 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:33,979 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2020-12-09 19:57:34,013 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 27 [2020-12-09 19:57:34,015 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2020-12-09 19:57:34,019 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 19:57:34,019 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:34,081 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:34,081 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-09 19:57:34,082 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:83, output treesize:41 [2020-12-09 19:57:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:57:34,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406838490] [2020-12-09 19:57:34,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:57:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:57:34,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 19:57:34,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:57:34,408 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-12-09 19:57:34,409 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:34,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:34,415 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:34,415 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-12-09 19:57:34,500 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 15 treesize of output 11 [2020-12-09 19:57:34,501 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:34,550 INFO L625 ElimStorePlain]: treesize reduction 8, result has 78.9 percent of original size [2020-12-09 19:57:34,551 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:57:34,551 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2020-12-09 19:57:34,664 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 26 [2020-12-09 19:57:34,665 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:34,713 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:34,714 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 19:57:34,715 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:41 [2020-12-09 19:57:41,118 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:41,119 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 30 treesize of output 23 [2020-12-09 19:57:41,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:41,121 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:41,121 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 19:57:41,142 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:41,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:41,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 19:57:41,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 19:57:41,146 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 19:57:41,146 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:30 [2020-12-09 19:57:41,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:41,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 19:57:41,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 19:57:41,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 19:57:41,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 19:57:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:57:41,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:57:42,029 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:57:42,042 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-12-09 19:57:42,043 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:42,063 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 6 [2020-12-09 19:57:42,065 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:57:42,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:42,154 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2020-12-09 19:57:42,178 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 27 [2020-12-09 19:57:42,181 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2020-12-09 19:57:42,185 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 19:57:42,185 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:42,200 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2020-12-09 19:57:42,230 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 27 [2020-12-09 19:57:42,233 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2020-12-09 19:57:42,238 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 19:57:42,238 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:57:42,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:57:42,317 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-09 19:57:42,317 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:83, output treesize:41 [2020-12-09 19:57:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:57:42,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 19:57:42,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 7, 9, 7] total 29 [2020-12-09 19:57:42,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406283910] [2020-12-09 19:57:42,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-09 19:57:42,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:57:42,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-09 19:57:42,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=744, Unknown=8, NotChecked=0, Total=870 [2020-12-09 19:57:42,336 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 30 states. [2020-12-09 19:57:45,118 WARN L197 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2020-12-09 19:57:56,128 WARN L197 SmtUtils]: Spent 10.92 s on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2020-12-09 19:58:04,480 WARN L197 SmtUtils]: Spent 8.27 s on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2020-12-09 19:58:13,321 WARN L197 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2020-12-09 19:58:23,897 WARN L197 SmtUtils]: Spent 6.35 s on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2020-12-09 19:58:28,094 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2020-12-09 19:58:31,068 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2020-12-09 19:58:34,043 WARN L197 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2020-12-09 19:58:48,199 WARN L197 SmtUtils]: Spent 7.20 s on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2020-12-09 19:58:50,830 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-12-09 19:58:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:58:54,985 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2020-12-09 19:58:54,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 19:58:54,986 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 25 [2020-12-09 19:58:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:58:54,987 INFO L225 Difference]: With dead ends: 133 [2020-12-09 19:58:54,987 INFO L226 Difference]: Without dead ends: 133 [2020-12-09 19:58:54,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 110 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 75.3s TimeCoverageRelationStatistics Valid=347, Invalid=1264, Unknown=29, NotChecked=0, Total=1640 [2020-12-09 19:58:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-09 19:58:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2020-12-09 19:58:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-09 19:58:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2020-12-09 19:58:54,989 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 25 [2020-12-09 19:58:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:58:54,990 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2020-12-09 19:58:54,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-09 19:58:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2020-12-09 19:58:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 19:58:54,990 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:58:54,990 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:58:55,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 mathsat -unsat_core_generation=3,42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 cvc4 --incremental --print-success --lang smt [2020-12-09 19:58:55,593 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:58:55,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:58:55,594 INFO L82 PathProgramCache]: Analyzing trace with hash 550466701, now seen corresponding path program 1 times [2020-12-09 19:58:55,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:58:55,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831798022] [2020-12-09 19:58:55,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/mathsat Starting monitored process 43 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with mathsat -unsat_core_generation=3 [2020-12-09 19:58:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:58:55,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 19:58:55,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:58:55,698 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:58:55,698 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:58:55,699 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:58:55,734 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 19:58:55,735 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:58:55,735 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 19:58:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:58:55,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:58:56,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:58:56,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831798022] [2020-12-09 19:58:56,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1411990344] [2020-12-09 19:58:56,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/cvc4 Starting monitored process 44 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:58:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:58:56,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 19:58:56,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:58:56,526 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:58:56,527 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:58:56,527 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:58:56,552 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-12-09 19:58:56,553 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:58:56,554 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-12-09 19:58:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:58:57,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:58:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:58:57,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931745820] [2020-12-09 19:58:57,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:58:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:58:57,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 19:58:57,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:58:57,754 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:58:57,754 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:58:57,755 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:58:57,776 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-12-09 19:58:57,778 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:58:57,778 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-12-09 19:58:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:58:57,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:58:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:58:57,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 19:58:57,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9, 9, 9, 9] total 26 [2020-12-09 19:58:57,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740457697] [2020-12-09 19:58:57,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 19:58:57,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:58:57,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 19:58:57,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2020-12-09 19:58:57,821 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand 27 states. [2020-12-09 19:58:58,738 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-12-09 19:58:59,137 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2020-12-09 19:59:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:59:00,035 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2020-12-09 19:59:00,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-09 19:59:00,036 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2020-12-09 19:59:00,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:59:00,037 INFO L225 Difference]: With dead ends: 166 [2020-12-09 19:59:00,037 INFO L226 Difference]: Without dead ends: 166 [2020-12-09 19:59:00,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=405, Invalid=1317, Unknown=0, NotChecked=0, Total=1722 [2020-12-09 19:59:00,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-12-09 19:59:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 127. [2020-12-09 19:59:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-09 19:59:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2020-12-09 19:59:00,040 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 27 [2020-12-09 19:59:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:59:00,040 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2020-12-09 19:59:00,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 19:59:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2020-12-09 19:59:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 19:59:00,040 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:59:00,040 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:59:00,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,43 mathsat -unsat_core_generation=3,44 cvc4 --incremental --print-success --lang smt [2020-12-09 19:59:00,643 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:59:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:59:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash 717523054, now seen corresponding path program 1 times [2020-12-09 19:59:00,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:59:00,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932664625] [2020-12-09 19:59:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/mathsat Starting monitored process 46 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with mathsat -unsat_core_generation=3 [2020-12-09 19:59:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:59:00,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 19:59:00,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:59:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:59:00,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:59:00,876 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 6 [2020-12-09 19:59:00,877 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:59:00,882 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:59:00,882 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:59:00,883 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:5 [2020-12-09 19:59:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:59:01,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932664625] [2020-12-09 19:59:01,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [717426718] [2020-12-09 19:59:01,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/cvc4 Starting monitored process 47 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:59:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:59:01,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 19:59:01,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:59:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:59:01,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:59:01,151 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 6 [2020-12-09 19:59:01,152 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:59:01,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:59:01,157 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:59:01,157 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:5 [2020-12-09 19:59:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:59:01,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242466345] [2020-12-09 19:59:01,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:59:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:59:01,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 19:59:01,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:59:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:59:01,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:59:01,270 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 6 [2020-12-09 19:59:01,271 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:59:01,276 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:59:01,277 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:59:01,277 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:5 [2020-12-09 19:59:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:59:01,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 19:59:01,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 11 [2020-12-09 19:59:01,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256110183] [2020-12-09 19:59:01,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 19:59:01,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:59:01,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 19:59:01,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-09 19:59:01,293 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand 12 states. [2020-12-09 19:59:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:59:02,086 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2020-12-09 19:59:02,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 19:59:02,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2020-12-09 19:59:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:59:02,087 INFO L225 Difference]: With dead ends: 151 [2020-12-09 19:59:02,087 INFO L226 Difference]: Without dead ends: 151 [2020-12-09 19:59:02,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2020-12-09 19:59:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-12-09 19:59:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 126. [2020-12-09 19:59:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-12-09 19:59:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2020-12-09 19:59:02,089 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 29 [2020-12-09 19:59:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:59:02,090 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2020-12-09 19:59:02,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 19:59:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2020-12-09 19:59:02,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 19:59:02,090 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:59:02,090 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:59:02,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 mathsat -unsat_core_generation=3,47 cvc4 --incremental --print-success --lang smt,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:59:02,693 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:59:02,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:59:02,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1950386673, now seen corresponding path program 1 times [2020-12-09 19:59:02,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:59:02,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724443404] [2020-12-09 19:59:02,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/mathsat Starting monitored process 49 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with mathsat -unsat_core_generation=3 [2020-12-09 19:59:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:59:02,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 19:59:02,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:59:02,835 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:59:02,835 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:59:02,836 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:59:02,863 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 19:59:02,865 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:59:02,865 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2020-12-09 19:59:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:59:02,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:59:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:59:03,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724443404] [2020-12-09 19:59:03,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1345503232] [2020-12-09 19:59:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/cvc4 Starting monitored process 50 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:59:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:59:03,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-09 19:59:03,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:59:03,459 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:59:03,459 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:59:03,459 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:59:03,481 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-12-09 19:59:03,482 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:59:03,482 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-12-09 19:59:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:59:03,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:59:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:59:04,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060577100] [2020-12-09 19:59:04,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:59:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:59:05,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 19:59:05,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:59:05,037 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:59:05,038 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:59:05,038 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:59:05,067 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 19:59:05,069 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:59:05,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 19:59:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:59:05,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:59:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 19:59:05,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 5 imperfect interpolant sequences. [2020-12-09 19:59:05,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 7, 10, 10, 12] total 36 [2020-12-09 19:59:05,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396128763] [2020-12-09 19:59:05,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:59:05,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:59:05,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:59:05,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2020-12-09 19:59:05,809 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 5 states. [2020-12-09 19:59:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:59:06,007 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2020-12-09 19:59:06,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:59:06,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-12-09 19:59:06,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:59:06,009 INFO L225 Difference]: With dead ends: 125 [2020-12-09 19:59:06,009 INFO L226 Difference]: Without dead ends: 122 [2020-12-09 19:59:06,009 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2020-12-09 19:59:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-12-09 19:59:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-12-09 19:59:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-12-09 19:59:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2020-12-09 19:59:06,011 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 31 [2020-12-09 19:59:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:59:06,011 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2020-12-09 19:59:06,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:59:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2020-12-09 19:59:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 19:59:06,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:59:06,012 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:59:06,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 cvc4 --incremental --print-success --lang smt,51 z3 -smt2 -in SMTLIB2_COMPLIANT=true,49 mathsat -unsat_core_generation=3 [2020-12-09 19:59:06,614 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 19:59:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:59:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1419892242, now seen corresponding path program 2 times [2020-12-09 19:59:06,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:59:06,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623400838] [2020-12-09 19:59:06,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/mathsat Starting monitored process 52 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with mathsat -unsat_core_generation=3 [2020-12-09 19:59:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:59:06,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 19:59:06,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:59:06,758 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:59:06,758 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 19:59:06,759 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:59:06,787 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 19:59:06,789 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:59:06,789 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 19:59:06,860 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 17 treesize of output 13 [2020-12-09 19:59:06,861 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:59:06,875 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:59:06,875 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:59:06,876 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2020-12-09 19:59:07,084 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 24 [2020-12-09 19:59:07,085 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 19:59:07,105 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:59:07,106 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 19:59:07,106 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2020-12-09 19:59:07,228 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 19:59:07,252 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:59:07,252 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 45 [2020-12-09 19:59:07,253 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 19:59:07,254 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 19:59:07,255 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 19:59:07,255 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 19:59:07,255 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 19:59:07,311 INFO L625 ElimStorePlain]: treesize reduction 15, result has 72.2 percent of original size [2020-12-09 19:59:07,315 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:59:07,315 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:13 [2020-12-09 19:59:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:59:07,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:59:08,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623400838] [2020-12-09 19:59:08,152 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2020-12-09 19:59:08,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [22620153] [2020-12-09 19:59:08,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/cvc4 Starting monitored process 53 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:59:08,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 19:59:08,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 19:59:08,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 19:59:08,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:59:08,283 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@19620762 [2020-12-09 19:59:08,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386566206] [2020-12-09 19:59:08,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d93f7358-d610-4097-b4bf-6d7e18b38a66/bin/utaipan/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:59:08,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 19:59:08,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 19:59:08,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 19:59:08,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:59:08,342 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@19620762 [2020-12-09 19:59:08,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:59:08,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-12-09 19:59:08,342 ERROR L205 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2020-12-09 19:59:08,342 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 19:59:08,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,52 mathsat -unsat_core_generation=3,53 cvc4 --incremental --print-success --lang smt [2020-12-09 19:59:08,960 WARN L254 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-12-09 19:59:08,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:59:08 BoogieIcfgContainer [2020-12-09 19:59:08,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 19:59:08,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 19:59:08,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 19:59:08,961 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 19:59:08,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:56:09" (3/4) ... [2020-12-09 19:59:08,964 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 19:59:08,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 19:59:08,965 INFO L168 Benchmark]: Toolchain (without parser) took 179824.54 ms. Allocated memory was 56.6 MB in the beginning and 86.0 MB in the end (delta: 29.4 MB). Free memory was 35.1 MB in the beginning and 23.4 MB in the end (delta: 11.6 MB). Peak memory consumption was 41.5 MB. Max. memory is 16.1 GB. [2020-12-09 19:59:08,965 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 56.6 MB. Free memory was 39.3 MB in the beginning and 39.2 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:59:08,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.87 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 34.7 MB in the beginning and 44.1 MB in the end (delta: -9.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 19:59:08,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.65 ms. Allocated memory is still 71.3 MB. Free memory was 44.1 MB in the beginning and 41.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:59:08,966 INFO L168 Benchmark]: Boogie Preprocessor took 31.89 ms. Allocated memory is still 71.3 MB. Free memory was 41.9 MB in the beginning and 40.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:59:08,966 INFO L168 Benchmark]: RCFGBuilder took 406.67 ms. Allocated memory is still 71.3 MB. Free memory was 40.4 MB in the beginning and 34.5 MB in the end (delta: 5.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:59:08,966 INFO L168 Benchmark]: TraceAbstraction took 178978.43 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 34.1 MB in the beginning and 24.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 16.1 GB. [2020-12-09 19:59:08,967 INFO L168 Benchmark]: Witness Printer took 3.03 ms. Allocated memory is still 86.0 MB. Free memory was 24.2 MB in the beginning and 23.4 MB in the end (delta: 823.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:59:08,968 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 56.6 MB. Free memory was 39.3 MB in the beginning and 39.2 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 358.87 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 34.7 MB in the beginning and 44.1 MB in the end (delta: -9.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.65 ms. Allocated memory is still 71.3 MB. Free memory was 44.1 MB in the beginning and 41.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.89 ms. Allocated memory is still 71.3 MB. Free memory was 41.9 MB in the beginning and 40.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 406.67 ms. Allocated memory is still 71.3 MB. Free memory was 40.4 MB in the beginning and 34.5 MB in the end (delta: 5.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 178978.43 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 34.1 MB in the beginning and 24.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 16.1 GB. * Witness Printer took 3.03 ms. Allocated memory is still 86.0 MB. Free memory was 24.2 MB in the beginning and 23.4 MB in the end (delta: 823.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 519]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L527] int length1 = __VERIFIER_nondet_int(); [L528] int length2 = __VERIFIER_nondet_int(); [L529] COND FALSE !(length1 < 1) [L532] COND FALSE !(length2 < 1) [L535] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); [L536] char* nondetString2 = (char*) __builtin_alloca (length2 * sizeof(char)); [L538] int i = 0; [L538] COND FALSE !(i< length1 -1) [L543] int i = 0; [L543] COND TRUE i< length2 -1 [L545] nondetString2[i] = __VERIFIER_nondet_char() [L543] i++ [L543] COND FALSE !(i< length2 -1) [L548] nondetString1[length1-1] = '\0' [L549] nondetString2[length2-1] = '\0' [L516] COND FALSE !(n == 0) [L519] EXPR \read(*s1) [L519] EXPR s2++ [L519] COND FALSE !(*s1 != *s2++) [L521] EXPR s1++ [L521] COND FALSE !(*s1++ == 0) [L523] EXPR --n [L523] COND TRUE --n != 0 [L519] EXPR \read(*s1) [L519] EXPR s2++ [L519] COND FALSE !(*s1 != *s2++) [L521] EXPR s1++ [L521] COND FALSE !(*s1++ == 0) [L523] EXPR --n [L523] COND TRUE --n != 0 [L519] \read(*s1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 19 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 178.9s, OverallIterations: 35, TraceHistogramMax: 5, AutomataDifference: 128.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1164 SDtfs, 7308 SDslu, 3840 SDs, 0 SdLazy, 3967 SolverSat, 299 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 44.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1469 GetRequests, 1037 SyntacticMatches, 29 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2724 ImplicationChecksByTransitivity, 111.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 1217 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 33.3s InterpolantComputationTime, 887 NumberOfCodeBlocks, 887 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1341 ConstructedInterpolants, 57 QuantifiedInterpolants, 384937 SizeOfPredicates, 425 NumberOfNonLiveVariables, 3113 ConjunctsInSsa, 622 ConjunctsInUnsatCore, 74 InterpolantComputations, 27 PerfectInterpolantSequences, 24/358 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...