./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/960521-1_1-3.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_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/960521-1_1-3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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 1ea2dc862d4e5ac3143824817093a58b58ef1480 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:38:07,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:38:07,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:38:07,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:38:07,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:38:07,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:38:07,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:38:07,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:38:07,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:38:07,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:38:07,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:38:07,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:38:07,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:38:07,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:38:07,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:38:07,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:38:07,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:38:07,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:38:07,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:38:07,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:38:07,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:38:07,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:38:07,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:38:07,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:38:07,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:38:07,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:38:07,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:38:07,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:38:07,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:38:07,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:38:07,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:38:07,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:38:07,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:38:07,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:38:07,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:38:07,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:38:07,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:38:07,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:38:07,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:38:07,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:38:07,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:38:07,717 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-11-26 02:38:07,741 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:38:07,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:38:07,742 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:38:07,742 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:38:07,742 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:38:07,743 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:38:07,743 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:38:07,743 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:38:07,743 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:38:07,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 02:38:07,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 02:38:07,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:38:07,744 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:38:07,745 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:38:07,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:38:07,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:38:07,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:38:07,745 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 02:38:07,745 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 02:38:07,746 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 02:38:07,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:38:07,746 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:38:07,746 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:38:07,746 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:38:07,746 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:38:07,747 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:38:07,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:38:07,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:38:07,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:38:07,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:38:07,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:38:07,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:38:07,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:38:07,748 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:38:07,748 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:38:07,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:38:07,749 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_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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 -> 1ea2dc862d4e5ac3143824817093a58b58ef1480 [2019-11-26 02:38:07,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:38:07,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:38:07,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:38:07,914 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:38:07,920 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:38:07,921 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/960521-1_1-3.i [2019-11-26 02:38:07,988 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/data/be916c0d5/73d48a738d0a4386b47d0f3d5719400c/FLAG2c0b9a50b [2019-11-26 02:38:08,422 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:38:08,422 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/sv-benchmarks/c/list-ext-properties/960521-1_1-3.i [2019-11-26 02:38:08,447 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/data/be916c0d5/73d48a738d0a4386b47d0f3d5719400c/FLAG2c0b9a50b [2019-11-26 02:38:08,742 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/data/be916c0d5/73d48a738d0a4386b47d0f3d5719400c [2019-11-26 02:38:08,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:38:08,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:38:08,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:38:08,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:38:08,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:38:08,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:38:08" (1/1) ... [2019-11-26 02:38:08,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4615ae1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:08, skipping insertion in model container [2019-11-26 02:38:08,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:38:08" (1/1) ... [2019-11-26 02:38:08,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:38:08,805 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:38:09,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:38:09,151 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:38:09,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:38:09,287 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:38:09,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:09 WrapperNode [2019-11-26 02:38:09,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:38:09,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:38:09,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:38:09,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:38:09,296 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:38:09" (1/1) ... [2019-11-26 02:38:09,313 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:38:09" (1/1) ... [2019-11-26 02:38:09,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:38:09,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:38:09,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:38:09,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:38:09,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:09" (1/1) ... [2019-11-26 02:38:09,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:09" (1/1) ... [2019-11-26 02:38:09,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:09" (1/1) ... [2019-11-26 02:38:09,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:09" (1/1) ... [2019-11-26 02:38:09,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:09" (1/1) ... [2019-11-26 02:38:09,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:09" (1/1) ... [2019-11-26 02:38:09,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:09" (1/1) ... [2019-11-26 02:38:09,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:38:09,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:38:09,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:38:09,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:38:09,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 02:38:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:38:09,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:38:09,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 02:38:09,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:38:09,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:38:09,822 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:38:09,823 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-26 02:38:09,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:38:09 BoogieIcfgContainer [2019-11-26 02:38:09,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:38:09,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:38:09,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:38:09,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:38:09,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:38:08" (1/3) ... [2019-11-26 02:38:09,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f1946f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:38:09, skipping insertion in model container [2019-11-26 02:38:09,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:09" (2/3) ... [2019-11-26 02:38:09,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f1946f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:38:09, skipping insertion in model container [2019-11-26 02:38:09,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:38:09" (3/3) ... [2019-11-26 02:38:09,830 INFO L109 eAbstractionObserver]: Analyzing ICFG 960521-1_1-3.i [2019-11-26 02:38:09,836 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:38:09,842 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-11-26 02:38:09,852 INFO L249 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-11-26 02:38:09,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:38:09,870 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 02:38:09,870 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:38:09,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:38:09,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:38:09,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:38:09,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:38:09,870 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:38:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-26 02:38:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-26 02:38:09,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:09,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-26 02:38:09,891 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:09,896 INFO L82 PathProgramCache]: Analyzing trace with hash 28697864, now seen corresponding path program 1 times [2019-11-26 02:38:09,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:09,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1701224431] [2019-11-26 02:38:09,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:10,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:38:10,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:10,094 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:38:10,095 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:38:10,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:10,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:10,103 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:38:10,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-26 02:38:10,125 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:38:10,125 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:10,129 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:38:10,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1701224431] [2019-11-26 02:38:10,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:10,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:38:10,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180635360] [2019-11-26 02:38:10,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:38:10,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:10,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:38:10,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:38:10,149 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2019-11-26 02:38:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:10,237 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-11-26 02:38:10,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:38:10,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-26 02:38:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:10,247 INFO L225 Difference]: With dead ends: 51 [2019-11-26 02:38:10,247 INFO L226 Difference]: Without dead ends: 49 [2019-11-26 02:38:10,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:38:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-26 02:38:10,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-26 02:38:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-26 02:38:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-11-26 02:38:10,281 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 5 [2019-11-26 02:38:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:10,281 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-11-26 02:38:10,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:38:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-11-26 02:38:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-26 02:38:10,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:10,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-26 02:38:10,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:10,484 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:10,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:10,485 INFO L82 PathProgramCache]: Analyzing trace with hash 28697865, now seen corresponding path program 1 times [2019-11-26 02:38:10,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:10,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [624128080] [2019-11-26 02:38:10,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:10,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:38:10,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:10,592 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:38:10,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:38:10,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:10,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:10,605 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:38:10,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 02:38:10,634 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:38:10,634 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:10,698 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:38:10,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [624128080] [2019-11-26 02:38:10,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:10,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-26 02:38:10,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104030002] [2019-11-26 02:38:10,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:38:10,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:10,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:38:10,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:38:10,700 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2019-11-26 02:38:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:10,965 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2019-11-26 02:38:10,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:38:10,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-11-26 02:38:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:10,971 INFO L225 Difference]: With dead ends: 141 [2019-11-26 02:38:10,972 INFO L226 Difference]: Without dead ends: 141 [2019-11-26 02:38:10,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:38:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-26 02:38:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 53. [2019-11-26 02:38:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-26 02:38:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-11-26 02:38:10,995 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 5 [2019-11-26 02:38:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:10,995 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-11-26 02:38:10,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:38:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-11-26 02:38:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:38:10,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:10,997 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-11-26 02:38:11,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:11,207 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:11,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1810564201, now seen corresponding path program 1 times [2019-11-26 02:38:11,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:11,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1136547408] [2019-11-26 02:38:11,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:11,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:38:11,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:11,333 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:38:11,334 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:38:11,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:11,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:11,345 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:38:11,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 02:38:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:11,375 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:11,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1136547408] [2019-11-26 02:38:11,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182857044] [2019-11-26 02:38:11,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:38:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:11,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:38:11,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:11,575 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:38:11,576 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:38:11,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:11,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:11,585 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:38:11,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 02:38:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:11,586 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:11,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:38:11,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 9 [2019-11-26 02:38:11,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699522514] [2019-11-26 02:38:11,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:38:11,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:11,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:38:11,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:38:11,593 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 10 states. [2019-11-26 02:38:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:12,552 INFO L93 Difference]: Finished difference Result 325 states and 346 transitions. [2019-11-26 02:38:12,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-26 02:38:12,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-11-26 02:38:12,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:12,560 INFO L225 Difference]: With dead ends: 325 [2019-11-26 02:38:12,562 INFO L226 Difference]: Without dead ends: 325 [2019-11-26 02:38:12,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:38:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-26 02:38:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 57. [2019-11-26 02:38:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-26 02:38:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-11-26 02:38:12,575 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 7 [2019-11-26 02:38:12,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:12,575 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-11-26 02:38:12,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:38:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-11-26 02:38:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:38:12,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:12,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:12,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:38:12,980 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash 239563854, now seen corresponding path program 1 times [2019-11-26 02:38:12,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:12,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [124823116] [2019-11-26 02:38:12,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:13,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:38:13,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:13,097 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:38:13,098 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:38:13,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:13,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:13,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:38:13,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:11 [2019-11-26 02:38:13,135 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:38:13,135 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:13,164 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:38:13,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [124823116] [2019-11-26 02:38:13,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:13,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-26 02:38:13,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041970139] [2019-11-26 02:38:13,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:38:13,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:13,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:38:13,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:38:13,166 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 5 states. [2019-11-26 02:38:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:13,249 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-11-26 02:38:13,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:38:13,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-11-26 02:38:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:13,251 INFO L225 Difference]: With dead ends: 54 [2019-11-26 02:38:13,251 INFO L226 Difference]: Without dead ends: 54 [2019-11-26 02:38:13,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:38:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-26 02:38:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-26 02:38:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-26 02:38:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-26 02:38:13,257 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 8 [2019-11-26 02:38:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:13,258 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-26 02:38:13,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:38:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-11-26 02:38:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:38:13,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:13,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:13,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:13,461 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:13,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:13,461 INFO L82 PathProgramCache]: Analyzing trace with hash 239563855, now seen corresponding path program 1 times [2019-11-26 02:38:13,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:13,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1785589793] [2019-11-26 02:38:13,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:13,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:38:13,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:13,573 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_20|], 1=[|v_#valid_36|]} [2019-11-26 02:38:13,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:38:13,579 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:38:13,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:13,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:13,614 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:38:13,614 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:13,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:13,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:38:13,632 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-11-26 02:38:13,691 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:38:13,691 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:13,812 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:38:13,817 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:38:13,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:13,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:13,830 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:38:13,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:13,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:13,838 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:38:13,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-11-26 02:38:13,859 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:38:13,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1785589793] [2019-11-26 02:38:13,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:13,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-26 02:38:13,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132449599] [2019-11-26 02:38:13,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:38:13,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:13,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:38:13,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:38:13,861 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 8 states. [2019-11-26 02:38:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:14,753 INFO L93 Difference]: Finished difference Result 172 states and 186 transitions. [2019-11-26 02:38:14,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:38:14,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-11-26 02:38:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:14,756 INFO L225 Difference]: With dead ends: 172 [2019-11-26 02:38:14,756 INFO L226 Difference]: Without dead ends: 172 [2019-11-26 02:38:14,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:38:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-26 02:38:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 73. [2019-11-26 02:38:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-26 02:38:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2019-11-26 02:38:14,776 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 8 [2019-11-26 02:38:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:14,776 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2019-11-26 02:38:14,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:38:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2019-11-26 02:38:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:38:14,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:14,777 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:14,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:14,980 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:14,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1976198929, now seen corresponding path program 1 times [2019-11-26 02:38:14,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:14,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [875087375] [2019-11-26 02:38:14,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:15,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:38:15,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:15,088 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_38|]} [2019-11-26 02:38:15,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:38:15,096 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:38:15,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:15,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:15,122 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:38:15,122 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:15,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:15,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:38:15,136 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-11-26 02:38:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:15,181 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:15,326 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:38:15,338 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:38:15,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:15,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:15,347 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:38:15,347 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:15,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:15,360 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:38:15,361 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-11-26 02:38:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:15,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [875087375] [2019-11-26 02:38:15,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514263405] [2019-11-26 02:38:15,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:38:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:15,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 02:38:15,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:15,499 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_40|]} [2019-11-26 02:38:15,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:38:15,515 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:38:15,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:15,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:15,528 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:38:15,529 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:15,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:15,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:38:15,539 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-11-26 02:38:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:15,595 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:15,810 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:38:15,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:38:15,822 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-26 02:38:15,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:15,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:15,824 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-26 02:38:15,825 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:38:15,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:1 [2019-11-26 02:38:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:38:15,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:38:15,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6, 7] total 13 [2019-11-26 02:38:15,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725093916] [2019-11-26 02:38:15,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:38:15,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:15,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:38:15,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:38:15,827 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 5 states. [2019-11-26 02:38:16,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:16,333 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2019-11-26 02:38:16,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:38:16,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-26 02:38:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:16,335 INFO L225 Difference]: With dead ends: 110 [2019-11-26 02:38:16,335 INFO L226 Difference]: Without dead ends: 110 [2019-11-26 02:38:16,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:38:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-26 02:38:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 70. [2019-11-26 02:38:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 02:38:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2019-11-26 02:38:16,340 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 10 [2019-11-26 02:38:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:16,340 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2019-11-26 02:38:16,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:38:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2019-11-26 02:38:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:38:16,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:16,341 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:16,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:16,742 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:16,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:16,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1388869610, now seen corresponding path program 1 times [2019-11-26 02:38:16,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:16,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2026170203] [2019-11-26 02:38:16,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:16,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:38:16,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:16,852 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:16,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2026170203] [2019-11-26 02:38:16,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856517225] [2019-11-26 02:38:16,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:16,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:38:16,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:16,940 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:16,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:38:16,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 8 [2019-11-26 02:38:16,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309614470] [2019-11-26 02:38:16,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:38:16,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:16,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:38:16,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:38:16,943 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand 8 states. [2019-11-26 02:38:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:17,048 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2019-11-26 02:38:17,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:38:17,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-11-26 02:38:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:17,050 INFO L225 Difference]: With dead ends: 92 [2019-11-26 02:38:17,050 INFO L226 Difference]: Without dead ends: 92 [2019-11-26 02:38:17,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:38:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-26 02:38:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 69. [2019-11-26 02:38:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-26 02:38:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2019-11-26 02:38:17,054 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 11 [2019-11-26 02:38:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:17,055 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-11-26 02:38:17,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:38:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2019-11-26 02:38:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:38:17,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:17,056 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:17,456 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:38:17,457 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:17,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:17,457 INFO L82 PathProgramCache]: Analyzing trace with hash 738364296, now seen corresponding path program 1 times [2019-11-26 02:38:17,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:17,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2019803452] [2019-11-26 02:38:17,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:17,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:38:17,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:17,547 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:17,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2019803452] [2019-11-26 02:38:17,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557324140] [2019-11-26 02:38:17,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:38:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:17,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:38:17,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:38:17,642 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:17,655 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:17,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2019-11-26 02:38:17,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:38:17,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:17,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:17,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:38:17,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-26 02:38:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:38:17,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:38:17,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5, 5] total 10 [2019-11-26 02:38:17,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525955331] [2019-11-26 02:38:17,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:38:17,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:17,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:38:17,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:38:17,662 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 4 states. [2019-11-26 02:38:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:17,731 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-11-26 02:38:17,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:38:17,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-26 02:38:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:17,732 INFO L225 Difference]: With dead ends: 67 [2019-11-26 02:38:17,732 INFO L226 Difference]: Without dead ends: 67 [2019-11-26 02:38:17,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:38:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-26 02:38:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-26 02:38:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-26 02:38:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2019-11-26 02:38:17,735 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 11 [2019-11-26 02:38:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:17,735 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2019-11-26 02:38:17,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:38:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2019-11-26 02:38:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:38:17,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:17,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:18,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:38:18,138 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:18,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:18,138 INFO L82 PathProgramCache]: Analyzing trace with hash 738364297, now seen corresponding path program 1 times [2019-11-26 02:38:18,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:18,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [226710015] [2019-11-26 02:38:18,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:18,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:38:18,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:18,246 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:18,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [226710015] [2019-11-26 02:38:18,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762307557] [2019-11-26 02:38:18,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:18,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:38:18,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:18,349 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:18,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:38:18,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 10 [2019-11-26 02:38:18,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358238584] [2019-11-26 02:38:18,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:38:18,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:18,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:38:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:38:18,410 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 10 states. [2019-11-26 02:38:18,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:18,988 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2019-11-26 02:38:18,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:38:18,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-11-26 02:38:18,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:18,989 INFO L225 Difference]: With dead ends: 140 [2019-11-26 02:38:18,989 INFO L226 Difference]: Without dead ends: 140 [2019-11-26 02:38:18,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:38:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-26 02:38:18,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 70. [2019-11-26 02:38:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 02:38:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-11-26 02:38:18,994 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 11 [2019-11-26 02:38:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:18,994 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-11-26 02:38:18,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:38:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-11-26 02:38:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:38:18,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:18,995 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-11-26 02:38:19,397 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:38:19,397 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:19,397 INFO L82 PathProgramCache]: Analyzing trace with hash 522992425, now seen corresponding path program 2 times [2019-11-26 02:38:19,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:19,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1046256253] [2019-11-26 02:38:19,398 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:19,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 02:38:19,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:38:19,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:38:19,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:19,568 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:38:19,569 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:38:19,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:19,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:19,575 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:38:19,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 02:38:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:19,604 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:19,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1046256253] [2019-11-26 02:38:19,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982186028] [2019-11-26 02:38:19,953 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:38:19,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 02:38:19,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:38:19,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:38:19,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:20,043 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:38:20,044 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:38:20,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:20,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:20,051 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:38:20,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 02:38:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:20,052 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:20,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:38:20,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 17 [2019-11-26 02:38:20,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543822975] [2019-11-26 02:38:20,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 02:38:20,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:20,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 02:38:20,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-11-26 02:38:20,058 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 18 states. [2019-11-26 02:38:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:22,958 INFO L93 Difference]: Finished difference Result 683 states and 726 transitions. [2019-11-26 02:38:22,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-26 02:38:22,959 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 11 [2019-11-26 02:38:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:22,963 INFO L225 Difference]: With dead ends: 683 [2019-11-26 02:38:22,963 INFO L226 Difference]: Without dead ends: 683 [2019-11-26 02:38:22,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=463, Invalid=1019, Unknown=0, NotChecked=0, Total=1482 [2019-11-26 02:38:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-11-26 02:38:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 78. [2019-11-26 02:38:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-26 02:38:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2019-11-26 02:38:22,972 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 11 [2019-11-26 02:38:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:22,972 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2019-11-26 02:38:22,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 02:38:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2019-11-26 02:38:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:38:22,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:22,974 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:23,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:38:23,386 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:23,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:23,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1416054993, now seen corresponding path program 1 times [2019-11-26 02:38:23,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:23,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1060262641] [2019-11-26 02:38:23,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:23,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:38:23,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:23,487 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_50|]} [2019-11-26 02:38:23,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:38:23,491 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:38:23,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:23,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:23,504 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:38:23,505 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:23,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:23,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:38:23,513 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-11-26 02:38:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:23,597 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:23,982 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:38:23,992 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:38:23,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:24,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:24,007 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:38:24,007 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:24,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:24,017 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:38:24,018 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-11-26 02:38:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:24,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1060262641] [2019-11-26 02:38:24,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611880135] [2019-11-26 02:38:24,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:38:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:24,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:38:24,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:24,162 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_52|]} [2019-11-26 02:38:24,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:38:24,167 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:38:24,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:24,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:24,180 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:38:24,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:24,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:24,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:38:24,189 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-11-26 02:38:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:24,219 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:24,494 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:38:24,502 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:38:24,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:24,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:24,519 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:38:24,520 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:24,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:24,533 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:38:24,533 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-11-26 02:38:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:24,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:38:24,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6, 7] total 14 [2019-11-26 02:38:24,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333323772] [2019-11-26 02:38:24,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 02:38:24,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:24,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 02:38:24,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:38:24,536 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand 15 states. [2019-11-26 02:38:25,553 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-26 02:38:25,780 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-26 02:38:26,129 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-26 02:38:26,385 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-26 02:38:26,685 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-26 02:38:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:28,246 INFO L93 Difference]: Finished difference Result 251 states and 275 transitions. [2019-11-26 02:38:28,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 02:38:28,247 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2019-11-26 02:38:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:28,248 INFO L225 Difference]: With dead ends: 251 [2019-11-26 02:38:28,248 INFO L226 Difference]: Without dead ends: 251 [2019-11-26 02:38:28,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-11-26 02:38:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-26 02:38:28,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 107. [2019-11-26 02:38:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-26 02:38:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 132 transitions. [2019-11-26 02:38:28,253 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 132 transitions. Word has length 12 [2019-11-26 02:38:28,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:28,254 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 132 transitions. [2019-11-26 02:38:28,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 02:38:28,254 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 132 transitions. [2019-11-26 02:38:28,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:38:28,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:28,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:28,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:28,658 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:28,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:28,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1031081387, now seen corresponding path program 1 times [2019-11-26 02:38:28,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:28,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [380943711] [2019-11-26 02:38:28,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:28,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:38:28,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:28,745 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:38:28,746 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:38:28,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:28,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:28,759 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:38:28,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:16 [2019-11-26 02:38:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:38:28,795 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:38:28,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [380943711] [2019-11-26 02:38:28,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:28,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-26 02:38:28,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644138918] [2019-11-26 02:38:28,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:38:28,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:28,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:38:28,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:38:28,871 INFO L87 Difference]: Start difference. First operand 107 states and 132 transitions. Second operand 6 states. [2019-11-26 02:38:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:29,128 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2019-11-26 02:38:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:38:29,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-26 02:38:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:29,129 INFO L225 Difference]: With dead ends: 123 [2019-11-26 02:38:29,129 INFO L226 Difference]: Without dead ends: 123 [2019-11-26 02:38:29,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:38:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-26 02:38:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2019-11-26 02:38:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-26 02:38:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2019-11-26 02:38:29,133 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 13 [2019-11-26 02:38:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:29,133 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2019-11-26 02:38:29,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:38:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2019-11-26 02:38:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:38:29,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:29,134 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:29,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:29,336 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:29,337 INFO L82 PathProgramCache]: Analyzing trace with hash 525487188, now seen corresponding path program 2 times [2019-11-26 02:38:29,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:29,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1378729098] [2019-11-26 02:38:29,337 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/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:38:29,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 02:38:29,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:38:29,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:38:29,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:29,464 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-26 02:38:29,464 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 13 treesize of output 15 [2019-11-26 02:38:29,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:29,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:29,473 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:38:29,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:21 [2019-11-26 02:38:29,495 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 13 treesize of output 9 [2019-11-26 02:38:29,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:29,502 INFO L567 ElimStorePlain]: treesize reduction 6, result has 45.5 percent of original size [2019-11-26 02:38:29,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:38:29,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:5 [2019-11-26 02:38:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:29,541 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:29,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1378729098] [2019-11-26 02:38:29,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847945769] [2019-11-26 02:38:29,727 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:38:29,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 02:38:29,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:38:29,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:38:29,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:29,807 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-26 02:38:29,808 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 13 treesize of output 15 [2019-11-26 02:38:29,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:29,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:29,815 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:38:29,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:18 [2019-11-26 02:38:29,846 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 15 treesize of output 11 [2019-11-26 02:38:29,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:29,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:29,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:38:29,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2019-11-26 02:38:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:29,880 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:29,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:38:29,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 9] total 17 [2019-11-26 02:38:29,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637857214] [2019-11-26 02:38:29,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-26 02:38:29,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-26 02:38:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:38:29,965 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand 17 states. [2019-11-26 02:38:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:30,333 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2019-11-26 02:38:30,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:38:30,335 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2019-11-26 02:38:30,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:30,336 INFO L225 Difference]: With dead ends: 115 [2019-11-26 02:38:30,336 INFO L226 Difference]: Without dead ends: 115 [2019-11-26 02:38:30,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-11-26 02:38:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-26 02:38:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2019-11-26 02:38:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-26 02:38:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2019-11-26 02:38:30,339 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 15 [2019-11-26 02:38:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:30,339 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2019-11-26 02:38:30,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-26 02:38:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2019-11-26 02:38:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:38:30,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:30,340 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:30,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:30,745 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:30,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:30,745 INFO L82 PathProgramCache]: Analyzing trace with hash -612409642, now seen corresponding path program 3 times [2019-11-26 02:38:30,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:30,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [916934434] [2019-11-26 02:38:30,746 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:30,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-26 02:38:30,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:38:30,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 02:38:30,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:30,849 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_46|], 1=[|v_#valid_57|]} [2019-11-26 02:38:30,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:38:30,858 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 13 treesize of output 15 [2019-11-26 02:38:30,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:30,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:30,888 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:38:30,888 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:30,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:30,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:38:30,911 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:30 [2019-11-26 02:38:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:38:31,164 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:32,023 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:38:32,028 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:38:32,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:32,053 INFO L567 ElimStorePlain]: treesize reduction 16, result has 64.4 percent of original size [2019-11-26 02:38:32,055 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:38:32,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:32,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:32,067 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:38:32,068 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:16 [2019-11-26 02:38:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:38:32,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [916934434] [2019-11-26 02:38:32,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020128347] [2019-11-26 02:38:32,153 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:38:32,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-26 02:38:32,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:38:32,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-26 02:38:32,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:32,201 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_48|], 1=[|v_#valid_59|]} [2019-11-26 02:38:32,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:38:32,208 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 13 treesize of output 15 [2019-11-26 02:38:32,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:32,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:32,231 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:38:32,232 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:32,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:32,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:38:32,249 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-11-26 02:38:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:38:32,399 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:33,259 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-11-26 02:38:33,264 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-26 02:38:33,271 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:38:33,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:33,318 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-26 02:38:33,322 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:38:33,322 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:33,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:33,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:38:33,346 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:63, output treesize:28 [2019-11-26 02:38:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:38:33,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:38:33,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 9] total 21 [2019-11-26 02:38:33,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318185666] [2019-11-26 02:38:33,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-26 02:38:33,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:33,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-26 02:38:33,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-11-26 02:38:33,414 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand 22 states. [2019-11-26 02:38:34,218 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-26 02:38:34,438 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-11-26 02:38:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:35,840 INFO L93 Difference]: Finished difference Result 139 states and 160 transitions. [2019-11-26 02:38:35,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-26 02:38:35,842 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 15 [2019-11-26 02:38:35,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:35,843 INFO L225 Difference]: With dead ends: 139 [2019-11-26 02:38:35,843 INFO L226 Difference]: Without dead ends: 139 [2019-11-26 02:38:35,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2019-11-26 02:38:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-26 02:38:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 83. [2019-11-26 02:38:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-26 02:38:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-11-26 02:38:35,846 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 15 [2019-11-26 02:38:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:35,846 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-11-26 02:38:35,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-26 02:38:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2019-11-26 02:38:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:38:35,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:35,847 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:38:36,247 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:36,247 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:36,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:36,248 INFO L82 PathProgramCache]: Analyzing trace with hash -660488896, now seen corresponding path program 1 times [2019-11-26 02:38:36,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:36,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1623191789] [2019-11-26 02:38:36,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:36,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:38:36,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:38:36,351 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:38:36,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1623191789] [2019-11-26 02:38:36,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:36,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 4 [2019-11-26 02:38:36,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847394811] [2019-11-26 02:38:36,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:38:36,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:36,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:38:36,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:38:36,358 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 5 states. [2019-11-26 02:38:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:36,380 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-11-26 02:38:36,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:38:36,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-26 02:38:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:36,382 INFO L225 Difference]: With dead ends: 81 [2019-11-26 02:38:36,382 INFO L226 Difference]: Without dead ends: 81 [2019-11-26 02:38:36,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:38:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-26 02:38:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-11-26 02:38:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-26 02:38:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2019-11-26 02:38:36,387 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 16 [2019-11-26 02:38:36,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:36,387 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2019-11-26 02:38:36,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:38:36,387 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2019-11-26 02:38:36,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:38:36,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:36,388 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:36,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:36,588 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:36,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:36,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1813005665, now seen corresponding path program 1 times [2019-11-26 02:38:36,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:36,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1750806521] [2019-11-26 02:38:36,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:36,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:38:36,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:36,693 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:38:36,693 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:38:36,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:36,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:36,703 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:38:36,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:16 [2019-11-26 02:38:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-26 02:38:36,730 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-26 02:38:36,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1750806521] [2019-11-26 02:38:36,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532120141] [2019-11-26 02:38:36,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:38:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:36,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-26 02:38:36,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:38:36,966 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:38:36,967 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:38:36,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:38:36,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:38:36,990 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:38:36,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:22 [2019-11-26 02:38:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-26 02:38:37,051 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:38:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-26 02:38:37,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:38:37,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6, 6] total 13 [2019-11-26 02:38:37,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722507454] [2019-11-26 02:38:37,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 02:38:37,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:38:37,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 02:38:37,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:38:37,268 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 14 states. [2019-11-26 02:38:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:39,055 INFO L93 Difference]: Finished difference Result 257 states and 285 transitions. [2019-11-26 02:38:39,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-26 02:38:39,055 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-11-26 02:38:39,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:39,057 INFO L225 Difference]: With dead ends: 257 [2019-11-26 02:38:39,057 INFO L226 Difference]: Without dead ends: 257 [2019-11-26 02:38:39,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2019-11-26 02:38:39,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-26 02:38:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 101. [2019-11-26 02:38:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-26 02:38:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-11-26 02:38:39,061 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 17 [2019-11-26 02:38:39,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:39,061 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-11-26 02:38:39,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 02:38:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-11-26 02:38:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:38:39,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:39,062 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:38:39,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:38:39,462 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:38:39,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:39,463 INFO L82 PathProgramCache]: Analyzing trace with hash 925334210, now seen corresponding path program 1 times [2019-11-26 02:38:39,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:38:39,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1830343473] [2019-11-26 02:38:39,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:38:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:38:39,619 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-11-26 02:38:39,619 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:38:39,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:38:39,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:38:39 BoogieIcfgContainer [2019-11-26 02:38:39,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:38:39,852 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:38:39,852 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:38:39,852 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:38:39,852 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:38:09" (3/4) ... [2019-11-26 02:38:39,854 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:38:39,897 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_60d236e1-8b1c-4d35-8090-aed7ebdd8bc6/bin/utaipan/witness.graphml [2019-11-26 02:38:39,897 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:38:39,898 INFO L168 Benchmark]: Toolchain (without parser) took 31153.28 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.6 MB). Free memory was 940.7 MB in the beginning and 1.3 GB in the end (delta: -351.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:38:39,899 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:38:39,899 INFO L168 Benchmark]: CACSL2BoogieTranslator took 541.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -192.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:38:39,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:38:39,899 INFO L168 Benchmark]: Boogie Preprocessor took 28.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:38:39,900 INFO L168 Benchmark]: RCFGBuilder took 463.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:38:39,900 INFO L168 Benchmark]: TraceAbstraction took 30026.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:38:39,900 INFO L168 Benchmark]: Witness Printer took 45.88 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:38:39,902 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 541.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -192.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 463.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30026.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 45.88 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 536]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L512] int *a, *b; [L513] int n; VAL [a={0:0}, b={0:0}, n=0] [L525] n = 1 VAL [a={0:0}, b={0:0}, n=1] [L526] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L529] a = malloc(n * sizeof(*a)) [L530] b = malloc(n * sizeof(*b)) [L531] EXPR b++ VAL [a={2:0}, b={-3:4}, n=1] [L531] *b++ = 0 VAL [a={2:0}, b={-3:4}, n=1] [L517] int i; [L518] i = 0 VAL [a={2:0}, b={-3:4}, n=1] [L518] COND TRUE i < n VAL [a={2:0}, b={-3:4}, n=1] [L519] a[i] = -1 VAL [a={2:0}, b={-3:4}, n=1] [L518] i++ VAL [a={2:0}, b={-3:4}, n=1] [L518] COND FALSE !(i < n) VAL [a={2:0}, b={-3:4}, n=1] [L520] i = 0 VAL [a={2:0}, b={-3:4}, n=1] [L520] COND FALSE !(i < n - 1) VAL [a={2:0}, b={-3:4}, n=1] [L533] b[-1] VAL [a={2:0}, b={-3:4}, n=1] [L533] COND FALSE !(b[-1]) [L536] free(a) VAL [a={2:0}, b={-3:4}, n=1] [L536] free(a) VAL [a={2:0}, b={-3:4}, n=1] [L536] free(a) [L536] free(b) VAL [a={2:0}, b={-3:4}, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 21 error locations. Result: UNSAFE, OverallTime: 29.9s, OverallIterations: 17, TraceHistogramMax: 6, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 920 SDtfs, 6636 SDslu, 4233 SDs, 0 SdLazy, 2628 SolverSat, 319 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 381 SyntacticMatches, 19 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 1602 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 313 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 538 ConstructedInterpolants, 40 QuantifiedInterpolants, 67176 SizeOfPredicates, 137 NumberOfNonLiveVariables, 1209 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 52 InterpolantComputations, 15 PerfectInterpolantSequences, 81/244 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...