./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/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 254e3dbb3d4b2f0b71591f87e1d60dc8ec7bfdff ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:55:21,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:55:21,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:55:21,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:55:21,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:55:21,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:55:21,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:55:21,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:55:21,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:55:21,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:55:21,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:55:21,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:55:21,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:55:21,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:55:21,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:55:21,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:55:21,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:55:21,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:55:21,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:55:21,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:55:21,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:55:21,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:55:21,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:55:21,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:55:21,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:55:21,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:55:21,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:55:21,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:55:21,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:55:21,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:55:21,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:55:21,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:55:21,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:55:21,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:55:21,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:55:21,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:55:21,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:55:21,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:55:21,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:55:21,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:55:21,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:55:21,588 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-11-26 02:55:21,613 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:55:21,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:55:21,614 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:55:21,614 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:55:21,614 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:55:21,614 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:55:21,614 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:55:21,614 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:55:21,615 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:55:21,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 02:55:21,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 02:55:21,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:55:21,616 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:55:21,616 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:55:21,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:55:21,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:55:21,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:55:21,617 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 02:55:21,617 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 02:55:21,617 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 02:55:21,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:55:21,617 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:55:21,618 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:55:21,618 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:55:21,618 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:55:21,618 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:55:21,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:55:21,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:55:21,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:55:21,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:55:21,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:55:21,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:55:21,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:55:21,619 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:55:21,620 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:55:21,620 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:55:21,620 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_d0e1a81b-d809-4282-a4e1-66904128d73f/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 -> 254e3dbb3d4b2f0b71591f87e1d60dc8ec7bfdff [2019-11-26 02:55:21,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:55:21,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:55:21,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:55:21,800 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:55:21,800 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:55:21,801 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_1.i [2019-11-26 02:55:21,857 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/data/f2c78e7ad/667c8448e82e43ee8f9a9e51525f3935/FLAG524aad44b [2019-11-26 02:55:22,375 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:55:22,375 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/sv-benchmarks/c/ldv-memsafety/memleaks_test6_1.i [2019-11-26 02:55:22,399 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/data/f2c78e7ad/667c8448e82e43ee8f9a9e51525f3935/FLAG524aad44b [2019-11-26 02:55:22,693 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/data/f2c78e7ad/667c8448e82e43ee8f9a9e51525f3935 [2019-11-26 02:55:22,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:55:22,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:55:22,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:55:22,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:55:22,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:55:22,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:55:22" (1/1) ... [2019-11-26 02:55:22,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5acfc6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:22, skipping insertion in model container [2019-11-26 02:55:22,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:55:22" (1/1) ... [2019-11-26 02:55:22,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:55:22,762 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:55:23,187 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-26 02:55:23,188 INFO L968 CHandler]: at location: C: (struct ldv_msg*)ldv_malloc(sizeof(struct ldv_msg)) [576] [2019-11-26 02:55:23,188 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:55:23,210 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-26 02:55:23,211 INFO L968 CHandler]: at location: C: (typeof(*msg) *)( (char *)__mptr - ((size_t) &((typeof(*msg) *)0)->list) ) [607] [2019-11-26 02:55:23,212 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:55:23,216 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-26 02:55:23,216 INFO L968 CHandler]: at location: C: (typeof(*(msg)) *)( (char *)__mptr - ((size_t) &((typeof(*(msg)) *)0)->list) ) [607] [2019-11-26 02:55:23,217 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:55:23,220 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-26 02:55:23,220 INFO L968 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [607] [2019-11-26 02:55:23,221 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:55:23,257 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-26 02:55:23,257 INFO L968 CHandler]: at location: C: (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) ) [706] [2019-11-26 02:55:23,257 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:55:23,275 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-26 02:55:23,275 INFO L968 CHandler]: at location: C: (int *)ldv_malloc(sizeof(int)) [765] [2019-11-26 02:55:23,275 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:55:23,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:55:23,310 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-26 02:55:23,326 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:55:23,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:55:23,374 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:55:23,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:55:23,533 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:55:23,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:23 WrapperNode [2019-11-26 02:55:23,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:55:23,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:55:23,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:55:23,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:55:23,542 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:55:23" (1/1) ... [2019-11-26 02:55:23,564 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:55:23" (1/1) ... [2019-11-26 02:55:23,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:55:23,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:55:23,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:55:23,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:55:23,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:23" (1/1) ... [2019-11-26 02:55:23,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:23" (1/1) ... [2019-11-26 02:55:23,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:23" (1/1) ... [2019-11-26 02:55:23,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:23" (1/1) ... [2019-11-26 02:55:23,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:23" (1/1) ... [2019-11-26 02:55:23,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:23" (1/1) ... [2019-11-26 02:55:23,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:23" (1/1) ... [2019-11-26 02:55:23,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:55:23,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:55:23,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:55:23,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:55:23,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/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:55:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:55:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:55:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:55:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:55:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:55:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 02:55:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:55:23,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:55:24,075 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:55:24,075 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-26 02:55:24,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:55:24 BoogieIcfgContainer [2019-11-26 02:55:24,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:55:24,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:55:24,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:55:24,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:55:24,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:55:22" (1/3) ... [2019-11-26 02:55:24,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a490be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:55:24, skipping insertion in model container [2019-11-26 02:55:24,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:23" (2/3) ... [2019-11-26 02:55:24,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a490be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:55:24, skipping insertion in model container [2019-11-26 02:55:24,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:55:24" (3/3) ... [2019-11-26 02:55:24,081 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1.i [2019-11-26 02:55:24,089 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:55:24,094 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-26 02:55:24,104 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-26 02:55:24,121 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:55:24,122 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 02:55:24,122 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:55:24,122 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:55:24,122 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:55:24,122 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:55:24,122 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:55:24,122 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:55:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-11-26 02:55:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:55:24,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:24,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:24,144 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:24,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:24,149 INFO L82 PathProgramCache]: Analyzing trace with hash 119409031, now seen corresponding path program 1 times [2019-11-26 02:55:24,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:24,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [125619996] [2019-11-26 02:55:24,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/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:55:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:24,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:55:24,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:24,321 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:55:24,321 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:24,325 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:55:24,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [125619996] [2019-11-26 02:55:24,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:24,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 02:55:24,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449786119] [2019-11-26 02:55:24,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:55:24,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:24,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:55:24,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:24,348 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 4 states. [2019-11-26 02:55:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:24,446 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-11-26 02:55:24,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:55:24,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-26 02:55:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:24,458 INFO L225 Difference]: With dead ends: 71 [2019-11-26 02:55:24,458 INFO L226 Difference]: Without dead ends: 67 [2019-11-26 02:55:24,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:55:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-26 02:55:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-11-26 02:55:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-26 02:55:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-26 02:55:24,496 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 8 [2019-11-26 02:55:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:24,496 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-26 02:55:24,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:55:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-26 02:55:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:55:24,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:24,497 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:24,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:24,701 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:24,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash 119443416, now seen corresponding path program 1 times [2019-11-26 02:55:24,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:24,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1629365232] [2019-11-26 02:55:24,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/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:55:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:24,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:55:24,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:24,812 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:55:24,812 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:24,818 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:55:24,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1629365232] [2019-11-26 02:55:24,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:24,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 02:55:24,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579319383] [2019-11-26 02:55:24,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:55:24,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:24,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:55:24,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:24,826 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 4 states. [2019-11-26 02:55:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:24,869 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-11-26 02:55:24,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:55:24,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-26 02:55:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:24,872 INFO L225 Difference]: With dead ends: 36 [2019-11-26 02:55:24,872 INFO L226 Difference]: Without dead ends: 36 [2019-11-26 02:55:24,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:55:24,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-26 02:55:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-26 02:55:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-26 02:55:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-26 02:55:24,878 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 8 [2019-11-26 02:55:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:24,878 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-26 02:55:24,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:55:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-26 02:55:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:55:24,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:24,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:25,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:25,080 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash 176667333, now seen corresponding path program 1 times [2019-11-26 02:55:25,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:25,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1361766872] [2019-11-26 02:55:25,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/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:55:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:25,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:55:25,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:25,328 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-26 02:55:25,329 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 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-26 02:55:25,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:25,372 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-26 02:55:25,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:25,376 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:55:25,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-11-26 02:55:25,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:25,400 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:55:25,400 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:25,402 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:55:25,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1361766872] [2019-11-26 02:55:25,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:25,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2019-11-26 02:55:25,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993332126] [2019-11-26 02:55:25,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:55:25,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:25,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:55:25,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:55:25,404 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 3 states. [2019-11-26 02:55:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:25,484 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-11-26 02:55:25,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:55:25,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-26 02:55:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:25,487 INFO L225 Difference]: With dead ends: 49 [2019-11-26 02:55:25,487 INFO L226 Difference]: Without dead ends: 49 [2019-11-26 02:55:25,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:55:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-26 02:55:25,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2019-11-26 02:55:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-26 02:55:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-11-26 02:55:25,492 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 8 [2019-11-26 02:55:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:25,492 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-26 02:55:25,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:55:25,492 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-11-26 02:55:25,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:55:25,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:25,493 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:25,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:25,694 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:25,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:25,695 INFO L82 PathProgramCache]: Analyzing trace with hash 176667334, now seen corresponding path program 1 times [2019-11-26 02:55:25,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:25,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [128497806] [2019-11-26 02:55:25,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:25,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:55:25,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:25,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:25,841 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-26 02:55:25,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:25,880 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-26 02:55:25,881 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:55:25,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-26 02:55:25,901 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:55:25,901 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:25,937 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:55:25,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [128497806] [2019-11-26 02:55:25,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:25,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2019-11-26 02:55:25,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850830804] [2019-11-26 02:55:25,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:55:25,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:25,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:55:25,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:25,939 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 4 states. [2019-11-26 02:55:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:26,070 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-26 02:55:26,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:55:26,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-26 02:55:26,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:26,073 INFO L225 Difference]: With dead ends: 70 [2019-11-26 02:55:26,073 INFO L226 Difference]: Without dead ends: 70 [2019-11-26 02:55:26,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-26 02:55:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2019-11-26 02:55:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-26 02:55:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2019-11-26 02:55:26,084 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 8 [2019-11-26 02:55:26,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:26,084 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2019-11-26 02:55:26,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:55:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2019-11-26 02:55:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:55:26,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:26,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:26,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:26,297 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:26,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:26,297 INFO L82 PathProgramCache]: Analyzing trace with hash 176666948, now seen corresponding path program 1 times [2019-11-26 02:55:26,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:26,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1166517874] [2019-11-26 02:55:26,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/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:55:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:26,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:55:26,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:26,397 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:55:26,397 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:26,430 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:55:26,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1166517874] [2019-11-26 02:55:26,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:26,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-26 02:55:26,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896181311] [2019-11-26 02:55:26,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:55:26,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:26,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:55:26,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:55:26,432 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand 8 states. [2019-11-26 02:55:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:26,535 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2019-11-26 02:55:26,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:55:26,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-11-26 02:55:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:26,537 INFO L225 Difference]: With dead ends: 78 [2019-11-26 02:55:26,537 INFO L226 Difference]: Without dead ends: 78 [2019-11-26 02:55:26,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:55:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-26 02:55:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2019-11-26 02:55:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-26 02:55:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2019-11-26 02:55:26,546 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 8 [2019-11-26 02:55:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:26,546 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2019-11-26 02:55:26,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:55:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2019-11-26 02:55:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:55:26,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:26,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:26,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:26,758 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:26,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:26,758 INFO L82 PathProgramCache]: Analyzing trace with hash -592221333, now seen corresponding path program 1 times [2019-11-26 02:55:26,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:26,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [543415936] [2019-11-26 02:55:26,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/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:55:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:26,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:55:26,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:26,918 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:55:26,918 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:26,942 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:55:26,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [543415936] [2019-11-26 02:55:26,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:26,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2019-11-26 02:55:26,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113392767] [2019-11-26 02:55:26,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:55:26,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:26,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:55:26,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:55:26,944 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand 7 states. [2019-11-26 02:55:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:27,014 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2019-11-26 02:55:27,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:55:27,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-26 02:55:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:27,016 INFO L225 Difference]: With dead ends: 61 [2019-11-26 02:55:27,016 INFO L226 Difference]: Without dead ends: 61 [2019-11-26 02:55:27,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:55:27,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-26 02:55:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-26 02:55:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-26 02:55:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2019-11-26 02:55:27,022 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 9 [2019-11-26 02:55:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:27,022 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2019-11-26 02:55:27,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:55:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2019-11-26 02:55:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:55:27,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:27,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:27,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:27,232 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:27,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:27,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1181720059, now seen corresponding path program 1 times [2019-11-26 02:55:27,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:27,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2005069934] [2019-11-26 02:55:27,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/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:55:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:27,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:55:27,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:27,332 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:55:27,333 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:27,335 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:55:27,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2005069934] [2019-11-26 02:55:27,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:27,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:55:27,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823282094] [2019-11-26 02:55:27,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:55:27,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:27,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:55:27,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:55:27,337 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand 3 states. [2019-11-26 02:55:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:27,396 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2019-11-26 02:55:27,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:55:27,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 02:55:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:27,397 INFO L225 Difference]: With dead ends: 70 [2019-11-26 02:55:27,398 INFO L226 Difference]: Without dead ends: 66 [2019-11-26 02:55:27,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:55:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-26 02:55:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2019-11-26 02:55:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-26 02:55:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-11-26 02:55:27,405 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 9 [2019-11-26 02:55:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:27,409 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-11-26 02:55:27,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:55:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-11-26 02:55:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:55:27,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:27,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:27,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:27,613 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1178992070, now seen corresponding path program 1 times [2019-11-26 02:55:27,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:27,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [642277892] [2019-11-26 02:55:27,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:27,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:55:27,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:27,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:55:27,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:27,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:27,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:55:27,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:55:27,741 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:55:27,742 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:27,753 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:55:27,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [642277892] [2019-11-26 02:55:27,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:27,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 02:55:27,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276808658] [2019-11-26 02:55:27,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:55:27,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:27,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:55:27,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:27,755 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 4 states. [2019-11-26 02:55:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:27,843 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-26 02:55:27,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:55:27,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-26 02:55:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:27,845 INFO L225 Difference]: With dead ends: 68 [2019-11-26 02:55:27,845 INFO L226 Difference]: Without dead ends: 68 [2019-11-26 02:55:27,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:55:27,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-26 02:55:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2019-11-26 02:55:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-26 02:55:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2019-11-26 02:55:27,850 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 10 [2019-11-26 02:55:27,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:27,850 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2019-11-26 02:55:27,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:55:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2019-11-26 02:55:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:55:27,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:27,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:28,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:28,053 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:28,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:28,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1178944307, now seen corresponding path program 1 times [2019-11-26 02:55:28,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:28,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [871767995] [2019-11-26 02:55:28,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/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:55:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:28,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:55:28,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:28,209 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-26 02:55:28,210 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 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-26 02:55:28,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:28,237 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-26 02:55:28,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:28,239 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:55:28,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-11-26 02:55:28,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:28,292 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:28,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-26 02:55:28,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:28,314 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-26 02:55:28,315 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:55:28,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-26 02:55:28,328 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:55:28,328 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:28,347 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:55:28,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [871767995] [2019-11-26 02:55:28,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:28,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:55:28,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925639870] [2019-11-26 02:55:28,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:55:28,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:28,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:55:28,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:28,348 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 4 states. [2019-11-26 02:55:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:28,416 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-11-26 02:55:28,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:55:28,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-26 02:55:28,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:28,417 INFO L225 Difference]: With dead ends: 60 [2019-11-26 02:55:28,417 INFO L226 Difference]: Without dead ends: 60 [2019-11-26 02:55:28,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:55:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-26 02:55:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-11-26 02:55:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-26 02:55:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-11-26 02:55:28,421 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 10 [2019-11-26 02:55:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:28,421 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-11-26 02:55:28,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:55:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-11-26 02:55:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:55:28,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:28,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:28,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:28,623 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:28,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:28,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1178944306, now seen corresponding path program 1 times [2019-11-26 02:55:28,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:28,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1867508092] [2019-11-26 02:55:28,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:28,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:55:28,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:28,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:28,784 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-26 02:55:28,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:28,814 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-26 02:55:28,859 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-26 02:55:28,860 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 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-26 02:55:28,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:28,902 INFO L567 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2019-11-26 02:55:28,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:28,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:28,905 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:55:28,905 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:40 [2019-11-26 02:55:28,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:28,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:28,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:28,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:29,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:29,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:55:29,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-26 02:55:29,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:29,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:55:29,165 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:29,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 61 [2019-11-26 02:55:29,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:29,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:55:29,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-26 02:55:29,174 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:29,284 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-11-26 02:55:29,285 INFO L567 ElimStorePlain]: treesize reduction 18, result has 83.6 percent of original size [2019-11-26 02:55:29,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:29,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2019-11-26 02:55:29,313 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:29,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:29,323 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 29 treesize of output 33 [2019-11-26 02:55:29,324 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:29,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:55:29,338 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2019-11-26 02:55:29,338 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:29,365 INFO L567 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-11-26 02:55:29,366 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:55:29,367 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:97, output treesize:9 [2019-11-26 02:55:29,378 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:55:29,379 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:29,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:29,588 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:55:29,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1867508092] [2019-11-26 02:55:29,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:29,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2019-11-26 02:55:29,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784352043] [2019-11-26 02:55:29,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:55:29,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:29,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:55:29,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:55:29,589 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 8 states. [2019-11-26 02:55:29,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:29,879 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2019-11-26 02:55:29,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:55:29,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-26 02:55:29,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:29,880 INFO L225 Difference]: With dead ends: 58 [2019-11-26 02:55:29,880 INFO L226 Difference]: Without dead ends: 58 [2019-11-26 02:55:29,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:55:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-26 02:55:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-11-26 02:55:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-26 02:55:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2019-11-26 02:55:29,884 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 10 [2019-11-26 02:55:29,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:29,884 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2019-11-26 02:55:29,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:55:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2019-11-26 02:55:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:55:29,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:29,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:30,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:30,087 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:30,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:30,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1988338696, now seen corresponding path program 1 times [2019-11-26 02:55:30,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:30,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [441810073] [2019-11-26 02:55:30,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/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:55:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:30,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:55:30,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:30,179 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:55:30,179 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:30,180 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:55:30,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [441810073] [2019-11-26 02:55:30,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:30,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-26 02:55:30,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528548414] [2019-11-26 02:55:30,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:55:30,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:30,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:55:30,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:55:30,182 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states. [2019-11-26 02:55:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:30,215 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-11-26 02:55:30,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:55:30,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-26 02:55:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:30,216 INFO L225 Difference]: With dead ends: 59 [2019-11-26 02:55:30,216 INFO L226 Difference]: Without dead ends: 58 [2019-11-26 02:55:30,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:55:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-26 02:55:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-11-26 02:55:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-26 02:55:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-11-26 02:55:30,218 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 10 [2019-11-26 02:55:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:30,219 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-11-26 02:55:30,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:55:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-11-26 02:55:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:55:30,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:30,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:30,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:30,421 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:30,422 INFO L82 PathProgramCache]: Analyzing trace with hash 889860305, now seen corresponding path program 1 times [2019-11-26 02:55:30,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:30,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2137669294] [2019-11-26 02:55:30,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:30,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:55:30,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:30,588 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-26 02:55:30,588 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 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-26 02:55:30,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:30,626 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-26 02:55:30,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:30,627 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:55:30,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-11-26 02:55:30,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:30,674 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:30,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-26 02:55:30,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:30,700 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-26 02:55:30,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:55:30,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-11-26 02:55:30,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:30,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2019-11-26 02:55:30,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:30,809 INFO L567 ElimStorePlain]: treesize reduction 4, result has 78.9 percent of original size [2019-11-26 02:55:30,809 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:55:30,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2019-11-26 02:55:30,827 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:55:30,827 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:30,958 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:55:30,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2137669294] [2019-11-26 02:55:30,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:30,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-26 02:55:30,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667572543] [2019-11-26 02:55:30,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-26 02:55:30,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:30,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-26 02:55:30,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:55:30,960 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 13 states. [2019-11-26 02:55:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:43,524 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-11-26 02:55:43,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 02:55:43,525 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-11-26 02:55:43,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:43,525 INFO L225 Difference]: With dead ends: 61 [2019-11-26 02:55:43,525 INFO L226 Difference]: Without dead ends: 61 [2019-11-26 02:55:43,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=303, Unknown=0, NotChecked=0, Total=462 [2019-11-26 02:55:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-26 02:55:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2019-11-26 02:55:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-26 02:55:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2019-11-26 02:55:43,528 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 13 [2019-11-26 02:55:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:43,528 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2019-11-26 02:55:43,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-26 02:55:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2019-11-26 02:55:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:55:43,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:43,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:43,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:43,735 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:43,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:43,735 INFO L82 PathProgramCache]: Analyzing trace with hash 889860306, now seen corresponding path program 1 times [2019-11-26 02:55:43,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:43,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1482902954] [2019-11-26 02:55:43,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/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:55:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:43,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:55:43,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:55:43,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:43,867 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-26 02:55:43,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:43,906 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-26 02:55:43,961 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-26 02:55:43,962 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 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-26 02:55:43,962 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:44,001 INFO L567 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2019-11-26 02:55:44,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:44,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:44,003 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:55:44,003 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:40 [2019-11-26 02:55:44,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:44,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:44,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:44,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:44,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:44,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:55:44,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:44,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2019-11-26 02:55:44,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:44,135 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:44,136 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 28 treesize of output 32 [2019-11-26 02:55:44,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:44,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:55:44,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:55:44,156 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:55:44,173 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:55:44,189 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:44,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2019-11-26 02:55:44,190 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:44,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:55:44,201 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:55:44,205 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:55:44,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-11-26 02:55:44,207 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:44,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:55:44,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:55:44,217 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:55:44,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2019-11-26 02:55:44,219 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:44,256 INFO L567 ElimStorePlain]: treesize reduction 27, result has 41.3 percent of original size [2019-11-26 02:55:44,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-26 02:55:44,259 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 02:55:44,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:55:44,270 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:55:44,270 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:184, output treesize:9 [2019-11-26 02:55:44,279 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:55:44,279 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:55:44,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:55:44,449 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:55:44,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1482902954] [2019-11-26 02:55:44,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:44,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 4 [2019-11-26 02:55:44,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210461700] [2019-11-26 02:55:44,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:55:44,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:55:44,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:55:44,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:55:44,450 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 6 states. [2019-11-26 02:55:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:44,567 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-11-26 02:55:44,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:55:44,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-26 02:55:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:44,568 INFO L225 Difference]: With dead ends: 52 [2019-11-26 02:55:44,568 INFO L226 Difference]: Without dead ends: 52 [2019-11-26 02:55:44,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:55:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-26 02:55:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2019-11-26 02:55:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-26 02:55:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-26 02:55:44,571 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 13 [2019-11-26 02:55:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:44,571 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-26 02:55:44,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:55:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-26 02:55:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:55:44,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:44,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:44,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:44,774 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2019-11-26 02:55:44,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:44,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1983734109, now seen corresponding path program 1 times [2019-11-26 02:55:44,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:55:44,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [368376844] [2019-11-26 02:55:44,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d0e1a81b-d809-4282-a4e1-66904128d73f/bin/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:55:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:55:45,034 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-11-26 02:55:45,035 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:55:45,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:55:45,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:55:45 BoogieIcfgContainer [2019-11-26 02:55:45,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:55:45,279 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:55:45,279 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:55:45,279 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:55:45,280 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:55:24" (3/4) ... [2019-11-26 02:55:45,283 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-26 02:55:45,283 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:55:45,284 INFO L168 Benchmark]: Toolchain (without parser) took 22588.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -94.2 MB). Peak memory consumption was 116.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:45,284 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:55:45,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 838.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:45,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.06 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:55:45,287 INFO L168 Benchmark]: Boogie Preprocessor took 48.74 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:55:45,287 INFO L168 Benchmark]: RCFGBuilder took 441.70 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.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:45,287 INFO L168 Benchmark]: TraceAbstraction took 21201.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 32.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.3 MB). Peak memory consumption was 94.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:45,288 INFO L168 Benchmark]: Witness Printer took 4.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:55:45,291 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 838.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.06 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 48.74 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 441.70 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.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21201.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 32.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.3 MB). Peak memory consumption was 94.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 791]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 791. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L783] struct A a6; VAL [a6={7:0}, ldv_global_msg_list={6:0}] [L764] int ret = - -3; [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [a6={7:0}, ldv_global_msg_list={6:0}] [L765] int *p = (int *)ldv_malloc(sizeof(int)); [L766] COND FALSE !(p==0) [L758] return __VERIFIER_nondet_int(); [L768] ret = f6() [L769] COND FALSE !(ret<0) [L761] return __VERIFIER_nondet_int(); [L771] ret = g6() [L772] COND TRUE ret<0 [L773] return ret; VAL [a6={7:0}, ldv_global_msg_list={6:0}] [L785] int ret = probe2_6(&a6); [L786] COND FALSE !(ret==0) VAL [a6={7:0}, ldv_global_msg_list={6:0}] [L789] a6.p = 0 VAL [a6={7:0}, ldv_global_msg_list={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 13 error locations. Result: UNSAFE, OverallTime: 21.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 425 SDtfs, 836 SDslu, 528 SDs, 0 SdLazy, 402 SolverSat, 40 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 168 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 119 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 222 ConstructedInterpolants, 12 QuantifiedInterpolants, 19153 SizeOfPredicates, 39 NumberOfNonLiveVariables, 601 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...