./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa 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_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/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 f68b319d77fa756392ca29e618a1e0accd9b6c9e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:48:18,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:48:18,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:48:18,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:48:18,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:48:18,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:48:18,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:48:18,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:48:18,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:48:18,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:48:18,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:48:18,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:48:18,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:48:18,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:48:18,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:48:18,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:48:18,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:48:18,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:48:18,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:48:18,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:48:18,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:48:18,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:48:18,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:48:18,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:48:18,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:48:18,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:48:18,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:48:18,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:48:18,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:48:18,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:48:18,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:48:18,286 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:48:18,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:48:18,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:48:18,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:48:18,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:48:18,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:48:18,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:48:18,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:48:18,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:48:18,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:48:18,292 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-11-26 02:48:18,316 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:48:18,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:48:18,316 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:48:18,317 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:48:18,317 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:48:18,317 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:48:18,317 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:48:18,317 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:48:18,318 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:48:18,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 02:48:18,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 02:48:18,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:48:18,319 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:48:18,319 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:48:18,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:48:18,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:48:18,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:48:18,320 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 02:48:18,320 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 02:48:18,320 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 02:48:18,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:48:18,320 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:48:18,320 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:48:18,321 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:48:18,321 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:48:18,321 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:48:18,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:48:18,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:48:18,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:48:18,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:48:18,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:48:18,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:48:18,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:48:18,322 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:48:18,323 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:48:18,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:48:18,323 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_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/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 -> f68b319d77fa756392ca29e618a1e0accd9b6c9e [2019-11-26 02:48:18,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:48:18,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:48:18,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:48:18,479 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:48:18,479 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:48:18,480 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-11-26 02:48:18,532 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/data/1fa47b1bf/3fc7e8c152f24e75ac9d7d159f610986/FLAG0e52d67df [2019-11-26 02:48:18,959 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:48:18,959 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-11-26 02:48:18,974 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/data/1fa47b1bf/3fc7e8c152f24e75ac9d7d159f610986/FLAG0e52d67df [2019-11-26 02:48:18,985 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/data/1fa47b1bf/3fc7e8c152f24e75ac9d7d159f610986 [2019-11-26 02:48:18,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:48:18,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:48:18,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:48:18,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:48:18,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:48:18,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:48:18" (1/1) ... [2019-11-26 02:48:18,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14868710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:18, skipping insertion in model container [2019-11-26 02:48:18,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:48:18" (1/1) ... [2019-11-26 02:48:19,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:48:19,042 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:48:19,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:48:19,467 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:48:19,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:48:19,566 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:48:19,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:19 WrapperNode [2019-11-26 02:48:19,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:48:19,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:48:19,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:48:19,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:48:19,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:19" (1/1) ... [2019-11-26 02:48:19,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:19" (1/1) ... [2019-11-26 02:48:19,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:48:19,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:48:19,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:48:19,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:48:19,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:19" (1/1) ... [2019-11-26 02:48:19,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:19" (1/1) ... [2019-11-26 02:48:19,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:19" (1/1) ... [2019-11-26 02:48:19,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:19" (1/1) ... [2019-11-26 02:48:19,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:19" (1/1) ... [2019-11-26 02:48:19,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:19" (1/1) ... [2019-11-26 02:48:19,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:19" (1/1) ... [2019-11-26 02:48:19,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:48:19,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:48:19,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:48:19,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:48:19,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/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-11-26 02:48:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-26 02:48:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:48:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-26 02:48:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:48:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:48:19,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:48:20,169 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:48:20,170 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-26 02:48:20,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:48:20 BoogieIcfgContainer [2019-11-26 02:48:20,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:48:20,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:48:20,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:48:20,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:48:20,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:48:18" (1/3) ... [2019-11-26 02:48:20,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef532ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:48:20, skipping insertion in model container [2019-11-26 02:48:20,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:48:19" (2/3) ... [2019-11-26 02:48:20,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef532ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:48:20, skipping insertion in model container [2019-11-26 02:48:20,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:48:20" (3/3) ... [2019-11-26 02:48:20,181 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca-1.i [2019-11-26 02:48:20,189 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:48:20,198 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-26 02:48:20,210 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-26 02:48:20,228 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:48:20,228 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 02:48:20,229 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:48:20,229 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:48:20,229 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:48:20,229 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:48:20,229 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:48:20,229 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:48:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-11-26 02:48:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:48:20,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:20,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:20,258 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-11-26 02:48:20,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:20,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2019-11-26 02:48:20,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:20,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [698451328] [2019-11-26 02:48:20,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:20,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:48:20,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:20,464 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:20,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [698451328] [2019-11-26 02:48:20,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:20,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 02:48:20,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876415714] [2019-11-26 02:48:20,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:48:20,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:20,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:48:20,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:48:20,521 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 6 states. [2019-11-26 02:48:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:20,676 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2019-11-26 02:48:20,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:48:20,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-11-26 02:48:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:20,701 INFO L225 Difference]: With dead ends: 92 [2019-11-26 02:48:20,702 INFO L226 Difference]: Without dead ends: 88 [2019-11-26 02:48:20,704 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-11-26 02:48:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-26 02:48:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 51. [2019-11-26 02:48:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-26 02:48:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-26 02:48:20,736 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 7 [2019-11-26 02:48:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:20,737 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-26 02:48:20,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:48:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-26 02:48:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:48:20,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:20,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:20,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:20,938 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-11-26 02:48:20,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:20,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2019-11-26 02:48:20,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:20,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1849073340] [2019-11-26 02:48:20,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:21,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:48:21,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:21,091 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:48:21,091 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-11-26 02:48:21,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:21,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:21,106 INFO L496 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-11-26 02:48:21,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-26 02:48:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:21,133 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:21,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1849073340] [2019-11-26 02:48:21,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:21,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 02:48:21,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236617348] [2019-11-26 02:48:21,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:48:21,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:21,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:48:21,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:48:21,162 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 4 states. [2019-11-26 02:48:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:21,278 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-11-26 02:48:21,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:48:21,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-26 02:48:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:21,279 INFO L225 Difference]: With dead ends: 49 [2019-11-26 02:48:21,279 INFO L226 Difference]: Without dead ends: 49 [2019-11-26 02:48:21,280 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-11-26 02:48:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-26 02:48:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-26 02:48:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-26 02:48:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-26 02:48:21,285 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 7 [2019-11-26 02:48:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:21,285 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-26 02:48:21,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:48:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-26 02:48:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:48:21,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:21,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:21,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:21,489 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-11-26 02:48:21,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:21,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2019-11-26 02:48:21,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:21,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [988909342] [2019-11-26 02:48:21,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:21,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:48:21,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:21,617 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-11-26 02:48:21,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:48:21,627 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-11-26 02:48:21,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:21,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:21,671 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-11-26 02:48:21,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:21,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:21,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:21,704 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-11-26 02:48:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:21,725 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:21,816 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:48:21,824 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-11-26 02:48:21,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:21,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:21,836 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:48:21,837 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:21,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:21,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:21,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-11-26 02:48:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:21,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [988909342] [2019-11-26 02:48:21,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:21,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-26 02:48:21,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973610551] [2019-11-26 02:48:21,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:48:21,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:21,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:48:21,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:48:21,858 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 5 states. [2019-11-26 02:48:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:22,483 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-11-26 02:48:22,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:48:22,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-11-26 02:48:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:22,486 INFO L225 Difference]: With dead ends: 89 [2019-11-26 02:48:22,486 INFO L226 Difference]: Without dead ends: 89 [2019-11-26 02:48:22,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:48:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-26 02:48:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 51. [2019-11-26 02:48:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-26 02:48:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2019-11-26 02:48:22,493 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 7 [2019-11-26 02:48:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:22,493 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2019-11-26 02:48:22,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:48:22,493 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2019-11-26 02:48:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:48:22,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:22,494 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:22,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:22,696 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-11-26 02:48:22,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash -533876960, now seen corresponding path program 1 times [2019-11-26 02:48:22,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:22,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1867619413] [2019-11-26 02:48:22,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:22,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 02:48:22,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:22,803 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_35|]} [2019-11-26 02:48:22,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:48:22,811 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-11-26 02:48:22,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:22,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:22,834 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-11-26 02:48:22,835 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:22,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:22,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:22,852 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-26 02:48:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:22,866 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:22,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:48:22,952 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:48:22,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:48:22,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:22,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:22,967 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-26 02:48:22,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-26 02:48:22,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:11 [2019-11-26 02:48:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:22,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1867619413] [2019-11-26 02:48:22,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:22,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-26 02:48:22,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653253420] [2019-11-26 02:48:22,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:48:22,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:22,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:48:22,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:48:22,997 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2019-11-26 02:48:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:23,419 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2019-11-26 02:48:23,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:48:23,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-26 02:48:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:23,422 INFO L225 Difference]: With dead ends: 85 [2019-11-26 02:48:23,422 INFO L226 Difference]: Without dead ends: 85 [2019-11-26 02:48:23,422 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-11-26 02:48:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-26 02:48:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2019-11-26 02:48:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-26 02:48:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-11-26 02:48:23,427 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 9 [2019-11-26 02:48:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:23,427 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-11-26 02:48:23,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:48:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-11-26 02:48:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:48:23,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:23,428 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:23,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:23,630 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-11-26 02:48:23,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2019-11-26 02:48:23,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:23,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [492490916] [2019-11-26 02:48:23,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:23,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:48:23,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:23,713 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:23,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [492490916] [2019-11-26 02:48:23,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:23,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 02:48:23,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041053223] [2019-11-26 02:48:23,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:48:23,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:23,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:48:23,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:48:23,738 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 6 states. [2019-11-26 02:48:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:23,811 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2019-11-26 02:48:23,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:48:23,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-26 02:48:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:23,817 INFO L225 Difference]: With dead ends: 90 [2019-11-26 02:48:23,817 INFO L226 Difference]: Without dead ends: 90 [2019-11-26 02:48:23,817 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-11-26 02:48:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-26 02:48:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-11-26 02:48:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-26 02:48:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-11-26 02:48:23,825 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 9 [2019-11-26 02:48:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:23,825 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-11-26 02:48:23,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:48:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-11-26 02:48:23,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:48:23,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:23,826 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:24,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:24,028 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-11-26 02:48:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:24,028 INFO L82 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2019-11-26 02:48:24,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:24,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1045230291] [2019-11-26 02:48:24,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:24,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:48:24,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:24,116 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:48:24,116 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-11-26 02:48:24,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:24,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:24,123 INFO L496 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-11-26 02:48:24,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-26 02:48:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:24,140 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:24,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-11-26 02:48:24,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1045230291] [2019-11-26 02:48:24,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:24,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:48:24,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407752119] [2019-11-26 02:48:24,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:48:24,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:24,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:48:24,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:48:24,149 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 3 states. [2019-11-26 02:48:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:24,245 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2019-11-26 02:48:24,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:48:24,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 02:48:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:24,246 INFO L225 Difference]: With dead ends: 59 [2019-11-26 02:48:24,247 INFO L226 Difference]: Without dead ends: 59 [2019-11-26 02:48:24,247 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-11-26 02:48:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-26 02:48:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-26 02:48:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-26 02:48:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2019-11-26 02:48:24,252 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 9 [2019-11-26 02:48:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:24,252 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2019-11-26 02:48:24,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:48:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2019-11-26 02:48:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:48:24,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:24,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:24,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:24,454 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-11-26 02:48:24,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:24,454 INFO L82 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2019-11-26 02:48:24,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:24,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [494782060] [2019-11-26 02:48:24,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:24,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 02:48:24,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:24,544 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:24,544 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-11-26 02:48:24,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:24,590 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-26 02:48:24,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:24,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-11-26 02:48:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:24,618 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:24,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [494782060] [2019-11-26 02:48:24,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:24,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 02:48:24,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071044911] [2019-11-26 02:48:24,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:48:24,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:24,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:48:24,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:48:24,766 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 7 states. [2019-11-26 02:48:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:25,198 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2019-11-26 02:48:25,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:48:25,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-26 02:48:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:25,200 INFO L225 Difference]: With dead ends: 90 [2019-11-26 02:48:25,201 INFO L226 Difference]: Without dead ends: 90 [2019-11-26 02:48:25,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:48:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-26 02:48:25,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-11-26 02:48:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-26 02:48:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-26 02:48:25,207 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 9 [2019-11-26 02:48:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:25,207 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-26 02:48:25,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:48:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-26 02:48:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:48:25,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:25,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:25,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:25,411 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-11-26 02:48:25,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:25,411 INFO L82 PathProgramCache]: Analyzing trace with hash 629683418, now seen corresponding path program 1 times [2019-11-26 02:48:25,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:25,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [911624551] [2019-11-26 02:48:25,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:25,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:48:25,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:25,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:25,512 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-11-26 02:48:25,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:25,538 INFO L567 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-11-26 02:48:25,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:25,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-11-26 02:48:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:25,550 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:25,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [911624551] [2019-11-26 02:48:25,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:25,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-26 02:48:25,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533824675] [2019-11-26 02:48:25,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:48:25,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:25,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:48:25,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:48:25,635 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 6 states. [2019-11-26 02:48:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:25,919 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2019-11-26 02:48:25,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:48:25,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-26 02:48:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:25,920 INFO L225 Difference]: With dead ends: 87 [2019-11-26 02:48:25,920 INFO L226 Difference]: Without dead ends: 87 [2019-11-26 02:48:25,921 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-11-26 02:48:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-26 02:48:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 60. [2019-11-26 02:48:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-26 02:48:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2019-11-26 02:48:25,925 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 10 [2019-11-26 02:48:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:25,925 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2019-11-26 02:48:25,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:48:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2019-11-26 02:48:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:48:25,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:25,926 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:26,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:26,127 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-11-26 02:48:26,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:26,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2019-11-26 02:48:26,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:26,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1391841979] [2019-11-26 02:48:26,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:26,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:48:26,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:26,214 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_34|], 1=[|v_#valid_42|]} [2019-11-26 02:48:26,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:48:26,226 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-11-26 02:48:26,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:26,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:26,263 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-11-26 02:48:26,263 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:26,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:26,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:26,280 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-11-26 02:48:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:26,359 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:26,859 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:48:26,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:48:26,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:26,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:26,864 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-26 02:48:26,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:26,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-11-26 02:48:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:26,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1391841979] [2019-11-26 02:48:26,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881899777] [2019-11-26 02:48:26,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:48:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:26,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:48:26,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:26,911 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_44|]} [2019-11-26 02:48:26,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:48:26,919 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-11-26 02:48:26,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:26,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:26,941 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-11-26 02:48:26,941 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:26,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:26,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:26,954 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-26 02:48:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:27,045 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:27,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:48:27,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 13 [2019-11-26 02:48:27,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786231909] [2019-11-26 02:48:27,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 02:48:27,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:27,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 02:48:27,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:48:27,383 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 14 states. [2019-11-26 02:48:28,353 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-26 02:48:28,801 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-26 02:48:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:29,167 INFO L93 Difference]: Finished difference Result 184 states and 208 transitions. [2019-11-26 02:48:29,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:48:29,168 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2019-11-26 02:48:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:29,169 INFO L225 Difference]: With dead ends: 184 [2019-11-26 02:48:29,169 INFO L226 Difference]: Without dead ends: 184 [2019-11-26 02:48:29,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-11-26 02:48:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-26 02:48:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 76. [2019-11-26 02:48:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-26 02:48:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2019-11-26 02:48:29,175 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 11 [2019-11-26 02:48:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:29,176 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2019-11-26 02:48:29,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 02:48:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2019-11-26 02:48:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:48:29,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:29,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:29,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:48:29,579 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-11-26 02:48:29,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:29,579 INFO L82 PathProgramCache]: Analyzing trace with hash -464624129, now seen corresponding path program 1 times [2019-11-26 02:48:29,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:29,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1209017096] [2019-11-26 02:48:29,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:29,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:48:29,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:29,697 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:29,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:48:29,818 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-11-26 02:48:29,818 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:48:29,827 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 12 treesize of output 10 [2019-11-26 02:48:29,828 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:48:29,844 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 14 treesize of output 12 [2019-11-26 02:48:29,845 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:48:29,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:29,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-26 02:48:29,894 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:43, output treesize:35 [2019-11-26 02:48:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:30,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1209017096] [2019-11-26 02:48:30,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:30,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-26 02:48:30,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858706638] [2019-11-26 02:48:30,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:48:30,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:30,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:48:30,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:48:30,065 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 10 states. [2019-11-26 02:48:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:30,814 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2019-11-26 02:48:30,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:48:30,815 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-26 02:48:30,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:30,817 INFO L225 Difference]: With dead ends: 150 [2019-11-26 02:48:30,817 INFO L226 Difference]: Without dead ends: 150 [2019-11-26 02:48:30,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:48:30,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-26 02:48:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 76. [2019-11-26 02:48:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-26 02:48:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2019-11-26 02:48:30,823 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 12 [2019-11-26 02:48:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:30,823 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2019-11-26 02:48:30,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:48:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2019-11-26 02:48:30,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:48:30,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:30,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:31,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:31,027 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-11-26 02:48:31,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:31,027 INFO L82 PathProgramCache]: Analyzing trace with hash -464624130, now seen corresponding path program 1 times [2019-11-26 02:48:31,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:31,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [753338147] [2019-11-26 02:48:31,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:31,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:48:31,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:31,124 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:31,141 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 14 treesize of output 10 [2019-11-26 02:48:31,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:31,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:31,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:31,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2019-11-26 02:48:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:31,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [753338147] [2019-11-26 02:48:31,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:31,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 02:48:31,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909294402] [2019-11-26 02:48:31,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:48:31,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:31,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:48:31,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:48:31,144 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand 4 states. [2019-11-26 02:48:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:31,231 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2019-11-26 02:48:31,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:48:31,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-26 02:48:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:31,232 INFO L225 Difference]: With dead ends: 74 [2019-11-26 02:48:31,232 INFO L226 Difference]: Without dead ends: 74 [2019-11-26 02:48:31,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:48:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-26 02:48:31,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-26 02:48:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 02:48:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2019-11-26 02:48:31,238 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 12 [2019-11-26 02:48:31,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:31,238 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2019-11-26 02:48:31,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:48:31,238 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2019-11-26 02:48:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:48:31,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:31,239 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:31,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:31,440 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-11-26 02:48:31,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:31,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2019-11-26 02:48:31,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:31,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [16208953] [2019-11-26 02:48:31,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/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-11-26 02:48:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:31,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:48:31,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:31,546 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:31,546 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-11-26 02:48:31,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:31,577 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-26 02:48:31,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:31,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-26 02:48:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:31,680 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:32,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [16208953] [2019-11-26 02:48:32,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274904795] [2019-11-26 02:48:32,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/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-11-26 02:48:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:32,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:48:32,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:32,318 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:32,318 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-11-26 02:48:32,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:32,375 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-26 02:48:32,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:32,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-26 02:48:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:32,476 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:33,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:48:33,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 17 [2019-11-26 02:48:33,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148709947] [2019-11-26 02:48:33,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 02:48:33,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:33,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 02:48:33,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-11-26 02:48:33,219 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 18 states. [2019-11-26 02:48:34,486 WARN L192 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-11-26 02:48:34,725 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-11-26 02:48:35,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:35,099 INFO L93 Difference]: Finished difference Result 127 states and 145 transitions. [2019-11-26 02:48:35,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:48:35,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 13 [2019-11-26 02:48:35,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:35,101 INFO L225 Difference]: With dead ends: 127 [2019-11-26 02:48:35,101 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:48:35,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-11-26 02:48:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:48:35,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 71. [2019-11-26 02:48:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-26 02:48:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2019-11-26 02:48:35,105 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 13 [2019-11-26 02:48:35,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:35,105 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2019-11-26 02:48:35,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 02:48:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2019-11-26 02:48:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 02:48:35,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:35,106 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:35,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:48:35,507 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-11-26 02:48:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:35,508 INFO L82 PathProgramCache]: Analyzing trace with hash 172810975, now seen corresponding path program 1 times [2019-11-26 02:48:35,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:35,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [398852580] [2019-11-26 02:48:35,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:35,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 02:48:35,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:35,602 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:48:35,602 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-11-26 02:48:35,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:35,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:35,607 INFO L496 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-11-26 02:48:35,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-26 02:48:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:35,640 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:35,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [398852580] [2019-11-26 02:48:35,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:35,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 5 [2019-11-26 02:48:35,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182426674] [2019-11-26 02:48:35,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:48:35,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:35,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:48:35,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:48:35,660 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand 6 states. [2019-11-26 02:48:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:35,757 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2019-11-26 02:48:35,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:48:35,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-26 02:48:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:35,758 INFO L225 Difference]: With dead ends: 70 [2019-11-26 02:48:35,758 INFO L226 Difference]: Without dead ends: 70 [2019-11-26 02:48:35,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:48:35,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-26 02:48:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-26 02:48:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 02:48:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2019-11-26 02:48:35,761 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 14 [2019-11-26 02:48:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:35,761 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2019-11-26 02:48:35,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:48:35,761 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2019-11-26 02:48:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 02:48:35,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:35,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:35,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:35,964 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-11-26 02:48:35,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:35,964 INFO L82 PathProgramCache]: Analyzing trace with hash 172810976, now seen corresponding path program 1 times [2019-11-26 02:48:35,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:35,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1579081310] [2019-11-26 02:48:35,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:36,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:48:36,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:36,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:36,120 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-11-26 02:48:36,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:36,149 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-26 02:48:36,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:36,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-26 02:48:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:36,175 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:36,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1579081310] [2019-11-26 02:48:36,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:36,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-26 02:48:36,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065377599] [2019-11-26 02:48:36,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:48:36,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:36,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:48:36,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:48:36,300 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 10 states. [2019-11-26 02:48:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:36,941 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2019-11-26 02:48:36,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:48:36,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-11-26 02:48:36,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:36,943 INFO L225 Difference]: With dead ends: 99 [2019-11-26 02:48:36,943 INFO L226 Difference]: Without dead ends: 99 [2019-11-26 02:48:36,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:48:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-26 02:48:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 72. [2019-11-26 02:48:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-26 02:48:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2019-11-26 02:48:36,946 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 14 [2019-11-26 02:48:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:36,946 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2019-11-26 02:48:36,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:48:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2019-11-26 02:48:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:48:36,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:36,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:37,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:37,151 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-11-26 02:48:37,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:37,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1432376192, now seen corresponding path program 1 times [2019-11-26 02:48:37,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:37,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [743935404] [2019-11-26 02:48:37,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:37,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:48:37,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:37,306 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:37,324 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 14 treesize of output 10 [2019-11-26 02:48:37,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:37,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:37,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:37,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2019-11-26 02:48:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:37,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [743935404] [2019-11-26 02:48:37,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:37,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 02:48:37,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590164479] [2019-11-26 02:48:37,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:48:37,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:37,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:48:37,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:48:37,328 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 5 states. [2019-11-26 02:48:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:37,491 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2019-11-26 02:48:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:48:37,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-26 02:48:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:37,493 INFO L225 Difference]: With dead ends: 71 [2019-11-26 02:48:37,493 INFO L226 Difference]: Without dead ends: 71 [2019-11-26 02:48:37,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:48:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-26 02:48:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-26 02:48:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-26 02:48:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2019-11-26 02:48:37,495 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 16 [2019-11-26 02:48:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:37,496 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2019-11-26 02:48:37,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:48:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2019-11-26 02:48:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:48:37,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:37,500 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:37,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:37,701 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-11-26 02:48:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:37,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1432376191, now seen corresponding path program 1 times [2019-11-26 02:48:37,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:37,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1107853698] [2019-11-26 02:48:37,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:37,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:48:37,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:37,832 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:37,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:48:37,930 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 12 treesize of output 10 [2019-11-26 02:48:37,930 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:48:37,940 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 14 treesize of output 12 [2019-11-26 02:48:37,940 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:48:37,978 INFO L567 ElimStorePlain]: treesize reduction 7, result has 69.6 percent of original size [2019-11-26 02:48:37,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-26 02:48:37,979 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2019-11-26 02:48:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:38,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1107853698] [2019-11-26 02:48:38,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:38,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-26 02:48:38,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468326859] [2019-11-26 02:48:38,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:48:38,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:38,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:48:38,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:48:38,079 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand 10 states. [2019-11-26 02:48:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:38,404 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-11-26 02:48:38,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:48:38,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-26 02:48:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:38,406 INFO L225 Difference]: With dead ends: 90 [2019-11-26 02:48:38,406 INFO L226 Difference]: Without dead ends: 90 [2019-11-26 02:48:38,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:48:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-26 02:48:38,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2019-11-26 02:48:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 02:48:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2019-11-26 02:48:38,408 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 16 [2019-11-26 02:48:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:38,409 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2019-11-26 02:48:38,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:48:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2019-11-26 02:48:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:48:38,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:38,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:38,612 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:38,612 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-11-26 02:48:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2124032946, now seen corresponding path program 1 times [2019-11-26 02:48:38,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:38,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [414130596] [2019-11-26 02:48:38,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:38,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 02:48:38,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:38,721 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:48:38,721 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-11-26 02:48:38,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:38,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:38,726 INFO L496 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-11-26 02:48:38,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-26 02:48:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:38,747 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:38,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [414130596] [2019-11-26 02:48:38,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:38,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 5 [2019-11-26 02:48:38,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297436616] [2019-11-26 02:48:38,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:48:38,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:38,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:48:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:48:38,779 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 6 states. [2019-11-26 02:48:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:38,898 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2019-11-26 02:48:38,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:48:38,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-26 02:48:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:38,900 INFO L225 Difference]: With dead ends: 69 [2019-11-26 02:48:38,900 INFO L226 Difference]: Without dead ends: 69 [2019-11-26 02:48:38,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:48:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-26 02:48:38,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-26 02:48:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-26 02:48:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2019-11-26 02:48:38,902 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 18 [2019-11-26 02:48:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:38,902 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2019-11-26 02:48:38,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:48:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2019-11-26 02:48:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:48:38,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:38,903 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:39,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:39,106 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-11-26 02:48:39,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:39,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2124032945, now seen corresponding path program 1 times [2019-11-26 02:48:39,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:39,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [927217548] [2019-11-26 02:48:39,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:39,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-26 02:48:39,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:39,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:39,230 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-11-26 02:48:39,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:39,251 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-26 02:48:39,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:39,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-26 02:48:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:39,293 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:39,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [927217548] [2019-11-26 02:48:39,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:48:39,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-26 02:48:39,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590614170] [2019-11-26 02:48:39,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:48:39,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:48:39,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:48:39,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:48:39,500 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 12 states. [2019-11-26 02:48:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:48:40,459 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2019-11-26 02:48:40,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 02:48:40,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-26 02:48:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:48:40,461 INFO L225 Difference]: With dead ends: 124 [2019-11-26 02:48:40,461 INFO L226 Difference]: Without dead ends: 124 [2019-11-26 02:48:40,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-11-26 02:48:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-26 02:48:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 73. [2019-11-26 02:48:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-26 02:48:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2019-11-26 02:48:40,464 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 18 [2019-11-26 02:48:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:48:40,464 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2019-11-26 02:48:40,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:48:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2019-11-26 02:48:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:48:40,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:48:40,465 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:48:40,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:40,665 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-11-26 02:48:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:48:40,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2123984178, now seen corresponding path program 1 times [2019-11-26 02:48:40,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:48:40,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1606673587] [2019-11-26 02:48:40,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5c2ea7b-f9d6-4bc8-9cb7-3c1d134e7252/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:48:40,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-26 02:48:40,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:48:40,836 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-11-26 02:48:40,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:48:40,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:40,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:48:40,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-26 02:48:40,971 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:40,971 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 24 [2019-11-26 02:48:40,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:48:40,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:48:40,973 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:48:40,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:48:40,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:48:40,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-26 02:48:40,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2019-11-26 02:48:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:48:41,022 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:48:41,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:48:41,425 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-11-26 02:48:41,428 INFO L168 Benchmark]: Toolchain (without parser) took 22440.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 943.4 MB in the beginning and 901.4 MB in the end (delta: 42.0 MB). Peak memory consumption was 337.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:48:41,428 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:48:41,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 578.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -221.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:48:41,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:48:41,429 INFO L168 Benchmark]: Boogie Preprocessor took 51.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:48:41,429 INFO L168 Benchmark]: RCFGBuilder took 506.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:48:41,430 INFO L168 Benchmark]: TraceAbstraction took 21254.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 106.4 MB). Free memory was 1.1 GB in the beginning and 901.4 MB in the end (delta: 226.4 MB). Peak memory consumption was 332.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:48:41,431 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 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 578.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -221.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 506.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21254.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 106.4 MB). Free memory was 1.1 GB in the beginning and 901.4 MB in the end (delta: 226.4 MB). Peak memory consumption was 332.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...