./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 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_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf658906da38258bbb10e77b5550f740cea929 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32))) (let ((.cse0 (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) (or (= .cse0 (select (store (select |old(#memory_$Pointer$.offset)| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset| v_DerPreprocessor_18) .cse0)) (not (= (bvadd (select |#valid| |dll_update_at_#in~head.base|) (_ bv1 1)) (_ bv0 1))) (not (= .cse0 (select (select (store |#memory_$Pointer$.offset| dll_update_at_~head.base (store (select |#memory_$Pointer$.offset| dll_update_at_~head.base) dll_update_at_~head.offset v_DerPreprocessor_19)) |dll_update_at_#in~head.base|) .cse0))) (= (bvadd (select |#valid| v_DerPreprocessor_15) (_ bv1 1)) (_ bv0 1)))))) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 22:34:31,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:34:31,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:34:31,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:34:31,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:34:31,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:34:31,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:34:31,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:34:31,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:34:31,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:34:31,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:34:31,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:34:31,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:34:31,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:34:31,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:34:31,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:34:31,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:34:31,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:34:31,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:34:31,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:34:31,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:34:31,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:34:31,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:34:31,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:34:31,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:34:31,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:34:31,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:34:31,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:34:31,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:34:31,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:34:31,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:34:31,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:34:31,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:34:31,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:34:31,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:34:31,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:34:31,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:34:31,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:34:31,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:34:31,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:34:31,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:34:31,770 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-19 22:34:31,782 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:34:31,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:34:31,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:34:31,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:34:31,783 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:34:31,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:34:31,784 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:34:31,784 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:34:31,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:34:31,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:34:31,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:34:31,785 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-19 22:34:31,785 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-19 22:34:31,785 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-19 22:34:31,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:34:31,785 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 22:34:31,786 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 22:34:31,786 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:34:31,786 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:34:31,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:34:31,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:34:31,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:34:31,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:34:31,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:34:31,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:34:31,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:34:31,788 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 22:34:31,788 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 22:34:31,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 22:34:31,789 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_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer 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 -> Automizer 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 -> fabf658906da38258bbb10e77b5550f740cea929 [2019-11-19 22:34:31,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:34:31,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:34:31,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:34:31,938 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:34:31,939 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:34:31,939 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2019-11-19 22:34:31,992 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/data/2f4b18048/31218f9e65754858b166f0b743e3291e/FLAG99f99b755 [2019-11-19 22:34:32,446 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:34:32,447 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/sv-benchmarks/c/list-simple/dll2n_update_all.i [2019-11-19 22:34:32,459 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/data/2f4b18048/31218f9e65754858b166f0b743e3291e/FLAG99f99b755 [2019-11-19 22:34:32,471 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/data/2f4b18048/31218f9e65754858b166f0b743e3291e [2019-11-19 22:34:32,473 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:34:32,474 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-19 22:34:32,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:34:32,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:34:32,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:34:32,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:34:32" (1/1) ... [2019-11-19 22:34:32,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11855a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:32, skipping insertion in model container [2019-11-19 22:34:32,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:34:32" (1/1) ... [2019-11-19 22:34:32,488 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:34:32,524 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:34:32,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:34:32,945 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:34:32,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:34:33,055 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:34:33,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:33 WrapperNode [2019-11-19 22:34:33,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:34:33,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:34:33,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:34:33,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:34:33,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:33" (1/1) ... [2019-11-19 22:34:33,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:33" (1/1) ... [2019-11-19 22:34:33,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:33" (1/1) ... [2019-11-19 22:34:33,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:33" (1/1) ... [2019-11-19 22:34:33,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:33" (1/1) ... [2019-11-19 22:34:33,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:33" (1/1) ... [2019-11-19 22:34:33,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:33" (1/1) ... [2019-11-19 22:34:33,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:34:33,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:34:33,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:34:33,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:34:33,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:33,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-19 22:34:33,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:34:33,188 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-19 22:34:33,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-19 22:34:33,189 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-19 22:34:33,189 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-19 22:34:33,189 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-11-19 22:34:33,189 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2019-11-19 22:34:33,189 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2019-11-19 22:34:33,190 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2019-11-19 22:34:33,190 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-19 22:34:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-19 22:34:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-19 22:34:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-19 22:34:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-19 22:34:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-19 22:34:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-19 22:34:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-19 22:34:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-19 22:34:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-19 22:34:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-19 22:34:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-19 22:34:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-19 22:34:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-19 22:34:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-19 22:34:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-19 22:34:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-19 22:34:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-19 22:34:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-19 22:34:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-19 22:34:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-19 22:34:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-19 22:34:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-19 22:34:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-19 22:34:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-19 22:34:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-19 22:34:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-19 22:34:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-19 22:34:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-19 22:34:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-19 22:34:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-19 22:34:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-19 22:34:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-19 22:34:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-19 22:34:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-19 22:34:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-19 22:34:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-19 22:34:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-19 22:34:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-19 22:34:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-19 22:34:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-19 22:34:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-19 22:34:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-19 22:34:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-19 22:34:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-19 22:34:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-19 22:34:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-19 22:34:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-19 22:34:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-19 22:34:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-19 22:34:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-19 22:34:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-19 22:34:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-19 22:34:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-19 22:34:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-19 22:34:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-19 22:34:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-19 22:34:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-19 22:34:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-19 22:34:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-19 22:34:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-19 22:34:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-19 22:34:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-19 22:34:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-19 22:34:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-19 22:34:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-19 22:34:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-19 22:34:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-19 22:34:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-19 22:34:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-19 22:34:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-19 22:34:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-19 22:34:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-19 22:34:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-19 22:34:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-19 22:34:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-19 22:34:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-19 22:34:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-19 22:34:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-19 22:34:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-19 22:34:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-19 22:34:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-19 22:34:33,204 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-19 22:34:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-19 22:34:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-19 22:34:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-19 22:34:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-19 22:34:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-19 22:34:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-19 22:34:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-19 22:34:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-19 22:34:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-19 22:34:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-19 22:34:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-19 22:34:33,206 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-19 22:34:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-19 22:34:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-19 22:34:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-19 22:34:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-19 22:34:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-19 22:34:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-19 22:34:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-19 22:34:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-19 22:34:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-19 22:34:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-19 22:34:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-19 22:34:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-19 22:34:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-19 22:34:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-19 22:34:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 22:34:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 22:34:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 22:34:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-11-19 22:34:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2019-11-19 22:34:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 22:34:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:34:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2019-11-19 22:34:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 22:34:33,210 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2019-11-19 22:34:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-19 22:34:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-19 22:34:33,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:34:33,679 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-19 22:34:34,053 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:34:34,053 INFO L285 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-19 22:34:34,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:34:34 BoogieIcfgContainer [2019-11-19 22:34:34,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:34:34,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:34:34,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:34:34,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:34:34,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:34:32" (1/3) ... [2019-11-19 22:34:34,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7b1726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:34:34, skipping insertion in model container [2019-11-19 22:34:34,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:33" (2/3) ... [2019-11-19 22:34:34,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7b1726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:34:34, skipping insertion in model container [2019-11-19 22:34:34,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:34:34" (3/3) ... [2019-11-19 22:34:34,064 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2019-11-19 22:34:34,073 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:34:34,082 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-11-19 22:34:34,090 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-11-19 22:34:34,107 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:34:34,107 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-19 22:34:34,107 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:34:34,107 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:34:34,107 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:34:34,107 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:34:34,107 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:34:34,108 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:34:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-19 22:34:34,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 22:34:34,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:34,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:34,139 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:34,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:34,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1949078934, now seen corresponding path program 1 times [2019-11-19 22:34:34,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:34,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2131056779] [2019-11-19 22:34:34,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:34,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:34:34,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:34,444 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-19 22:34:34,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:34,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:34,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:34,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:34:34,464 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-19 22:34:34,464 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:34,476 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-19 22:34:34,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2131056779] [2019-11-19 22:34:34,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:34,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 22:34:34,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765190984] [2019-11-19 22:34:34,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:34:34,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:34,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:34:34,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:34:34,496 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-11-19 22:34:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:34,652 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-11-19 22:34:34,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:34:34,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-19 22:34:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:34,664 INFO L225 Difference]: With dead ends: 85 [2019-11-19 22:34:34,664 INFO L226 Difference]: Without dead ends: 78 [2019-11-19 22:34:34,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-19 22:34:34,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-19 22:34:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-11-19 22:34:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 22:34:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-11-19 22:34:34,703 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 11 [2019-11-19 22:34:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:34,703 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-11-19 22:34:34,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:34:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-11-19 22:34:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 22:34:34,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:34,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:34,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:34,908 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:34,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:34,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1949078933, now seen corresponding path program 1 times [2019-11-19 22:34:34,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:34,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [489663861] [2019-11-19 22:34:34,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:35,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:34:35,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:35,107 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-19 22:34:35,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:35,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:35,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:35,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:34:35,136 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-19 22:34:35,136 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:35,190 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-19 22:34:35,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [489663861] [2019-11-19 22:34:35,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:35,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-19 22:34:35,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713124277] [2019-11-19 22:34:35,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:34:35,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:35,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:34:35,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:34:35,193 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2019-11-19 22:34:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:35,402 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-11-19 22:34:35,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:34:35,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-19 22:34:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:35,405 INFO L225 Difference]: With dead ends: 75 [2019-11-19 22:34:35,405 INFO L226 Difference]: Without dead ends: 75 [2019-11-19 22:34:35,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-19 22:34:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-19 22:34:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-11-19 22:34:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 22:34:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-11-19 22:34:35,415 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 11 [2019-11-19 22:34:35,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:35,415 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-11-19 22:34:35,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:34:35,415 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-11-19 22:34:35,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:34:35,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:35,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:35,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:35,627 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:35,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:35,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1176553966, now seen corresponding path program 1 times [2019-11-19 22:34:35,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:35,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1016439426] [2019-11-19 22:34:35,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:35,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:34:35,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:35,817 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-19 22:34:35,817 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:35,825 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-19 22:34:35,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1016439426] [2019-11-19 22:34:35,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:35,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-19 22:34:35,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179804694] [2019-11-19 22:34:35,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:34:35,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:35,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:34:35,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:34:35,827 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 3 states. [2019-11-19 22:34:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:35,884 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-11-19 22:34:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:34:35,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-19 22:34:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:35,887 INFO L225 Difference]: With dead ends: 81 [2019-11-19 22:34:35,887 INFO L226 Difference]: Without dead ends: 81 [2019-11-19 22:34:35,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-19 22:34:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-19 22:34:35,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2019-11-19 22:34:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 22:34:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-19 22:34:35,896 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2019-11-19 22:34:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:35,897 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-19 22:34:35,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:34:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-19 22:34:35,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 22:34:35,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:35,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:36,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:36,109 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:36,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:36,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1455041163, now seen corresponding path program 1 times [2019-11-19 22:34:36,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:36,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [354120754] [2019-11-19 22:34:36,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:36,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:34:36,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:36,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-19 22:34:36,335 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:36,425 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-19 22:34:36,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [354120754] [2019-11-19 22:34:36,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:36,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-19 22:34:36,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794293243] [2019-11-19 22:34:36,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:36,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:36,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:36,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:36,428 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 7 states. [2019-11-19 22:34:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:36,520 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-11-19 22:34:36,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:34:36,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-19 22:34:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:36,522 INFO L225 Difference]: With dead ends: 81 [2019-11-19 22:34:36,522 INFO L226 Difference]: Without dead ends: 78 [2019-11-19 22:34:36,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:34:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-19 22:34:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-11-19 22:34:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 22:34:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2019-11-19 22:34:36,530 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 18 [2019-11-19 22:34:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:36,530 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2019-11-19 22:34:36,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2019-11-19 22:34:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 22:34:36,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:36,531 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:36,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:36,742 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2030798451, now seen corresponding path program 1 times [2019-11-19 22:34:36,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:36,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1319970433] [2019-11-19 22:34:36,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:36,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:34:36,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:36,972 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-19 22:34:36,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:36,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:36,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:36,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:34:37,011 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:37,012 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 12 treesize of output 28 [2019-11-19 22:34:37,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:37,034 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-19 22:34:37,034 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-19 22:34:37,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-19 22:34:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:37,048 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:37,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1319970433] [2019-11-19 22:34:37,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:34:37,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-19 22:34:37,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565808186] [2019-11-19 22:34:37,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:34:37,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:37,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:34:37,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:34:37,071 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 4 states. [2019-11-19 22:34:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:37,232 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-11-19 22:34:37,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:34:37,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-19 22:34:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:37,236 INFO L225 Difference]: With dead ends: 77 [2019-11-19 22:34:37,236 INFO L226 Difference]: Without dead ends: 77 [2019-11-19 22:34:37,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:34:37,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-19 22:34:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-11-19 22:34:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-19 22:34:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-11-19 22:34:37,242 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 22 [2019-11-19 22:34:37,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:37,242 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-11-19 22:34:37,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:34:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-11-19 22:34:37,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 22:34:37,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:37,243 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:37,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:37,444 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:37,444 INFO L82 PathProgramCache]: Analyzing trace with hash -2030798450, now seen corresponding path program 1 times [2019-11-19 22:34:37,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:37,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1503363817] [2019-11-19 22:34:37,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:37,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:34:37,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:37,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-19 22:34:37,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:37,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:37,737 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-19 22:34:37,738 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:37,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:37,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:37,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-19 22:34:37,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:34:37,790 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 14 treesize of output 16 [2019-11-19 22:34:37,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:37,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:37,826 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:37,827 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 11 treesize of output 15 [2019-11-19 22:34:37,827 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:37,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:37,838 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-19 22:34:37,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-11-19 22:34:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:37,870 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:37,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:38,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1503363817] [2019-11-19 22:34:38,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:34:38,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-19 22:34:38,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364984780] [2019-11-19 22:34:38,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:34:38,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:38,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:34:38,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:34:38,228 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 8 states. [2019-11-19 22:34:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:38,752 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-11-19 22:34:38,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:34:38,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-19 22:34:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:38,754 INFO L225 Difference]: With dead ends: 80 [2019-11-19 22:34:38,754 INFO L226 Difference]: Without dead ends: 80 [2019-11-19 22:34:38,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:34:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-19 22:34:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2019-11-19 22:34:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-19 22:34:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-11-19 22:34:38,760 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 22 [2019-11-19 22:34:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:38,761 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-11-19 22:34:38,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:34:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-11-19 22:34:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:34:38,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:38,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:38,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:38,965 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:38,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:38,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1356620428, now seen corresponding path program 1 times [2019-11-19 22:34:38,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:38,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1728812941] [2019-11-19 22:34:38,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:39,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:34:39,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:39,181 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:39,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1728812941] [2019-11-19 22:34:39,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:34:39,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-19 22:34:39,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378643874] [2019-11-19 22:34:39,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:34:39,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:39,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:34:39,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:34:39,307 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2019-11-19 22:34:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:39,449 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-11-19 22:34:39,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:34:39,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-19 22:34:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:39,450 INFO L225 Difference]: With dead ends: 87 [2019-11-19 22:34:39,451 INFO L226 Difference]: Without dead ends: 84 [2019-11-19 22:34:39,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:34:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-19 22:34:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2019-11-19 22:34:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 22:34:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2019-11-19 22:34:39,456 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 25 [2019-11-19 22:34:39,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:39,457 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2019-11-19 22:34:39,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:34:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2019-11-19 22:34:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 22:34:39,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:39,458 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:39,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:39,667 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:39,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1238608021, now seen corresponding path program 2 times [2019-11-19 22:34:39,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:39,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1389445385] [2019-11-19 22:34:39,668 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:39,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-19 22:34:39,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:34:39,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:34:39,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 22:34:39,845 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 22:34:39,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1389445385] [2019-11-19 22:34:39,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:39,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-19 22:34:39,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739485585] [2019-11-19 22:34:39,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:34:39,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:39,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:34:39,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:34:39,876 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 8 states. [2019-11-19 22:34:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:39,965 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2019-11-19 22:34:39,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:34:39,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-11-19 22:34:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:39,968 INFO L225 Difference]: With dead ends: 96 [2019-11-19 22:34:39,968 INFO L226 Difference]: Without dead ends: 96 [2019-11-19 22:34:39,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:34:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-19 22:34:39,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2019-11-19 22:34:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-19 22:34:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-11-19 22:34:40,009 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 32 [2019-11-19 22:34:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:40,010 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-11-19 22:34:40,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:34:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-11-19 22:34:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 22:34:40,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:40,011 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:40,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:40,223 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:40,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1238608076, now seen corresponding path program 1 times [2019-11-19 22:34:40,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:40,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1842443211] [2019-11-19 22:34:40,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:40,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:34:40,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:40,386 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:40,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1842443211] [2019-11-19 22:34:40,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:34:40,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 22:34:40,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924087604] [2019-11-19 22:34:40,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:34:40,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:40,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:34:40,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:34:40,402 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 4 states. [2019-11-19 22:34:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:40,478 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2019-11-19 22:34:40,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:34:40,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-19 22:34:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:40,480 INFO L225 Difference]: With dead ends: 84 [2019-11-19 22:34:40,480 INFO L226 Difference]: Without dead ends: 84 [2019-11-19 22:34:40,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-19 22:34:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-19 22:34:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-11-19 22:34:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-19 22:34:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2019-11-19 22:34:40,485 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 32 [2019-11-19 22:34:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:40,486 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2019-11-19 22:34:40,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:34:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2019-11-19 22:34:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 22:34:40,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:40,487 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:40,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:40,689 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:40,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash -551368855, now seen corresponding path program 1 times [2019-11-19 22:34:40,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:40,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1438368779] [2019-11-19 22:34:40,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:40,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:34:40,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:40,916 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:40,916 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-19 22:34:40,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:40,931 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-19 22:34:40,931 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-19 22:34:40,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-19 22:34:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:41,023 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:34:41,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1438368779] [2019-11-19 22:34:41,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:41,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 9 [2019-11-19 22:34:41,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633540642] [2019-11-19 22:34:41,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:34:41,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:41,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:34:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:34:41,112 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 10 states. [2019-11-19 22:34:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:41,745 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-19 22:34:41,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:34:41,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-11-19 22:34:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:41,747 INFO L225 Difference]: With dead ends: 98 [2019-11-19 22:34:41,747 INFO L226 Difference]: Without dead ends: 98 [2019-11-19 22:34:41,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:34:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-19 22:34:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2019-11-19 22:34:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-19 22:34:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2019-11-19 22:34:41,752 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 33 [2019-11-19 22:34:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:41,753 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2019-11-19 22:34:41,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:34:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2019-11-19 22:34:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 22:34:41,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:41,754 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:41,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:41,963 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:41,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:41,963 INFO L82 PathProgramCache]: Analyzing trace with hash -551368854, now seen corresponding path program 1 times [2019-11-19 22:34:41,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:41,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2024541470] [2019-11-19 22:34:41,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:42,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 22:34:42,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:42,174 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-19 22:34:42,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:42,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:42,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:42,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:34:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:34:42,273 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:34:42,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2024541470] [2019-11-19 22:34:42,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:42,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-19 22:34:42,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989489264] [2019-11-19 22:34:42,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 22:34:42,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:42,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 22:34:42,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:34:42,885 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 16 states. [2019-11-19 22:34:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:44,079 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2019-11-19 22:34:44,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:34:44,081 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-11-19 22:34:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:44,082 INFO L225 Difference]: With dead ends: 90 [2019-11-19 22:34:44,082 INFO L226 Difference]: Without dead ends: 90 [2019-11-19 22:34:44,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-11-19 22:34:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-19 22:34:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-11-19 22:34:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-19 22:34:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2019-11-19 22:34:44,086 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 33 [2019-11-19 22:34:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:44,087 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2019-11-19 22:34:44,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 22:34:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2019-11-19 22:34:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 22:34:44,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:44,088 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:44,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:44,289 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:44,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:44,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1165986280, now seen corresponding path program 1 times [2019-11-19 22:34:44,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:44,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [249915925] [2019-11-19 22:34:44,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:44,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:34:44,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:44,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 22:34:44,521 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 22:34:44,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [249915925] [2019-11-19 22:34:44,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:44,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 22:34:44,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710671042] [2019-11-19 22:34:44,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:34:44,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:44,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:34:44,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:34:44,546 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2019-11-19 22:34:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:44,601 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-11-19 22:34:44,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:34:44,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-19 22:34:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:44,603 INFO L225 Difference]: With dead ends: 94 [2019-11-19 22:34:44,603 INFO L226 Difference]: Without dead ends: 94 [2019-11-19 22:34:44,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-19 22:34:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-11-19 22:34:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-19 22:34:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-11-19 22:34:44,607 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 35 [2019-11-19 22:34:44,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:44,608 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-11-19 22:34:44,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:34:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-11-19 22:34:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 22:34:44,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:44,609 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:44,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:44,810 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash 592824388, now seen corresponding path program 1 times [2019-11-19 22:34:44,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:44,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1436086313] [2019-11-19 22:34:44,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:45,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:34:45,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 22:34:45,100 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 22:34:45,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1436086313] [2019-11-19 22:34:45,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:34:45,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-19 22:34:45,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275738476] [2019-11-19 22:34:45,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:34:45,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:45,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:34:45,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:34:45,203 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 12 states. [2019-11-19 22:34:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:45,473 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2019-11-19 22:34:45,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:34:45,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-11-19 22:34:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:45,474 INFO L225 Difference]: With dead ends: 109 [2019-11-19 22:34:45,474 INFO L226 Difference]: Without dead ends: 109 [2019-11-19 22:34:45,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:34:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-19 22:34:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-19 22:34:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-19 22:34:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2019-11-19 22:34:45,479 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 44 [2019-11-19 22:34:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:45,479 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2019-11-19 22:34:45,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:34:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2019-11-19 22:34:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 22:34:45,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:45,481 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:45,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:34:45,684 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:34:45,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash 592824333, now seen corresponding path program 1 times [2019-11-19 22:34:45,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:34:45,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [336371458] [2019-11-19 22:34:45,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/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-19 22:34:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:45,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-19 22:34:45,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:45,991 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-19 22:34:45,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:45,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:45,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:45,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:34:46,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:46,060 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-19 22:34:46,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:46,091 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-19 22:34:46,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:46,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-11-19 22:34:46,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-19 22:34:46,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:46,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:46,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:46,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-19 22:34:46,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:34:46,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 22:34:46,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:46,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:46,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:46,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-11-19 22:34:46,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:34:46,243 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:46,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 113 [2019-11-19 22:34:46,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:46,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:46,285 INFO L567 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-11-19 22:34:46,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:46,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:58 [2019-11-19 22:34:46,522 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:46,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 47 [2019-11-19 22:34:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:46,524 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:46,553 INFO L567 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-11-19 22:34:46,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:46,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:20 [2019-11-19 22:34:54,840 WARN L191 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-19 22:34:54,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:54,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 104 [2019-11-19 22:34:54,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:54,904 INFO L567 ElimStorePlain]: treesize reduction 64, result has 50.0 percent of original size [2019-11-19 22:34:54,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:54,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:64 [2019-11-19 22:34:55,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:55,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 52 [2019-11-19 22:34:55,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:55,114 INFO L567 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-11-19 22:34:55,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:55,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:19 [2019-11-19 22:34:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:34:55,283 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:34:55,597 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:55,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:55,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:55,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:14 [2019-11-19 22:34:55,721 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:55,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:55,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:55,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:36 [2019-11-19 22:34:58,228 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-19 22:34:59,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:59,061 INFO L567 ElimStorePlain]: treesize reduction 31, result has 13.9 percent of original size [2019-11-19 22:34:59,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:59,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:5 [2019-11-19 22:34:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:34:59,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [336371458] [2019-11-19 22:34:59,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:34:59,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2019-11-19 22:34:59,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704744914] [2019-11-19 22:34:59,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-19 22:34:59,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:34:59,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-19 22:34:59,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=945, Unknown=1, NotChecked=0, Total=1056 [2019-11-19 22:34:59,209 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 33 states. [2019-11-19 22:35:02,377 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2019-11-19 22:35:05,130 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-11-19 22:35:07,408 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-11-19 22:35:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:12,599 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-11-19 22:35:12,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-19 22:35:12,600 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2019-11-19 22:35:12,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:12,601 INFO L225 Difference]: With dead ends: 114 [2019-11-19 22:35:12,601 INFO L226 Difference]: Without dead ends: 114 [2019-11-19 22:35:12,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=313, Invalid=2134, Unknown=3, NotChecked=0, Total=2450 [2019-11-19 22:35:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-19 22:35:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2019-11-19 22:35:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-19 22:35:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-19 22:35:12,607 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 44 [2019-11-19 22:35:12,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:12,608 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-19 22:35:12,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-19 22:35:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-19 22:35:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 22:35:12,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:12,609 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:35:12,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:12,810 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:35:12,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:12,810 INFO L82 PathProgramCache]: Analyzing trace with hash 592824334, now seen corresponding path program 1 times [2019-11-19 22:35:12,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:35:12,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1046212401] [2019-11-19 22:35:12,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:13,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-19 22:35:13,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:35:13,159 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-19 22:35:13,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,171 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-19 22:35:13,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,179 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-19 22:35:13,213 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,213 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 11 treesize of output 15 [2019-11-19 22:35:13,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,230 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 14 treesize of output 16 [2019-11-19 22:35:13,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-19 22:35:13,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-19 22:35:13,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-19 22:35:13,286 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,303 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2019-11-19 22:35:13,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:35:13,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 22:35:13,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:35:13,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 22:35:13,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2019-11-19 22:35:13,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:35:13,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:35:13,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 70 [2019-11-19 22:35:13,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,518 INFO L567 ElimStorePlain]: treesize reduction 30, result has 76.0 percent of original size [2019-11-19 22:35:13,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:35:13,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 38 [2019-11-19 22:35:13,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,554 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:85 [2019-11-19 22:35:13,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-11-19 22:35:13,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:13,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,852 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:13,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2019-11-19 22:35:13,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:13,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:13,853 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:13,877 INFO L567 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2019-11-19 22:35:13,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:13,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:23 [2019-11-19 22:35:14,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2019-11-19 22:35:14,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:14,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:14,189 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:14,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 57 [2019-11-19 22:35:14,190 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:14,262 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.0 percent of original size [2019-11-19 22:35:14,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:14,263 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:85 [2019-11-19 22:35:14,479 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:14,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 37 [2019-11-19 22:35:14,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:14,510 INFO L567 ElimStorePlain]: treesize reduction 8, result has 84.3 percent of original size [2019-11-19 22:35:14,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-19 22:35:14,514 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:14,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:14,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:14,522 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:18 [2019-11-19 22:35:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:35:14,655 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:35:15,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:35:15,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:15,590 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:15,594 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:15,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:15,647 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:15,652 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:15,656 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:15,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:15,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-19 22:35:15,671 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:145, output treesize:61 [2019-11-19 22:35:16,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:35:16,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:16,289 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:16,295 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:16,428 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-19 22:35:16,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:16,436 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:16,451 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:16,457 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:16,630 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-19 22:35:16,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:16,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-19 22:35:16,632 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:289, output treesize:233 [2019-11-19 22:35:17,199 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-19 22:35:18,257 WARN L191 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-19 22:35:18,507 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-19 22:35:18,754 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-19 22:35:19,026 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-19 22:35:20,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:20,666 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-19 22:35:20,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:20,680 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:20,854 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-19 22:35:20,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:20,859 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:25,058 WARN L191 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-11-19 22:35:25,059 INFO L567 ElimStorePlain]: treesize reduction 69, result has 61.9 percent of original size [2019-11-19 22:35:25,065 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:25,171 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-19 22:35:25,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:25,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-19 22:35:25,172 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:196, output treesize:109 [2019-11-19 22:35:25,546 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-19 22:35:25,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:35:25,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:25,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:25,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:35:25,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:25,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:25,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:25,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:25,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:25,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:27,103 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-11-19 22:35:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:35:27,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1046212401] [2019-11-19 22:35:27,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:35:27,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2019-11-19 22:35:27,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85997405] [2019-11-19 22:35:27,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-19 22:35:27,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:35:27,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-19 22:35:27,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2019-11-19 22:35:27,507 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 34 states. [2019-11-19 22:35:30,978 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-19 22:35:32,709 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-19 22:35:34,049 WARN L191 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 70 [2019-11-19 22:35:34,453 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-11-19 22:35:34,879 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 43 [2019-11-19 22:35:35,332 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 39 [2019-11-19 22:35:38,423 WARN L191 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-11-19 22:35:39,960 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-19 22:35:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:42,030 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2019-11-19 22:35:42,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-19 22:35:42,031 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 44 [2019-11-19 22:35:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:42,033 INFO L225 Difference]: With dead ends: 179 [2019-11-19 22:35:42,034 INFO L226 Difference]: Without dead ends: 179 [2019-11-19 22:35:42,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=363, Invalid=2393, Unknown=0, NotChecked=0, Total=2756 [2019-11-19 22:35:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-19 22:35:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 118. [2019-11-19 22:35:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-19 22:35:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2019-11-19 22:35:42,043 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 44 [2019-11-19 22:35:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:42,043 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2019-11-19 22:35:42,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-19 22:35:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2019-11-19 22:35:42,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-19 22:35:42,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:42,045 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:35:42,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:42,251 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:35:42,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:42,251 INFO L82 PathProgramCache]: Analyzing trace with hash -238336132, now seen corresponding path program 1 times [2019-11-19 22:35:42,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:35:42,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [672412371] [2019-11-19 22:35:42,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:42,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:35:42,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:35:42,647 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:42,647 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-19 22:35:42,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:42,664 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-19 22:35:42,664 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-19 22:35:42,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-19 22:35:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-19 22:35:42,800 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:35:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 22:35:42,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [672412371] [2019-11-19 22:35:42,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:35:42,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 9 [2019-11-19 22:35:42,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55557925] [2019-11-19 22:35:42,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:35:42,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:35:42,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:35:42,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:35:42,905 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand 10 states. [2019-11-19 22:35:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:43,610 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-11-19 22:35:43,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:35:43,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-19 22:35:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:43,612 INFO L225 Difference]: With dead ends: 132 [2019-11-19 22:35:43,612 INFO L226 Difference]: Without dead ends: 132 [2019-11-19 22:35:43,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:35:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-19 22:35:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2019-11-19 22:35:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-19 22:35:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2019-11-19 22:35:43,619 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 54 [2019-11-19 22:35:43,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:43,620 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2019-11-19 22:35:43,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:35:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2019-11-19 22:35:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-19 22:35:43,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:43,621 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:35:43,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:43,829 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:35:43,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash -238336131, now seen corresponding path program 1 times [2019-11-19 22:35:43,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:35:43,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1862577156] [2019-11-19 22:35:43,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:44,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 22:35:44,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:35:44,204 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-19 22:35:44,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:44,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:44,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:35:44,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:35:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 22:35:44,421 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:35:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 22:35:45,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1862577156] [2019-11-19 22:35:45,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:35:45,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2019-11-19 22:35:45,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848914429] [2019-11-19 22:35:45,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 22:35:45,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:35:45,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 22:35:45,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:35:45,145 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand 17 states. [2019-11-19 22:35:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:46,812 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-11-19 22:35:46,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:35:46,813 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-11-19 22:35:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:46,815 INFO L225 Difference]: With dead ends: 125 [2019-11-19 22:35:46,815 INFO L226 Difference]: Without dead ends: 125 [2019-11-19 22:35:46,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:35:46,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-19 22:35:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2019-11-19 22:35:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-19 22:35:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2019-11-19 22:35:46,822 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 54 [2019-11-19 22:35:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:46,822 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2019-11-19 22:35:46,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 22:35:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2019-11-19 22:35:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-19 22:35:46,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:46,824 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:35:47,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:47,024 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:35:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1058060576, now seen corresponding path program 2 times [2019-11-19 22:35:47,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:35:47,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [818687292] [2019-11-19 22:35:47,025 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:47,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:35:47,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:35:47,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:35:47,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:35:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-19 22:35:47,358 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:35:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-19 22:35:47,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [818687292] [2019-11-19 22:35:47,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:35:47,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-19 22:35:47,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612742793] [2019-11-19 22:35:47,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:35:47,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:35:47,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:35:47,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:35:47,426 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 10 states. [2019-11-19 22:35:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:47,506 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-11-19 22:35:47,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:35:47,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-11-19 22:35:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:47,510 INFO L225 Difference]: With dead ends: 91 [2019-11-19 22:35:47,510 INFO L226 Difference]: Without dead ends: 91 [2019-11-19 22:35:47,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:35:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-19 22:35:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-19 22:35:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-19 22:35:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-11-19 22:35:47,515 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 55 [2019-11-19 22:35:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:47,516 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2019-11-19 22:35:47,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:35:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2019-11-19 22:35:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 22:35:47,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:47,517 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:35:47,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:47,728 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:35:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:47,728 INFO L82 PathProgramCache]: Analyzing trace with hash -689115899, now seen corresponding path program 1 times [2019-11-19 22:35:47,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:35:47,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1784588410] [2019-11-19 22:35:47,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:48,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:35:48,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:35:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-19 22:35:48,101 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:35:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-19 22:35:48,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1784588410] [2019-11-19 22:35:48,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:35:48,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-19 22:35:48,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669341252] [2019-11-19 22:35:48,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:35:48,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:35:48,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:35:48,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:35:48,153 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 8 states. [2019-11-19 22:35:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:48,237 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-11-19 22:35:48,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:35:48,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-11-19 22:35:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:48,239 INFO L225 Difference]: With dead ends: 97 [2019-11-19 22:35:48,240 INFO L226 Difference]: Without dead ends: 97 [2019-11-19 22:35:48,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:35:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-19 22:35:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-11-19 22:35:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-19 22:35:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2019-11-19 22:35:48,244 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 57 [2019-11-19 22:35:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:48,245 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2019-11-19 22:35:48,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:35:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2019-11-19 22:35:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-19 22:35:48,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:48,246 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:35:48,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:48,452 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 22:35:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:48,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2087866240, now seen corresponding path program 1 times [2019-11-19 22:35:48,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:35:48,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [827565200] [2019-11-19 22:35:48,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_818d3857-5eec-432e-9f5d-36a65a61144c/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:48,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-19 22:35:48,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:35:48,982 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-19 22:35:48,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:48,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:48,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:35:48,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:35:49,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:49,037 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-19 22:35:49,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:49,071 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-19 22:35:49,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:35:49,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-19 22:35:49,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-19 22:35:49,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:49,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:49,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:35:49,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-19 22:35:49,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:35:49,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 22:35:49,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:49,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:49,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:35:49,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-19 22:35:49,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:35:49,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 32 [2019-11-19 22:35:49,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:49,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:49,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:49,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-11-19 22:35:49,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 22:35:49,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:49,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:49,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:49,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:20 [2019-11-19 22:35:49,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2019-11-19 22:35:49,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:49,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:49,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:49,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2019-11-19 22:35:49,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:35:49,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:35:49,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:35:49,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2019-11-19 22:35:49,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:49,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:49,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:49,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:61 [2019-11-19 22:35:49,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 22:35:49,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:49,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:49,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:49,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:23 [2019-11-19 22:35:50,244 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_BEFORE_CALL_9|], 6=[|v_#memory_$Pointer$.offset_BEFORE_CALL_8|]} [2019-11-19 22:35:50,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:35:50,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-11-19 22:35:50,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:50,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:50,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:35:50,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-11-19 22:35:50,293 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:50,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:50,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:50,330 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:117, output treesize:47 [2019-11-19 22:35:50,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-19 22:35:50,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:50,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:50,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:50,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:27 [2019-11-19 22:35:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 22:35:50,974 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:35:51,426 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:51,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:51,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:51,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:52 [2019-11-19 22:35:51,686 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:51,690 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:51,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:51,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-19 22:35:51,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:124, output treesize:108 [2019-11-19 22:35:52,030 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-11-19 22:35:52,765 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_272|], 2=[|v_#memory_$Pointer$.offset_267|], 7=[|v_#memory_$Pointer$.base_273|]} [2019-11-19 22:35:52,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-11-19 22:35:52,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:52,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:52,808 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:52,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:52,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 62 [2019-11-19 22:35:52,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:35:52,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:52,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:52,823 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:52,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:52,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:52,833 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:84, output treesize:31 [2019-11-19 22:35:53,238 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|v_#memory_$Pointer$.offset_268|], 7=[|v_#memory_$Pointer$.base_274|]} [2019-11-19 22:35:53,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-11-19 22:35:53,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:53,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:53,307 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:35:53,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:35:53,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 72 [2019-11-19 22:35:53,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:35:53,349 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:35:53,439 INFO L567 ElimStorePlain]: treesize reduction 20, result has 71.8 percent of original size [2019-11-19 22:35:53,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:35:53,641 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (forall ((v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32))) (let ((.cse0 (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) (or (= .cse0 (select (store (select |old(#memory_$Pointer$.offset)| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset| v_DerPreprocessor_18) .cse0)) (not (= (bvadd (select |#valid| |dll_update_at_#in~head.base|) (_ bv1 1)) (_ bv0 1))) (not (= .cse0 (select (select (store |#memory_$Pointer$.offset| dll_update_at_~head.base (store (select |#memory_$Pointer$.offset| dll_update_at_~head.base) dll_update_at_~head.offset v_DerPreprocessor_19)) |dll_update_at_#in~head.base|) .cse0))) (= (bvadd (select |#valid| v_DerPreprocessor_15) (_ bv1 1)) (_ bv0 1)))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:493) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-19 22:35:53,645 INFO L168 Benchmark]: Toolchain (without parser) took 81170.80 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.5 MB). Free memory was 943.4 MB in the beginning and 840.9 MB in the end (delta: 102.5 MB). Peak memory consumption was 340.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:35:53,645 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:35:53,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:35:53,647 INFO L168 Benchmark]: Boogie Preprocessor took 73.28 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:35:53,647 INFO L168 Benchmark]: RCFGBuilder took 924.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:35:53,648 INFO L168 Benchmark]: TraceAbstraction took 79588.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 106.4 MB). Free memory was 1.0 GB in the beginning and 840.9 MB in the end (delta: 196.6 MB). Peak memory consumption was 303.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:35:53,649 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 581.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.28 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 924.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79588.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 106.4 MB). Free memory was 1.0 GB in the beginning and 840.9 MB in the end (delta: 196.6 MB). Peak memory consumption was 303.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32))) (let ((.cse0 (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) (or (= .cse0 (select (store (select |old(#memory_$Pointer$.offset)| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset| v_DerPreprocessor_18) .cse0)) (not (= (bvadd (select |#valid| |dll_update_at_#in~head.base|) (_ bv1 1)) (_ bv0 1))) (not (= .cse0 (select (select (store |#memory_$Pointer$.offset| dll_update_at_~head.base (store (select |#memory_$Pointer$.offset| dll_update_at_~head.base) dll_update_at_~head.offset v_DerPreprocessor_19)) |dll_update_at_#in~head.base|) .cse0))) (= (bvadd (select |#valid| v_DerPreprocessor_15) (_ bv1 1)) (_ bv0 1)))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (forall ((v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32))) (let ((.cse0 (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) (or (= .cse0 (select (store (select |old(#memory_$Pointer$.offset)| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset| v_DerPreprocessor_18) .cse0)) (not (= (bvadd (select |#valid| |dll_update_at_#in~head.base|) (_ bv1 1)) (_ bv0 1))) (not (= .cse0 (select (select (store |#memory_$Pointer$.offset| dll_update_at_~head.base (store (select |#memory_$Pointer$.offset| dll_update_at_~head.base) dll_update_at_~head.offset v_DerPreprocessor_19)) |dll_update_at_#in~head.base|) .cse0))) (= (bvadd (select |#valid| v_DerPreprocessor_15) (_ bv1 1)) (_ bv0 1)))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...