./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 2d5a995d825785bc5dc95f3825623b1e4ecd07fe ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 2d5a995d825785bc5dc95f3825623b1e4ecd07fe ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:19:42,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:19:42,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:19:42,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:19:42,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:19:42,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:19:42,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:19:42,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:19:42,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:19:42,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:19:42,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:19:42,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:19:42,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:19:42,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:19:42,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:19:42,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:19:42,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:19:42,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:19:42,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:19:42,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:19:42,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:19:42,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:19:42,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:19:42,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:19:42,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:19:42,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:19:42,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:19:42,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:19:42,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:19:42,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:19:42,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:19:42,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:19:42,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:19:42,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:19:42,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:19:42,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:19:42,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:19:42,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:19:42,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:19:42,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:19:42,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:19:42,169 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 21:19:42,179 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:19:42,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:19:42,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:19:42,180 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:19:42,180 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:19:42,180 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:19:42,180 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:19:42,180 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:19:42,180 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:19:42,180 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:19:42,180 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:19:42,181 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:19:42,181 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:19:42,181 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:19:42,181 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:19:42,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 21:19:42,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 21:19:42,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:19:42,182 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:19:42,182 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 21:19:42,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:19:42,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:19:42,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:19:42,182 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 21:19:42,182 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 21:19:42,183 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 21:19:42,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:19:42,183 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:19:42,183 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:19:42,183 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:19:42,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:19:42,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:19:42,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:19:42,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:19:42,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:19:42,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:19:42,184 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:19:42,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:19:42,184 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:19:42,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:19:42,184 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 -> 2d5a995d825785bc5dc95f3825623b1e4ecd07fe [2019-12-07 21:19:42,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:19:42,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:19:42,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:19:42,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:19:42,306 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:19:42,306 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2019-12-07 21:19:42,351 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/data/d90ab192d/984ed0095d7e41dfa7863f28f0990067/FLAGd659e55e6 [2019-12-07 21:19:42,743 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:19:42,743 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2019-12-07 21:19:42,752 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/data/d90ab192d/984ed0095d7e41dfa7863f28f0990067/FLAGd659e55e6 [2019-12-07 21:19:43,137 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/data/d90ab192d/984ed0095d7e41dfa7863f28f0990067 [2019-12-07 21:19:43,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:19:43,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:19:43,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:19:43,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:19:43,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:19:43,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:19:43" (1/1) ... [2019-12-07 21:19:43,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e739d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43, skipping insertion in model container [2019-12-07 21:19:43,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:19:43" (1/1) ... [2019-12-07 21:19:43,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:19:43,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:19:43,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:19:43,433 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:19:43,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:19:43,499 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:19:43,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43 WrapperNode [2019-12-07 21:19:43,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:19:43,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:19:43,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:19:43,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:19:43,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43" (1/1) ... [2019-12-07 21:19:43,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43" (1/1) ... [2019-12-07 21:19:43,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:19:43,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:19:43,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:19:43,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:19:43,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43" (1/1) ... [2019-12-07 21:19:43,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43" (1/1) ... [2019-12-07 21:19:43,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43" (1/1) ... [2019-12-07 21:19:43,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43" (1/1) ... [2019-12-07 21:19:43,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43" (1/1) ... [2019-12-07 21:19:43,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43" (1/1) ... [2019-12-07 21:19:43,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43" (1/1) ... [2019-12-07 21:19:43,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:19:43,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:19:43,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:19:43,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:19:43,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 21:19:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:19:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:19:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:19:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:19:43,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:19:43,902 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:19:43,902 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 21:19:43,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:43 BoogieIcfgContainer [2019-12-07 21:19:43,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:19:43,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:19:43,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:19:43,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:19:43,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:19:43" (1/3) ... [2019-12-07 21:19:43,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ff64e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:19:43, skipping insertion in model container [2019-12-07 21:19:43,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:43" (2/3) ... [2019-12-07 21:19:43,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ff64e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:19:43, skipping insertion in model container [2019-12-07 21:19:43,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:43" (3/3) ... [2019-12-07 21:19:43,908 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca-1.i [2019-12-07 21:19:43,914 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:19:43,918 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 21:19:43,926 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 21:19:43,938 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:19:43,938 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 21:19:43,938 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:19:43,938 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:19:43,938 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:19:43,938 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:19:43,938 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:19:43,938 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:19:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-12-07 21:19:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 21:19:43,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:43,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 21:19:43,953 INFO L410 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]=== [2019-12-07 21:19:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash 165069, now seen corresponding path program 1 times [2019-12-07 21:19:43,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:43,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714579007] [2019-12-07 21:19:43,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:44,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714579007] [2019-12-07 21:19:44,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:44,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:19:44,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674398524] [2019-12-07 21:19:44,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:44,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:44,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:44,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:44,086 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-12-07 21:19:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:44,128 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-12-07 21:19:44,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:44,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 21:19:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,136 INFO L225 Difference]: With dead ends: 38 [2019-12-07 21:19:44,136 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 21:19:44,137 INFO L630 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 [2019-12-07 21:19:44,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 21:19:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-12-07 21:19:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 21:19:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-12-07 21:19:44,160 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 3 [2019-12-07 21:19:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:44,160 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-12-07 21:19:44,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-12-07 21:19:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 21:19:44,161 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:44,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 21:19:44,161 INFO L410 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]=== [2019-12-07 21:19:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:44,161 INFO L82 PathProgramCache]: Analyzing trace with hash 165070, now seen corresponding path program 1 times [2019-12-07 21:19:44,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:44,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421240968] [2019-12-07 21:19:44,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:44,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421240968] [2019-12-07 21:19:44,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:44,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:44,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162201897] [2019-12-07 21:19:44,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:19:44,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:44,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:19:44,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:19:44,214 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 4 states. [2019-12-07 21:19:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:44,300 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2019-12-07 21:19:44,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:19:44,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 21:19:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,301 INFO L225 Difference]: With dead ends: 72 [2019-12-07 21:19:44,301 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 21:19:44,302 INFO L630 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 [2019-12-07 21:19:44,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 21:19:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 39. [2019-12-07 21:19:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 21:19:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-12-07 21:19:44,306 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 3 [2019-12-07 21:19:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:44,306 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-12-07 21:19:44,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:19:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2019-12-07 21:19:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 21:19:44,307 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:44,307 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 21:19:44,307 INFO L410 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]=== [2019-12-07 21:19:44,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:44,308 INFO L82 PathProgramCache]: Analyzing trace with hash 5235302, now seen corresponding path program 1 times [2019-12-07 21:19:44,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:44,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303771977] [2019-12-07 21:19:44,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:44,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303771977] [2019-12-07 21:19:44,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:44,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:19:44,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112736904] [2019-12-07 21:19:44,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:44,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:44,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:44,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:44,349 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 3 states. [2019-12-07 21:19:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:44,370 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2019-12-07 21:19:44,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:44,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 21:19:44,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,371 INFO L225 Difference]: With dead ends: 38 [2019-12-07 21:19:44,371 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 21:19:44,371 INFO L630 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 [2019-12-07 21:19:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 21:19:44,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 21:19:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 21:19:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-12-07 21:19:44,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 4 [2019-12-07 21:19:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:44,374 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-12-07 21:19:44,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:44,374 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-12-07 21:19:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 21:19:44,375 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:44,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 21:19:44,375 INFO L410 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]=== [2019-12-07 21:19:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:44,375 INFO L82 PathProgramCache]: Analyzing trace with hash 5232037, now seen corresponding path program 1 times [2019-12-07 21:19:44,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:44,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201559409] [2019-12-07 21:19:44,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:44,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201559409] [2019-12-07 21:19:44,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:44,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:19:44,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381746134] [2019-12-07 21:19:44,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:44,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:44,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:44,395 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 3 states. [2019-12-07 21:19:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:44,416 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-12-07 21:19:44,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:44,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 21:19:44,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,417 INFO L225 Difference]: With dead ends: 36 [2019-12-07 21:19:44,417 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 21:19:44,418 INFO L630 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 [2019-12-07 21:19:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 21:19:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 21:19:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 21:19:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-12-07 21:19:44,420 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 4 [2019-12-07 21:19:44,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:44,421 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-12-07 21:19:44,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-12-07 21:19:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 21:19:44,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:44,421 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 21:19:44,421 INFO L410 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]=== [2019-12-07 21:19:44,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:44,421 INFO L82 PathProgramCache]: Analyzing trace with hash 5232038, now seen corresponding path program 1 times [2019-12-07 21:19:44,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:44,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277423255] [2019-12-07 21:19:44,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:44,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277423255] [2019-12-07 21:19:44,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:44,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:19:44,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877670881] [2019-12-07 21:19:44,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:19:44,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:44,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:19:44,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:19:44,462 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 5 states. [2019-12-07 21:19:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:44,529 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-12-07 21:19:44,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:19:44,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-12-07 21:19:44,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,530 INFO L225 Difference]: With dead ends: 65 [2019-12-07 21:19:44,530 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 21:19:44,531 INFO L630 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 [2019-12-07 21:19:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 21:19:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-12-07 21:19:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 21:19:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-12-07 21:19:44,534 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 4 [2019-12-07 21:19:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:44,534 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-12-07 21:19:44,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:19:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-12-07 21:19:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 21:19:44,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:44,534 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-12-07 21:19:44,534 INFO L410 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]=== [2019-12-07 21:19:44,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:44,535 INFO L82 PathProgramCache]: Analyzing trace with hash 158734875, now seen corresponding path program 1 times [2019-12-07 21:19:44,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:44,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727090703] [2019-12-07 21:19:44,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:44,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727090703] [2019-12-07 21:19:44,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689792432] [2019-12-07 21:19:44,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 21:19:44,633 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:44,662 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_46|], 1=[|ULTIMATE.start_main_old_#valid|]} [2019-12-07 21:19:44,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:19:44,676 INFO L377 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 [2019-12-07 21:19:44,676 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:44,684 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:44,689 INFO L377 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 [2019-12-07 21:19:44,690 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:44,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:44,698 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:19:44,698 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 21:19:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:44,718 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:44,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:19:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:44,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [349021908] [2019-12-07 21:19:44,776 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2019-12-07 21:19:44,777 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:19:44,780 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:19:44,785 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:19:44,785 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:19:44,964 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:19:45,130 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:19:45,404 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 21:19:45,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:19:45,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-12-07 21:19:45,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400337548] [2019-12-07 21:19:45,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 21:19:45,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:45,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 21:19:45,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:19:45,405 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 9 states. [2019-12-07 21:19:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:45,567 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2019-12-07 21:19:45,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:19:45,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-12-07 21:19:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:45,569 INFO L225 Difference]: With dead ends: 102 [2019-12-07 21:19:45,569 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 21:19:45,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-07 21:19:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 21:19:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 35. [2019-12-07 21:19:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 21:19:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-12-07 21:19:45,574 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 5 [2019-12-07 21:19:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:45,574 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-12-07 21:19:45,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 21:19:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2019-12-07 21:19:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 21:19:45,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:45,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 21:19:45,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:19:45,776 INFO L410 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]=== [2019-12-07 21:19:45,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash 162294356, now seen corresponding path program 1 times [2019-12-07 21:19:45,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:45,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766752051] [2019-12-07 21:19:45,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:45,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766752051] [2019-12-07 21:19:45,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:45,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:19:45,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869034667] [2019-12-07 21:19:45,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:45,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:45,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:45,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:45,869 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 3 states. [2019-12-07 21:19:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:45,927 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2019-12-07 21:19:45,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:45,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 21:19:45,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:45,928 INFO L225 Difference]: With dead ends: 34 [2019-12-07 21:19:45,929 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 21:19:45,929 INFO L630 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 [2019-12-07 21:19:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 21:19:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-07 21:19:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 21:19:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-12-07 21:19:45,932 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 5 [2019-12-07 21:19:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:45,932 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-12-07 21:19:45,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-12-07 21:19:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 21:19:45,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:45,933 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-07 21:19:45,933 INFO L410 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]=== [2019-12-07 21:19:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:45,933 INFO L82 PathProgramCache]: Analyzing trace with hash 733109027, now seen corresponding path program 1 times [2019-12-07 21:19:45,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:45,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259025138] [2019-12-07 21:19:45,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:45,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259025138] [2019-12-07 21:19:45,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540687636] [2019-12-07 21:19:45,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:45,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 21:19:45,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:46,035 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:46,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [210773025] [2019-12-07 21:19:46,082 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 21:19:46,082 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:19:46,082 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:19:46,082 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:19:46,082 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:19:46,285 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:19:46,637 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 21:19:46,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:19:46,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2019-12-07 21:19:46,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981856143] [2019-12-07 21:19:46,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:19:46,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:46,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:19:46,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:19:46,638 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 10 states. [2019-12-07 21:19:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:46,765 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-12-07 21:19:46,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:19:46,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-12-07 21:19:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:46,766 INFO L225 Difference]: With dead ends: 86 [2019-12-07 21:19:46,766 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 21:19:46,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:19:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 21:19:46,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 31. [2019-12-07 21:19:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 21:19:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-12-07 21:19:46,768 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2019-12-07 21:19:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:46,768 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-12-07 21:19:46,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:19:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-12-07 21:19:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 21:19:46,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:46,769 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:46,969 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:19:46,971 INFO L410 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]=== [2019-12-07 21:19:46,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1219779455, now seen corresponding path program 1 times [2019-12-07 21:19:46,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:46,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138621119] [2019-12-07 21:19:46,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:47,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138621119] [2019-12-07 21:19:47,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:47,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:47,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646278594] [2019-12-07 21:19:47,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:19:47,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:47,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:19:47,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:19:47,048 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 4 states. [2019-12-07 21:19:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:47,072 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-12-07 21:19:47,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:19:47,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 21:19:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:47,072 INFO L225 Difference]: With dead ends: 30 [2019-12-07 21:19:47,072 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 21:19:47,073 INFO L630 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 [2019-12-07 21:19:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 21:19:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 21:19:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 21:19:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-12-07 21:19:47,074 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 8 [2019-12-07 21:19:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:47,074 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-12-07 21:19:47,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:19:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-12-07 21:19:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:19:47,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:47,075 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:47,075 INFO L410 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]=== [2019-12-07 21:19:47,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:47,075 INFO L82 PathProgramCache]: Analyzing trace with hash 841549668, now seen corresponding path program 1 times [2019-12-07 21:19:47,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:47,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553680265] [2019-12-07 21:19:47,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:47,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553680265] [2019-12-07 21:19:47,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:47,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:19:47,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918142566] [2019-12-07 21:19:47,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:19:47,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:47,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:19:47,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:19:47,092 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2019-12-07 21:19:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:47,115 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-12-07 21:19:47,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:19:47,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 21:19:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:47,116 INFO L225 Difference]: With dead ends: 25 [2019-12-07 21:19:47,116 INFO L226 Difference]: Without dead ends: 25 [2019-12-07 21:19:47,116 INFO L630 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 [2019-12-07 21:19:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-12-07 21:19:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-12-07 21:19:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 21:19:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-12-07 21:19:47,118 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2019-12-07 21:19:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:47,118 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-12-07 21:19:47,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:19:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-12-07 21:19:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:19:47,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:47,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:47,119 INFO L410 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]=== [2019-12-07 21:19:47,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:47,119 INFO L82 PathProgramCache]: Analyzing trace with hash 841549669, now seen corresponding path program 1 times [2019-12-07 21:19:47,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:47,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347585906] [2019-12-07 21:19:47,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:47,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347585906] [2019-12-07 21:19:47,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:47,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:19:47,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36541221] [2019-12-07 21:19:47,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:19:47,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:47,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:19:47,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:19:47,148 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2019-12-07 21:19:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:47,178 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-12-07 21:19:47,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:19:47,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 21:19:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:47,179 INFO L225 Difference]: With dead ends: 39 [2019-12-07 21:19:47,179 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 21:19:47,179 INFO L630 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 [2019-12-07 21:19:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 21:19:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-12-07 21:19:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 21:19:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-12-07 21:19:47,181 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 9 [2019-12-07 21:19:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:47,181 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-12-07 21:19:47,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:19:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-12-07 21:19:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:19:47,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:47,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:47,182 INFO L410 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]=== [2019-12-07 21:19:47,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:47,182 INFO L82 PathProgramCache]: Analyzing trace with hash 318235976, now seen corresponding path program 1 times [2019-12-07 21:19:47,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:47,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172715609] [2019-12-07 21:19:47,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:47,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172715609] [2019-12-07 21:19:47,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:47,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:47,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317339039] [2019-12-07 21:19:47,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:47,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:47,195 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 3 states. [2019-12-07 21:19:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:47,206 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-12-07 21:19:47,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:47,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 21:19:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:47,208 INFO L225 Difference]: With dead ends: 31 [2019-12-07 21:19:47,208 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 21:19:47,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:47,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 21:19:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 21:19:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 21:19:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-12-07 21:19:47,210 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 10 [2019-12-07 21:19:47,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:47,211 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-12-07 21:19:47,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-12-07 21:19:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:19:47,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:47,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:47,211 INFO L410 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]=== [2019-12-07 21:19:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:47,211 INFO L82 PathProgramCache]: Analyzing trace with hash 318235977, now seen corresponding path program 1 times [2019-12-07 21:19:47,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:47,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633750302] [2019-12-07 21:19:47,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:47,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633750302] [2019-12-07 21:19:47,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:47,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:47,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429608940] [2019-12-07 21:19:47,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:19:47,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:47,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:19:47,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:19:47,235 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2019-12-07 21:19:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:47,266 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-12-07 21:19:47,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:19:47,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 21:19:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:47,267 INFO L225 Difference]: With dead ends: 33 [2019-12-07 21:19:47,267 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 21:19:47,267 INFO L630 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 [2019-12-07 21:19:47,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 21:19:47,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-12-07 21:19:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 21:19:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-12-07 21:19:47,269 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 10 [2019-12-07 21:19:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:47,269 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-12-07 21:19:47,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:19:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-12-07 21:19:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 21:19:47,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:47,270 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:47,270 INFO L410 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]=== [2019-12-07 21:19:47,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:47,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1398118962, now seen corresponding path program 1 times [2019-12-07 21:19:47,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:47,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057558018] [2019-12-07 21:19:47,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:47,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057558018] [2019-12-07 21:19:47,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:47,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:19:47,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387678397] [2019-12-07 21:19:47,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:47,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:47,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:47,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:47,282 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2019-12-07 21:19:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:47,288 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-12-07 21:19:47,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:47,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 21:19:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:47,288 INFO L225 Difference]: With dead ends: 32 [2019-12-07 21:19:47,288 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 21:19:47,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 21:19:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 21:19:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 21:19:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-12-07 21:19:47,290 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 14 [2019-12-07 21:19:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:47,290 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-12-07 21:19:47,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-12-07 21:19:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:19:47,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:47,291 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:47,291 INFO L410 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]=== [2019-12-07 21:19:47,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:47,291 INFO L82 PathProgramCache]: Analyzing trace with hash 456494658, now seen corresponding path program 1 times [2019-12-07 21:19:47,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:47,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935073431] [2019-12-07 21:19:47,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:47,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935073431] [2019-12-07 21:19:47,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:47,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:19:47,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747097599] [2019-12-07 21:19:47,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:47,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:47,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:47,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:47,303 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2019-12-07 21:19:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:47,308 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-12-07 21:19:47,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:47,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 21:19:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:47,308 INFO L225 Difference]: With dead ends: 32 [2019-12-07 21:19:47,308 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 21:19:47,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 21:19:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 21:19:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 21:19:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-12-07 21:19:47,311 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2019-12-07 21:19:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:47,311 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-12-07 21:19:47,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-12-07 21:19:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 21:19:47,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:47,312 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:47,312 INFO L410 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]=== [2019-12-07 21:19:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:47,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1356994247, now seen corresponding path program 1 times [2019-12-07 21:19:47,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:47,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022827724] [2019-12-07 21:19:47,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:47,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022827724] [2019-12-07 21:19:47,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:47,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:19:47,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305303958] [2019-12-07 21:19:47,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:19:47,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:47,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:19:47,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:19:47,410 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2019-12-07 21:19:47,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:47,555 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-12-07 21:19:47,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:19:47,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 21:19:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:47,556 INFO L225 Difference]: With dead ends: 46 [2019-12-07 21:19:47,556 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 21:19:47,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:19:47,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 21:19:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-12-07 21:19:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 21:19:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-12-07 21:19:47,558 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 17 [2019-12-07 21:19:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:47,558 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-12-07 21:19:47,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:19:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-12-07 21:19:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:19:47,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:47,558 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:47,559 INFO L410 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]=== [2019-12-07 21:19:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:47,559 INFO L82 PathProgramCache]: Analyzing trace with hash 283894100, now seen corresponding path program 1 times [2019-12-07 21:19:47,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:47,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627405215] [2019-12-07 21:19:47,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:47,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627405215] [2019-12-07 21:19:47,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234763331] [2019-12-07 21:19:47,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:47,636 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 21:19:47,637 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:19:47,786 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:47,872 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 21:19:47,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [975748034] [2019-12-07 21:19:47,873 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 21:19:47,873 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:19:47,873 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:19:47,873 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:19:47,873 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:19:47,884 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@741ee33a at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:19:47,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:19:47,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-12-07 21:19:47,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117386098] [2019-12-07 21:19:47,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:19:47,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:47,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:19:47,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-07 21:19:47,886 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 8 states. [2019-12-07 21:19:47,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 21:19:48,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:19:48,088 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.modelcheckerutils.smt.IncrementalPlicationChecker@741ee33a at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) 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:234) 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:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) 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:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:19:48,095 INFO L168 Benchmark]: Toolchain (without parser) took 4953.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 938.2 MB in the beginning and 857.4 MB in the end (delta: 80.8 MB). Peak memory consumption was 243.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:19:48,095 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:19:48,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:19:48,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:19:48,098 INFO L168 Benchmark]: Boogie Preprocessor took 19.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:19:48,099 INFO L168 Benchmark]: RCFGBuilder took 351.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:19:48,100 INFO L168 Benchmark]: TraceAbstraction took 4188.46 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.0 GB in the beginning and 857.4 MB in the end (delta: 190.7 MB). Peak memory consumption was 240.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:19:48,105 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 351.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4188.46 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.0 GB in the beginning and 857.4 MB in the end (delta: 190.7 MB). Peak memory consumption was 240.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@741ee33a de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@741ee33a: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 21:19:49,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:19:49,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:19:49,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:19:49,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:19:49,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:19:49,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:19:49,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:19:49,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:19:49,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:19:49,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:19:49,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:19:49,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:19:49,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:19:49,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:19:49,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:19:49,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:19:49,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:19:49,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:19:49,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:19:49,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:19:49,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:19:49,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:19:49,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:19:49,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:19:49,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:19:49,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:19:49,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:19:49,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:19:49,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:19:49,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:19:49,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:19:49,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:19:49,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:19:49,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:19:49,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:19:49,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:19:49,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:19:49,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:19:49,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:19:49,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:19:49,514 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 21:19:49,524 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:19:49,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:19:49,524 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:19:49,524 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:19:49,525 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:19:49,525 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:19:49,525 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:19:49,525 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:19:49,525 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:19:49,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 21:19:49,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 21:19:49,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:19:49,526 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:19:49,526 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 21:19:49,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:19:49,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:19:49,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:19:49,527 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 21:19:49,527 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 21:19:49,527 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 21:19:49,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:19:49,528 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:19:49,528 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 21:19:49,528 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 21:19:49,528 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:19:49,528 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:19:49,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:19:49,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 21:19:49,529 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:19:49,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:19:49,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:19:49,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:19:49,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:19:49,529 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 21:19:49,529 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 21:19:49,530 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:19:49,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:19:49,530 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 -> 2d5a995d825785bc5dc95f3825623b1e4ecd07fe [2019-12-07 21:19:49,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:19:49,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:19:49,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:19:49,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:19:49,716 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:19:49,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2019-12-07 21:19:49,753 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/data/00a21d157/7b91e816e2c645e4ba4edb073c4ffdb0/FLAGbd0324718 [2019-12-07 21:19:50,214 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:19:50,215 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2019-12-07 21:19:50,225 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/data/00a21d157/7b91e816e2c645e4ba4edb073c4ffdb0/FLAGbd0324718 [2019-12-07 21:19:50,234 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/data/00a21d157/7b91e816e2c645e4ba4edb073c4ffdb0 [2019-12-07 21:19:50,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:19:50,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:19:50,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:19:50,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:19:50,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:19:50,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:19:50" (1/1) ... [2019-12-07 21:19:50,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bf51b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50, skipping insertion in model container [2019-12-07 21:19:50,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:19:50" (1/1) ... [2019-12-07 21:19:50,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:19:50,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:19:50,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:19:50,484 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:19:50,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:19:50,548 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:19:50,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50 WrapperNode [2019-12-07 21:19:50,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:19:50,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:19:50,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:19:50,549 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:19:50,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50" (1/1) ... [2019-12-07 21:19:50,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50" (1/1) ... [2019-12-07 21:19:50,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:19:50,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:19:50,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:19:50,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:19:50,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50" (1/1) ... [2019-12-07 21:19:50,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50" (1/1) ... [2019-12-07 21:19:50,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50" (1/1) ... [2019-12-07 21:19:50,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50" (1/1) ... [2019-12-07 21:19:50,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50" (1/1) ... [2019-12-07 21:19:50,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50" (1/1) ... [2019-12-07 21:19:50,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50" (1/1) ... [2019-12-07 21:19:50,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:19:50,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:19:50,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:19:50,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:19:50,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-07 21:19:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:19:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-12-07 21:19:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:19:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:19:50,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:19:50,946 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:19:50,947 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 21:19:50,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:50 BoogieIcfgContainer [2019-12-07 21:19:50,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:19:50,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:19:50,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:19:50,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:19:50,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:19:50" (1/3) ... [2019-12-07 21:19:50,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8fc850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:19:50, skipping insertion in model container [2019-12-07 21:19:50,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:50" (2/3) ... [2019-12-07 21:19:50,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8fc850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:19:50, skipping insertion in model container [2019-12-07 21:19:50,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:50" (3/3) ... [2019-12-07 21:19:50,952 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca-1.i [2019-12-07 21:19:50,958 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:19:50,963 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 21:19:50,970 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 21:19:50,982 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:19:50,982 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 21:19:50,982 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:19:50,982 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:19:50,983 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:19:50,983 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:19:50,983 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:19:50,983 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:19:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2019-12-07 21:19:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 21:19:50,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:50,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:50,998 INFO L410 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]=== [2019-12-07 21:19:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:51,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2019-12-07 21:19:51,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:19:51,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522146325] [2019-12-07 21:19:51,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:51,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 21:19:51,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:51,084 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:51,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522146325] [2019-12-07 21:19:51,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:51,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 21:19:51,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946558306] [2019-12-07 21:19:51,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:19:51,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:19:51,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:19:51,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:19:51,121 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2019-12-07 21:19:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:51,214 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2019-12-07 21:19:51,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:19:51,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 21:19:51,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:51,223 INFO L225 Difference]: With dead ends: 106 [2019-12-07 21:19:51,223 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 21:19:51,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:19:51,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 21:19:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 58. [2019-12-07 21:19:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 21:19:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-12-07 21:19:51,251 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 7 [2019-12-07 21:19:51,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:51,251 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-12-07 21:19:51,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:19:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-12-07 21:19:51,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 21:19:51,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:51,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:51,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 21:19:51,453 INFO L410 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]=== [2019-12-07 21:19:51,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:51,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2019-12-07 21:19:51,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:19:51,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059038934] [2019-12-07 21:19:51,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:51,539 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:19:51,540 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:51,588 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 21:19:51,588 INFO L377 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 [2019-12-07 21:19:51,589 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:51,595 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:51,596 INFO L534 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. [2019-12-07 21:19:51,597 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-12-07 21:19:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:51,612 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:51,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059038934] [2019-12-07 21:19:51,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:51,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 21:19:51,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760201481] [2019-12-07 21:19:51,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:19:51,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:19:51,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:19:51,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:19:51,624 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 4 states. [2019-12-07 21:19:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:51,708 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-12-07 21:19:51,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:51,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 21:19:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:51,709 INFO L225 Difference]: With dead ends: 56 [2019-12-07 21:19:51,709 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 21:19:51,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:19:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 21:19:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 21:19:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 21:19:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2019-12-07 21:19:51,714 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 7 [2019-12-07 21:19:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:51,715 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2019-12-07 21:19:51,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:19:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2019-12-07 21:19:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 21:19:51,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:51,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:51,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 21:19:51,917 INFO L410 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]=== [2019-12-07 21:19:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:51,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2019-12-07 21:19:51,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:19:51,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409449782] [2019-12-07 21:19:51,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:52,009 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:19:52,010 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:52,020 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-12-07 21:19:52,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:19:52,027 INFO L377 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 [2019-12-07 21:19:52,027 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:52,052 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:52,058 INFO L377 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 [2019-12-07 21:19:52,059 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:52,076 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:52,077 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:19:52,077 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-12-07 21:19:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:52,092 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:52,188 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 21:19:52,193 INFO L377 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 [2019-12-07 21:19:52,194 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:52,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:52,202 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 21:19:52,203 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:52,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:52,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:19:52,210 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-12-07 21:19:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:52,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409449782] [2019-12-07 21:19:52,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:52,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 21:19:52,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047558659] [2019-12-07 21:19:52,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:19:52,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:19:52,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:19:52,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:19:52,227 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 6 states. [2019-12-07 21:19:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:52,687 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2019-12-07 21:19:52,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:19:52,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 21:19:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:52,689 INFO L225 Difference]: With dead ends: 103 [2019-12-07 21:19:52,690 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 21:19:52,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:19:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 21:19:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 58. [2019-12-07 21:19:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 21:19:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-12-07 21:19:52,695 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 7 [2019-12-07 21:19:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:52,695 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-12-07 21:19:52,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:19:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-12-07 21:19:52,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:19:52,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:52,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:52,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 21:19:52,897 INFO L410 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]=== [2019-12-07 21:19:52,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:52,898 INFO L82 PathProgramCache]: Analyzing trace with hash -533876960, now seen corresponding path program 1 times [2019-12-07 21:19:52,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:19:52,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625942546] [2019-12-07 21:19:52,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:52,936 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 21:19:52,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:52,943 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_35|]} [2019-12-07 21:19:52,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:19:52,948 INFO L377 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 [2019-12-07 21:19:52,949 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:52,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:52,965 INFO L377 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 [2019-12-07 21:19:52,965 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:52,976 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:52,976 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:19:52,977 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 21:19:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:52,987 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:53,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:19:53,075 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 21:19:53,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:19:53,083 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:53,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:53,087 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 21:19:53,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:19:53,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 [2019-12-07 21:19:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:53,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625942546] [2019-12-07 21:19:53,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:53,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 21:19:53,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730676309] [2019-12-07 21:19:53,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:19:53,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:19:53,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:19:53,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:19:53,108 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2019-12-07 21:19:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:53,547 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2019-12-07 21:19:53,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:19:53,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 21:19:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:53,550 INFO L225 Difference]: With dead ends: 99 [2019-12-07 21:19:53,550 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 21:19:53,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:19:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 21:19:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 57. [2019-12-07 21:19:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 21:19:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2019-12-07 21:19:53,555 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 9 [2019-12-07 21:19:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:53,556 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2019-12-07 21:19:53,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:19:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2019-12-07 21:19:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:19:53,556 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:53,557 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:53,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 21:19:53,758 INFO L410 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]=== [2019-12-07 21:19:53,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:53,759 INFO L82 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2019-12-07 21:19:53,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:19:53,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491672013] [2019-12-07 21:19:53,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:53,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 21:19:53,856 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:53,884 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:53,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491672013] [2019-12-07 21:19:53,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:53,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 21:19:53,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867604978] [2019-12-07 21:19:53,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:19:53,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:19:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:19:53,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:19:53,936 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 6 states. [2019-12-07 21:19:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:54,026 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2019-12-07 21:19:54,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:19:54,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 21:19:54,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:54,028 INFO L225 Difference]: With dead ends: 104 [2019-12-07 21:19:54,028 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 21:19:54,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:19:54,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 21:19:54,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 68. [2019-12-07 21:19:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 21:19:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-12-07 21:19:54,034 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 9 [2019-12-07 21:19:54,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:54,035 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-12-07 21:19:54,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:19:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-12-07 21:19:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:19:54,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:54,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:54,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 21:19:54,237 INFO L410 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]=== [2019-12-07 21:19:54,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:54,238 INFO L82 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2019-12-07 21:19:54,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:19:54,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465640200] [2019-12-07 21:19:54,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:54,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 21:19:54,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:54,338 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 21:19:54,339 INFO L377 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 [2019-12-07 21:19:54,339 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:54,343 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:54,343 INFO L534 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. [2019-12-07 21:19:54,344 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 21:19:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:54,351 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:54,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465640200] [2019-12-07 21:19:54,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:54,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 21:19:54,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002335285] [2019-12-07 21:19:54,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:54,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:19:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:54,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:54,357 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 3 states. [2019-12-07 21:19:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:54,411 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2019-12-07 21:19:54,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:54,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 21:19:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:54,412 INFO L225 Difference]: With dead ends: 66 [2019-12-07 21:19:54,412 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 21:19:54,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 21:19:54,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-07 21:19:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 21:19:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2019-12-07 21:19:54,415 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 9 [2019-12-07 21:19:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:54,415 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2019-12-07 21:19:54,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2019-12-07 21:19:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:19:54,416 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:54,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:54,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 21:19:54,616 INFO L410 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]=== [2019-12-07 21:19:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:54,616 INFO L82 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2019-12-07 21:19:54,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:19:54,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073846202] [2019-12-07 21:19:54,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:54,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 21:19:54,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:54,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:54,667 INFO L377 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 [2019-12-07 21:19:54,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:54,697 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 21:19:54,698 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:19:54,698 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-12-07 21:19:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:54,729 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:54,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073846202] [2019-12-07 21:19:54,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:54,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 21:19:54,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777438707] [2019-12-07 21:19:54,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:19:54,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:19:54,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:19:54,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:19:54,893 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 8 states. [2019-12-07 21:19:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:55,317 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2019-12-07 21:19:55,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:19:55,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 21:19:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:55,319 INFO L225 Difference]: With dead ends: 104 [2019-12-07 21:19:55,319 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 21:19:55,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:19:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 21:19:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 68. [2019-12-07 21:19:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 21:19:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2019-12-07 21:19:55,323 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 9 [2019-12-07 21:19:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:55,323 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-12-07 21:19:55,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:19:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2019-12-07 21:19:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:19:55,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:55,324 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:55,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 21:19:55,526 INFO L410 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]=== [2019-12-07 21:19:55,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:55,527 INFO L82 PathProgramCache]: Analyzing trace with hash 629683418, now seen corresponding path program 1 times [2019-12-07 21:19:55,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:19:55,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951043946] [2019-12-07 21:19:55,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:55,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:19:55,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:55,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:55,667 INFO L377 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 [2019-12-07 21:19:55,667 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:55,696 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 21:19:55,696 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:19:55,696 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-12-07 21:19:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:55,707 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:55,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951043946] [2019-12-07 21:19:55,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:55,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 21:19:55,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966860729] [2019-12-07 21:19:55,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:19:55,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:19:55,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:19:55,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:19:55,818 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 6 states. [2019-12-07 21:19:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:56,059 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2019-12-07 21:19:56,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:19:56,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 21:19:56,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:56,061 INFO L225 Difference]: With dead ends: 101 [2019-12-07 21:19:56,061 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 21:19:56,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:19:56,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 21:19:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 67. [2019-12-07 21:19:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 21:19:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-12-07 21:19:56,063 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 10 [2019-12-07 21:19:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:56,064 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-12-07 21:19:56,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:19:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-12-07 21:19:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:19:56,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:56,064 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:56,265 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 21:19:56,266 INFO L410 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]=== [2019-12-07 21:19:56,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:56,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2019-12-07 21:19:56,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:19:56,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183363188] [2019-12-07 21:19:56,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:19:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:56,379 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 21:19:56,380 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:56,393 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_34|], 1=[|v_#valid_42|]} [2019-12-07 21:19:56,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:19:56,402 INFO L377 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 [2019-12-07 21:19:56,402 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:56,434 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:56,443 INFO L377 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 [2019-12-07 21:19:56,444 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:56,475 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:56,476 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:19:56,476 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 21:19:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:56,638 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:57,100 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 21:19:57,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:19:57,105 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:57,105 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:57,105 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 21:19:57,105 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:19:57,106 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:1 [2019-12-07 21:19:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:57,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183363188] [2019-12-07 21:19:57,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1891194708] [2019-12-07 21:19:57,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:19:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:57,167 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 21:19:57,168 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:57,172 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_44|]} [2019-12-07 21:19:57,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:19:57,178 INFO L377 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 [2019-12-07 21:19:57,178 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:57,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:57,200 INFO L377 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 [2019-12-07 21:19:57,200 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:57,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:57,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:19:57,217 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 21:19:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:57,344 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:57,812 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 21:19:57,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:19:57,816 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:57,817 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:57,818 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 21:19:57,818 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:19:57,818 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 21:19:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:57,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779699178] [2019-12-07 21:19:57,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:19:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:57,955 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:19:57,957 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:19:57,963 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_46|]} [2019-12-07 21:19:57,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:19:57,974 INFO L377 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 [2019-12-07 21:19:57,974 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:58,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:58,025 INFO L377 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 [2019-12-07 21:19:58,026 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:19:58,063 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:19:58,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:19:58,064 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 21:19:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:58,271 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:19:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:58,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:19:58,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 4, 5] total 18 [2019-12-07 21:19:58,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718081730] [2019-12-07 21:19:58,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 21:19:58,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:19:58,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 21:19:58,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-12-07 21:19:58,279 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 19 states. [2019-12-07 21:19:58,859 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 21:19:59,125 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 21:19:59,697 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-12-07 21:20:00,318 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-12-07 21:20:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:00,913 INFO L93 Difference]: Finished difference Result 263 states and 312 transitions. [2019-12-07 21:20:00,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 21:20:00,914 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2019-12-07 21:20:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:00,915 INFO L225 Difference]: With dead ends: 263 [2019-12-07 21:20:00,915 INFO L226 Difference]: Without dead ends: 263 [2019-12-07 21:20:00,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2019-12-07 21:20:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-12-07 21:20:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 91. [2019-12-07 21:20:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 21:20:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2019-12-07 21:20:00,920 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 11 [2019-12-07 21:20:00,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:00,920 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2019-12-07 21:20:00,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 21:20:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2019-12-07 21:20:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 21:20:00,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:00,921 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:01,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:20:01,524 INFO L410 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]=== [2019-12-07 21:20:01,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:01,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2019-12-07 21:20:01,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:01,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387456958] [2019-12-07 21:20:01,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 21:20:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:01,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 21:20:01,568 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:01,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:01,592 INFO L377 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 [2019-12-07 21:20:01,592 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:01,624 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 21:20:01,625 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:01,625 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 21:20:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:01,705 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:02,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387456958] [2019-12-07 21:20:02,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [620670212] [2019-12-07 21:20:02,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:20:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:02,143 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 21:20:02,144 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:02,161 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:02,161 INFO L377 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 [2019-12-07 21:20:02,161 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:02,191 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 21:20:02,191 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:02,191 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 21:20:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:02,193 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:02,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357003113] [2019-12-07 21:20:02,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:20:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:02,234 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:20:02,235 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:02,256 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:02,256 INFO L377 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 [2019-12-07 21:20:02,256 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:02,292 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 21:20:02,293 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:02,293 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 21:20:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:02,370 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:03,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:20:03,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 5, 6, 6] total 16 [2019-12-07 21:20:03,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041073850] [2019-12-07 21:20:03,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 21:20:03,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:03,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 21:20:03,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:20:03,106 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 17 states. [2019-12-07 21:20:04,010 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-12-07 21:20:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:04,461 INFO L93 Difference]: Finished difference Result 162 states and 194 transitions. [2019-12-07 21:20:04,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:20:04,462 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-12-07 21:20:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:04,464 INFO L225 Difference]: With dead ends: 162 [2019-12-07 21:20:04,464 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 21:20:04,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2019-12-07 21:20:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 21:20:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 88. [2019-12-07 21:20:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 21:20:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2019-12-07 21:20:04,469 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 13 [2019-12-07 21:20:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:04,469 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2019-12-07 21:20:04,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 21:20:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2019-12-07 21:20:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 21:20:04,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:04,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:05,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:20:05,072 INFO L410 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]=== [2019-12-07 21:20:05,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:05,073 INFO L82 PathProgramCache]: Analyzing trace with hash 172810813, now seen corresponding path program 1 times [2019-12-07 21:20:05,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:05,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554124063] [2019-12-07 21:20:05,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:20:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:05,147 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 21:20:05,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:05,151 INFO L377 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 [2019-12-07 21:20:05,151 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:05,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:05,152 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:05,153 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 21:20:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:07,207 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:11,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554124063] [2019-12-07 21:20:11,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:11,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2019-12-07 21:20:11,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072782030] [2019-12-07 21:20:11,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 21:20:11,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:11,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 21:20:11,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=45, Unknown=3, NotChecked=0, Total=72 [2019-12-07 21:20:11,370 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand 9 states. [2019-12-07 21:20:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:21,551 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2019-12-07 21:20:21,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:20:21,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-12-07 21:20:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:21,553 INFO L225 Difference]: With dead ends: 87 [2019-12-07 21:20:21,553 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 21:20:21,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=29, Invalid=58, Unknown=3, NotChecked=0, Total=90 [2019-12-07 21:20:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 21:20:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-12-07 21:20:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 21:20:21,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2019-12-07 21:20:21,555 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 14 [2019-12-07 21:20:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:21,560 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2019-12-07 21:20:21,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 21:20:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2019-12-07 21:20:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 21:20:21,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:21,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:21,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 21:20:21,761 INFO L410 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]=== [2019-12-07 21:20:21,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1062175016, now seen corresponding path program 1 times [2019-12-07 21:20:21,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:21,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191364946] [2019-12-07 21:20:21,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:20:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:21,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:20:21,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:21,802 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:21,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191364946] [2019-12-07 21:20:21,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:21,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 21:20:21,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847606476] [2019-12-07 21:20:21,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:21,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:21,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:21,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:21,806 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand 4 states. [2019-12-07 21:20:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:21,882 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2019-12-07 21:20:21,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:20:21,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 21:20:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:21,883 INFO L225 Difference]: With dead ends: 79 [2019-12-07 21:20:21,884 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 21:20:21,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 21:20:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-12-07 21:20:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 21:20:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-12-07 21:20:21,885 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 15 [2019-12-07 21:20:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:21,885 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-12-07 21:20:21,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-12-07 21:20:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 21:20:21,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:21,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:22,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 21:20:22,087 INFO L410 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]=== [2019-12-07 21:20:22,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:22,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1062175017, now seen corresponding path program 1 times [2019-12-07 21:20:22,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:22,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253267819] [2019-12-07 21:20:22,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 21:20:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:22,168 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 21:20:22,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:22,212 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:22,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:22,297 INFO L377 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 [2019-12-07 21:20:22,297 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:22,307 INFO L377 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 [2019-12-07 21:20:22,308 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:22,342 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:22,343 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 21:20:22,343 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-12-07 21:20:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:22,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253267819] [2019-12-07 21:20:22,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:22,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 21:20:22,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857811421] [2019-12-07 21:20:22,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:20:22,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:22,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:20:22,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:20:22,466 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 10 states. [2019-12-07 21:20:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:23,144 INFO L93 Difference]: Finished difference Result 154 states and 182 transitions. [2019-12-07 21:20:23,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 21:20:23,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-07 21:20:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:23,146 INFO L225 Difference]: With dead ends: 154 [2019-12-07 21:20:23,146 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 21:20:23,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-12-07 21:20:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 21:20:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 86. [2019-12-07 21:20:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 21:20:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2019-12-07 21:20:23,148 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 15 [2019-12-07 21:20:23,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:23,149 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2019-12-07 21:20:23,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:20:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2019-12-07 21:20:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:20:23,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:23,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:23,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 21:20:23,350 INFO L410 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]=== [2019-12-07 21:20:23,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:23,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1432312828, now seen corresponding path program 1 times [2019-12-07 21:20:23,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:23,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940518389] [2019-12-07 21:20:23,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 21:20:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:23,392 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:20:23,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:23,403 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 21:20:23,403 INFO L377 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 [2019-12-07 21:20:23,404 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:23,407 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:23,407 INFO L534 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. [2019-12-07 21:20:23,408 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 21:20:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:23,417 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:23,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940518389] [2019-12-07 21:20:23,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:23,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 21:20:23,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805401181] [2019-12-07 21:20:23,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:23,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:23,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:23,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:23,420 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand 4 states. [2019-12-07 21:20:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:23,488 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-12-07 21:20:23,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:20:23,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 21:20:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:23,490 INFO L225 Difference]: With dead ends: 84 [2019-12-07 21:20:23,490 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 21:20:23,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 21:20:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-12-07 21:20:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 21:20:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2019-12-07 21:20:23,492 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 16 [2019-12-07 21:20:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:23,493 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2019-12-07 21:20:23,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2019-12-07 21:20:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:20:23,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:23,494 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:23,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 21:20:23,694 INFO L410 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]=== [2019-12-07 21:20:23,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:23,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1432312827, now seen corresponding path program 1 times [2019-12-07 21:20:23,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:23,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323687209] [2019-12-07 21:20:23,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:20:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:23,737 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:20:23,738 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:23,753 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:23,753 INFO L377 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 [2019-12-07 21:20:23,753 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:23,772 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 21:20:23,772 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:23,772 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 21:20:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:23,786 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:23,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323687209] [2019-12-07 21:20:23,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:23,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 21:20:23,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555810294] [2019-12-07 21:20:23,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:20:23,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:23,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:20:23,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:20:23,857 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand 8 states. [2019-12-07 21:20:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:24,278 INFO L93 Difference]: Finished difference Result 133 states and 156 transitions. [2019-12-07 21:20:24,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:20:24,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 21:20:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:24,279 INFO L225 Difference]: With dead ends: 133 [2019-12-07 21:20:24,279 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 21:20:24,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:20:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 21:20:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2019-12-07 21:20:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 21:20:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2019-12-07 21:20:24,281 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 16 [2019-12-07 21:20:24,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:24,281 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2019-12-07 21:20:24,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:20:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2019-12-07 21:20:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:20:24,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:24,282 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:24,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 21:20:24,483 INFO L410 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]=== [2019-12-07 21:20:24,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:24,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1455987438, now seen corresponding path program 1 times [2019-12-07 21:20:24,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:24,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676981590] [2019-12-07 21:20:24,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:20:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:24,576 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 21:20:24,577 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:24,580 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:24,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676981590] [2019-12-07 21:20:24,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:24,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 21:20:24,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714944835] [2019-12-07 21:20:24,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:20:24,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:20:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:24,581 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand 3 states. [2019-12-07 21:20:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:24,588 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2019-12-07 21:20:24,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:20:24,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 21:20:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:24,589 INFO L225 Difference]: With dead ends: 82 [2019-12-07 21:20:24,589 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 21:20:24,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 21:20:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-12-07 21:20:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 21:20:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2019-12-07 21:20:24,591 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 20 [2019-12-07 21:20:24,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:24,591 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2019-12-07 21:20:24,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:20:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2019-12-07 21:20:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:20:24,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:24,592 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:24,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 21:20:24,793 INFO L410 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]=== [2019-12-07 21:20:24,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:24,793 INFO L82 PathProgramCache]: Analyzing trace with hash 420786095, now seen corresponding path program 1 times [2019-12-07 21:20:24,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:24,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064922638] [2019-12-07 21:20:24,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:20:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:24,919 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 21:20:24,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:24,923 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:24,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064922638] [2019-12-07 21:20:24,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:24,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 21:20:24,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033375909] [2019-12-07 21:20:24,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:20:24,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:24,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:20:24,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:24,924 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 3 states. [2019-12-07 21:20:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:24,931 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2019-12-07 21:20:24,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:20:24,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 21:20:24,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:24,933 INFO L225 Difference]: With dead ends: 82 [2019-12-07 21:20:24,933 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 21:20:24,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 21:20:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-12-07 21:20:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 21:20:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2019-12-07 21:20:24,934 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 23 [2019-12-07 21:20:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:24,935 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2019-12-07 21:20:24,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:20:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2019-12-07 21:20:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:20:24,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:24,935 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:25,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 21:20:25,136 INFO L410 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]=== [2019-12-07 21:20:25,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:25,137 INFO L82 PathProgramCache]: Analyzing trace with hash -591263241, now seen corresponding path program 2 times [2019-12-07 21:20:25,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:25,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855985905] [2019-12-07 21:20:25,138 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:20:25,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 21:20:25,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:20:25,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 21:20:25,213 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:25,220 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_51|], 1=[|v_#valid_60|]} [2019-12-07 21:20:25,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:20:25,227 INFO L377 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 [2019-12-07 21:20:25,227 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:25,244 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:25,249 INFO L377 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 [2019-12-07 21:20:25,250 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:25,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:25,266 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:25,266 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 21:20:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:25,484 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:26,527 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 21:20:26,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:20:26,531 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:26,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:26,532 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 21:20:26,532 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:26,532 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 21:20:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:26,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855985905] [2019-12-07 21:20:26,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1954877183] [2019-12-07 21:20:26,535 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:20:26,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 21:20:26,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:20:26,621 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 21:20:26,622 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:26,625 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_53|], 1=[|v_#valid_62|]} [2019-12-07 21:20:26,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:20:26,630 INFO L377 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 [2019-12-07 21:20:26,630 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:26,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:26,650 INFO L377 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 [2019-12-07 21:20:26,650 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:26,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:26,666 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:26,666 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 21:20:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:27,084 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:29,141 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 21:20:29,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:20:29,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:29,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:29,148 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 21:20:29,148 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:29,148 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:1 [2019-12-07 21:20:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:29,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987899967] [2019-12-07 21:20:29,151 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:20:29,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 21:20:29,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:20:29,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 21:20:29,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:29,195 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_55|], 1=[|v_#valid_64|]} [2019-12-07 21:20:29,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:20:29,200 INFO L377 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 [2019-12-07 21:20:29,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:29,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:29,222 INFO L377 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 [2019-12-07 21:20:29,222 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:29,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:29,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:29,238 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 21:20:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:29,350 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:29,355 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 21:20:29,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:20:29,360 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:29,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:29,361 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 21:20:29,361 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:29,361 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 21:20:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:29,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:20:29,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 9, 8, 8] total 29 [2019-12-07 21:20:29,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839675394] [2019-12-07 21:20:29,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 21:20:29,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:29,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 21:20:29,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-12-07 21:20:29,365 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand 30 states. [2019-12-07 21:20:32,743 WARN L192 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-12-07 21:20:34,571 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-07 21:20:37,884 WARN L192 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-07 21:20:39,579 WARN L192 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-12-07 21:20:40,449 WARN L192 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-07 21:20:43,425 WARN L192 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-07 21:20:44,980 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-07 21:20:45,653 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-12-07 21:20:47,428 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 21:20:48,360 WARN L192 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-07 21:20:48,857 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 21:20:50,230 WARN L192 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-07 21:20:51,346 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-07 21:20:52,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:52,726 INFO L93 Difference]: Finished difference Result 459 states and 496 transitions. [2019-12-07 21:20:52,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 21:20:52,729 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2019-12-07 21:20:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:52,730 INFO L225 Difference]: With dead ends: 459 [2019-12-07 21:20:52,730 INFO L226 Difference]: Without dead ends: 459 [2019-12-07 21:20:52,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=665, Invalid=1785, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 21:20:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-07 21:20:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 129. [2019-12-07 21:20:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 21:20:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 156 transitions. [2019-12-07 21:20:52,735 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 156 transitions. Word has length 23 [2019-12-07 21:20:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:52,735 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 156 transitions. [2019-12-07 21:20:52,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 21:20:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 156 transitions. [2019-12-07 21:20:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 21:20:52,735 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:52,735 INFO L410 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] [2019-12-07 21:20:53,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3,24 cvc4 --incremental --print-success --lang smt --rewrite-divk,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:20:53,337 INFO L410 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]=== [2019-12-07 21:20:53,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:53,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2103285548, now seen corresponding path program 1 times [2019-12-07 21:20:53,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:53,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687837432] [2019-12-07 21:20:53,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/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 [2019-12-07 21:20:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:53,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 21:20:53,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:53,411 INFO L377 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 [2019-12-07 21:20:53,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:53,415 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:53,415 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:53,416 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 21:20:53,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:53,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:53,532 INFO L377 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 [2019-12-07 21:20:53,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:20:53,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:20:53,534 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:53,544 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:53,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:20:53,545 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 21:20:53,545 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2019-12-07 21:20:53,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:53,587 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:53,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:53,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:53,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687837432] [2019-12-07 21:20:53,841 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 21:20:53,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1878180051] [2019-12-07 21:20:53,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:20:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:53,931 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 21:20:53,932 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:53,933 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@3bfa2a76 [2019-12-07 21:20:53,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793888411] [2019-12-07 21:20:53,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48aaa7a3-4e3c-49ae-8c1f-e54ff5d80dd2/bin/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:20:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:53,973 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 21:20:53,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:53,975 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@3bfa2a76 [2019-12-07 21:20:53,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:53,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 21:20:53,975 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 21:20:53,975 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:20:54,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 cvc4 --incremental --print-success --lang smt --rewrite-divk,26 mathsat -unsat_core_generation=3 [2019-12-07 21:20:54,595 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 21:20:54,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:20:54 BoogieIcfgContainer [2019-12-07 21:20:54,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:20:54,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:20:54,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:20:54,596 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:20:54,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:50" (3/4) ... [2019-12-07 21:20:54,599 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 21:20:54,599 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:20:54,600 INFO L168 Benchmark]: Toolchain (without parser) took 64363.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 948.4 MB in the beginning and 852.5 MB in the end (delta: 95.9 MB). Peak memory consumption was 402.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:54,600 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:20:54,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:54,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:20:54,601 INFO L168 Benchmark]: Boogie Preprocessor took 22.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:20:54,601 INFO L168 Benchmark]: RCFGBuilder took 340.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:54,601 INFO L168 Benchmark]: TraceAbstraction took 63647.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 852.5 MB in the end (delta: 221.4 MB). Peak memory consumption was 395.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:54,601 INFO L168 Benchmark]: Witness Printer took 3.34 ms. Allocated memory is still 1.3 GB. Free memory is still 852.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:20:54,603 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 340.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63647.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 852.5 MB in the end (delta: 221.4 MB). Peak memory consumption was 395.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.34 ms. Allocated memory is still 1.3 GB. Free memory is still 852.5 MB. There was no memory consumed. Max. memory is 11.5 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: [L530] int length1 = __VERIFIER_nondet_int(); [L531] int length2 = __VERIFIER_nondet_int(); [L532] COND TRUE length1 < 1 [L533] length1 = 1 [L535] COND TRUE length2 < 1 [L536] length2 = 1 [L538] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); [L539] char* nondetString2 = (char*) __builtin_alloca (length2 * sizeof(char)); [L541] int i = 0; [L541] COND FALSE !(i < length1 - 1) [L546] int i = 0; [L546] COND FALSE !(i < length2 - 1) [L551] nondetString1[length1-1] = '\0' [L552] nondetString2[length2-1] = '\0' [L516] unsigned char uc1, uc2; [L517] COND FALSE !(n == 0) [L519] EXPR n-- [L519] n-- > 0 && *s1 == *s2 [L519] EXPR \read(*s1) [L519] EXPR \read(*s2) [L519] n-- > 0 && *s1 == *s2 [L519] COND TRUE n-- > 0 && *s1 == *s2 [L520] n == 0 || *s1 == '\0' [L520] EXPR \read(*s1) [L520] n == 0 || *s1 == '\0' [L520] COND FALSE !(n == 0 || *s1 == '\0') [L522] s1++ [L523] s2++ [L519] EXPR n-- [L519] n-- > 0 && *s1 == *s2 [L519] \read(*s1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 57 locations, 19 error locations. Result: UNKNOWN, OverallTime: 63.6s, OverallIterations: 19, TraceHistogramMax: 5, AutomataDifference: 40.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 813 SDtfs, 6302 SDslu, 2522 SDs, 0 SdLazy, 2175 SolverSat, 166 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 22.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 659 GetRequests, 478 SyntacticMatches, 12 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 30.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 921 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 606 ConstructedInterpolants, 12 QuantifiedInterpolants, 106626 SizeOfPredicates, 138 NumberOfNonLiveVariables, 1081 ConjunctsInSsa, 183 ConjunctsInUnsatCore, 48 InterpolantComputations, 30 PerfectInterpolantSequences, 10/226 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: 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...