./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.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_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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 f4732dd3bead498dcfa33caf242cd74b12e0ffa3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 08:22:34,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:22:34,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:22:34,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:22:34,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:22:34,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:22:34,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:22:34,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:22:34,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:22:34,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:22:34,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:22:34,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:22:34,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:22:34,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:22:34,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:22:34,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:22:34,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:22:34,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:22:34,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:22:34,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:22:34,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:22:34,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:22:34,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:22:34,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:22:34,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:22:34,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:22:34,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:22:34,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:22:34,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:22:34,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:22:34,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:22:34,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:22:34,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:22:34,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:22:34,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:22:34,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:22:34,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:22:34,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:22:34,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:22:34,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:22:34,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:22:34,969 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 08:22:34,983 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:22:34,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:22:34,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:22:34,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:22:34,984 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 08:22:34,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:22:34,985 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:22:34,985 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 08:22:34,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 08:22:34,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:22:34,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:22:34,986 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 08:22:34,986 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 08:22:34,987 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 08:22:34,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:22:34,987 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 08:22:34,987 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 08:22:34,988 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:22:34,988 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:22:34,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:22:34,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 08:22:34,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:22:34,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 08:22:34,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:22:34,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:22:34,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:22:34,990 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 08:22:34,990 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 08:22:34,990 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 08:22:34,990 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_086b5e4e-ed4e-4098-868e-38763433000a/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 -> f4732dd3bead498dcfa33caf242cd74b12e0ffa3 [2019-11-20 08:22:35,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:22:35,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:22:35,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:22:35,167 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:22:35,168 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:22:35,168 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i [2019-11-20 08:22:35,254 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/data/e2ea27e2d/0687b64df86340ef96fb3a6ea607097f/FLAG3889401f5 [2019-11-20 08:22:35,751 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:22:35,752 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i [2019-11-20 08:22:35,778 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/data/e2ea27e2d/0687b64df86340ef96fb3a6ea607097f/FLAG3889401f5 [2019-11-20 08:22:36,078 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/data/e2ea27e2d/0687b64df86340ef96fb3a6ea607097f [2019-11-20 08:22:36,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:22:36,081 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 08:22:36,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:22:36,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:22:36,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:22:36,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:22:36" (1/1) ... [2019-11-20 08:22:36,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3440089a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:36, skipping insertion in model container [2019-11-20 08:22:36,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:22:36" (1/1) ... [2019-11-20 08:22:36,097 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:22:36,150 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:22:36,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:22:36,578 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:22:36,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:22:36,697 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:22:36,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:36 WrapperNode [2019-11-20 08:22:36,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:22:36,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:22:36,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:22:36,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:22:36,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:36" (1/1) ... [2019-11-20 08:22:36,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:36" (1/1) ... [2019-11-20 08:22:36,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:36" (1/1) ... [2019-11-20 08:22:36,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:36" (1/1) ... [2019-11-20 08:22:36,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:36" (1/1) ... [2019-11-20 08:22:36,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:36" (1/1) ... [2019-11-20 08:22:36,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:36" (1/1) ... [2019-11-20 08:22:36,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:22:36,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:22:36,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:22:36,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:22:36,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:36,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 08:22:36,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:22:36,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 08:22:36,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 08:22:36,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 08:22:36,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 08:22:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 08:22:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2019-11-20 08:22:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 08:22:36,831 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 08:22:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 08:22:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 08:22:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 08:22:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 08:22:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 08:22:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 08:22:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 08:22:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 08:22:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 08:22:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 08:22:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 08:22:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 08:22:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 08:22:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 08:22:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 08:22:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 08:22:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 08:22:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 08:22:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 08:22:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 08:22:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 08:22:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 08:22:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 08:22:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 08:22:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 08:22:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 08:22:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 08:22:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 08:22:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 08:22:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 08:22:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 08:22:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 08:22:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 08:22:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 08:22:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 08:22:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 08:22:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 08:22:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 08:22:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 08:22:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 08:22:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 08:22:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 08:22:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 08:22:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 08:22:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 08:22:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 08:22:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 08:22:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 08:22:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 08:22:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 08:22:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 08:22:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 08:22:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 08:22:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 08:22:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 08:22:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 08:22:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 08:22:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 08:22:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 08:22:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 08:22:36,844 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 08:22:36,844 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 08:22:36,844 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 08:22:36,844 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 08:22:36,844 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 08:22:36,845 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 08:22:36,845 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 08:22:36,845 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 08:22:36,845 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 08:22:36,845 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 08:22:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 08:22:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 08:22:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 08:22:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 08:22:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 08:22:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 08:22:36,847 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 08:22:36,847 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 08:22:36,847 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 08:22:36,847 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 08:22:36,847 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 08:22:36,847 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 08:22:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 08:22:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 08:22:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 08:22:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 08:22:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 08:22:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 08:22:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 08:22:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 08:22:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 08:22:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 08:22:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 08:22:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 08:22:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 08:22:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 08:22:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 08:22:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 08:22:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 08:22:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 08:22:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 08:22:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 08:22:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 08:22:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 08:22:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 08:22:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 08:22:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 08:22:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-20 08:22:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2019-11-20 08:22:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-20 08:22:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 08:22:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 08:22:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-20 08:22:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 08:22:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 08:22:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:22:37,456 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:22:37,456 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 08:22:37,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:22:37 BoogieIcfgContainer [2019-11-20 08:22:37,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:22:37,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 08:22:37,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 08:22:37,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 08:22:37,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:22:36" (1/3) ... [2019-11-20 08:22:37,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7b486b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:22:37, skipping insertion in model container [2019-11-20 08:22:37,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:36" (2/3) ... [2019-11-20 08:22:37,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7b486b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:22:37, skipping insertion in model container [2019-11-20 08:22:37,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:22:37" (3/3) ... [2019-11-20 08:22:37,465 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca-2.i [2019-11-20 08:22:37,474 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 08:22:37,481 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-20 08:22:37,492 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-20 08:22:37,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 08:22:37,511 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 08:22:37,511 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 08:22:37,512 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 08:22:37,512 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 08:22:37,512 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 08:22:37,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 08:22:37,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 08:22:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-11-20 08:22:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 08:22:37,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:37,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:22:37,534 INFO L410 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:37,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:37,538 INFO L82 PathProgramCache]: Analyzing trace with hash -840645379, now seen corresponding path program 1 times [2019-11-20 08:22:37,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:37,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1005830809] [2019-11-20 08:22:37,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:37,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:22:37,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:37,853 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-20 08:22:37,853 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:37,913 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-20 08:22:37,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1005830809] [2019-11-20 08:22:37,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:22:37,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 08:22:37,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363792769] [2019-11-20 08:22:37,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 08:22:37,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:37,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 08:22:37,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:22:37,937 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 6 states. [2019-11-20 08:22:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:38,106 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2019-11-20 08:22:38,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:22:38,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-20 08:22:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:38,119 INFO L225 Difference]: With dead ends: 71 [2019-11-20 08:22:38,120 INFO L226 Difference]: Without dead ends: 67 [2019-11-20 08:22:38,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:22:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-20 08:22:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-11-20 08:22:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 08:22:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-11-20 08:22:38,165 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 11 [2019-11-20 08:22:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:38,168 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-11-20 08:22:38,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 08:22:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-11-20 08:22:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 08:22:38,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:38,171 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:22:38,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:38,372 INFO L410 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:38,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:38,373 INFO L82 PathProgramCache]: Analyzing trace with hash -838798337, now seen corresponding path program 1 times [2019-11-20 08:22:38,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:38,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1299266487] [2019-11-20 08:22:38,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:38,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 08:22:38,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:38,628 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_19|], 1=[|v_#valid_31|]} [2019-11-20 08:22:38,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:22:38,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 08:22:38,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:38,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:38,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 08:22:38,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:38,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:38,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:38,746 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-11-20 08:22:38,777 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-20 08:22:38,777 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:38,895 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 08:22:38,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 08:22:38,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:38,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:38,925 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:22:38,926 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:38,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:38,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:38,938 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-11-20 08:22:38,950 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-20 08:22:38,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1299266487] [2019-11-20 08:22:38,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:22:38,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 08:22:38,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085369435] [2019-11-20 08:22:38,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:22:38,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:38,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:22:38,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:22:38,954 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 5 states. [2019-11-20 08:22:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:39,515 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2019-11-20 08:22:39,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:22:39,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-20 08:22:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:39,517 INFO L225 Difference]: With dead ends: 72 [2019-11-20 08:22:39,518 INFO L226 Difference]: Without dead ends: 72 [2019-11-20 08:22:39,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 08:22:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-20 08:22:39,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2019-11-20 08:22:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 08:22:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-11-20 08:22:39,527 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 11 [2019-11-20 08:22:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:39,527 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-11-20 08:22:39,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:22:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-11-20 08:22:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 08:22:39,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:39,529 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:22:39,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:39,730 INFO L410 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:39,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:39,730 INFO L82 PathProgramCache]: Analyzing trace with hash -838798338, now seen corresponding path program 1 times [2019-11-20 08:22:39,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:39,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [85803222] [2019-11-20 08:22:39,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:39,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 08:22:39,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:39,943 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 08:22:39,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 08:22:39,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:39,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:39,953 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-20 08:22:39,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-20 08:22:39,979 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-20 08:22:39,979 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:39,996 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-20 08:22:39,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [85803222] [2019-11-20 08:22:39,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:22:39,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 08:22:39,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861202283] [2019-11-20 08:22:39,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:22:39,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:39,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:22:39,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:22:39,999 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 4 states. [2019-11-20 08:22:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:40,122 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-11-20 08:22:40,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:22:40,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 08:22:40,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:40,124 INFO L225 Difference]: With dead ends: 50 [2019-11-20 08:22:40,124 INFO L226 Difference]: Without dead ends: 50 [2019-11-20 08:22:40,124 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-20 08:22:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-20 08:22:40,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-20 08:22:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 08:22:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-11-20 08:22:40,130 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 11 [2019-11-20 08:22:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:40,130 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-11-20 08:22:40,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:22:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-11-20 08:22:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 08:22:40,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:40,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:22:40,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:40,334 INFO L410 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:40,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:40,335 INFO L82 PathProgramCache]: Analyzing trace with hash -406408972, now seen corresponding path program 1 times [2019-11-20 08:22:40,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:40,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [151982357] [2019-11-20 08:22:40,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:40,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 08:22:40,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:40,553 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_41|]} [2019-11-20 08:22:40,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:22:40,560 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 08:22:40,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:40,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:40,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 08:22:40,586 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:40,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:40,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:40,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:14 [2019-11-20 08:22:40,620 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-20 08:22:40,621 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:40,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:22:40,704 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 08:22:40,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:22:40,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:40,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:40,734 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-20 08:22:40,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 08:22:40,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:11 [2019-11-20 08:22:40,784 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-20 08:22:40,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [151982357] [2019-11-20 08:22:40,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:22:40,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 08:22:40,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619615476] [2019-11-20 08:22:40,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 08:22:40,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:40,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 08:22:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:22:40,786 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 6 states. [2019-11-20 08:22:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:41,153 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-11-20 08:22:41,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:22:41,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-20 08:22:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:41,156 INFO L225 Difference]: With dead ends: 64 [2019-11-20 08:22:41,156 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 08:22:41,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 08:22:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 08:22:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2019-11-20 08:22:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 08:22:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-11-20 08:22:41,164 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 13 [2019-11-20 08:22:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:41,164 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-11-20 08:22:41,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 08:22:41,165 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-11-20 08:22:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 08:22:41,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:41,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:22:41,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:41,369 INFO L410 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:41,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:41,369 INFO L82 PathProgramCache]: Analyzing trace with hash -406408920, now seen corresponding path program 1 times [2019-11-20 08:22:41,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:41,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [294812422] [2019-11-20 08:22:41,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:41,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:22:41,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:41,574 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-20 08:22:41,574 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:22:41,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [294812422] [2019-11-20 08:22:41,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:22:41,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 08:22:41,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938379049] [2019-11-20 08:22:41,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 08:22:41,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:41,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 08:22:41,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:22:41,637 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 6 states. [2019-11-20 08:22:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:41,760 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2019-11-20 08:22:41,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:22:41,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-20 08:22:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:41,762 INFO L225 Difference]: With dead ends: 69 [2019-11-20 08:22:41,762 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 08:22:41,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:22:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 08:22:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-20 08:22:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 08:22:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-20 08:22:41,770 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 13 [2019-11-20 08:22:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:41,770 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-20 08:22:41,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 08:22:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-20 08:22:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 08:22:41,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:41,772 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:22:41,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:41,979 INFO L410 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:41,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:41,979 INFO L82 PathProgramCache]: Analyzing trace with hash -349150618, now seen corresponding path program 1 times [2019-11-20 08:22:41,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:41,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [233840226] [2019-11-20 08:22:41,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:42,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:22:42,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:42,183 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 08:22:42,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 08:22:42,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:42,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:42,191 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-20 08:22:42,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 08:22:42,200 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-20 08:22:42,200 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:22:42,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [233840226] [2019-11-20 08:22:42,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:22:42,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 08:22:42,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922930030] [2019-11-20 08:22:42,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:22:42,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:22:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:22:42,209 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 3 states. [2019-11-20 08:22:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:42,277 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-11-20 08:22:42,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:22:42,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 08:22:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:42,281 INFO L225 Difference]: With dead ends: 58 [2019-11-20 08:22:42,281 INFO L226 Difference]: Without dead ends: 58 [2019-11-20 08:22:42,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-20 08:22:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-20 08:22:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-20 08:22:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-20 08:22:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-11-20 08:22:42,285 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 13 [2019-11-20 08:22:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:42,285 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-11-20 08:22:42,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:22:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-11-20 08:22:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 08:22:42,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:42,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:22:42,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:42,487 INFO L410 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:42,487 INFO L82 PathProgramCache]: Analyzing trace with hash -349150617, now seen corresponding path program 1 times [2019-11-20 08:22:42,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:42,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1957651722] [2019-11-20 08:22:42,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:42,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 08:22:42,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:42,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:42,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 08:22:42,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:42,722 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 08:22:42,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:42,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-11-20 08:22:42,756 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-20 08:22:42,756 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:42,897 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-20 08:22:42,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1957651722] [2019-11-20 08:22:42,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:22:42,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 08:22:42,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820703236] [2019-11-20 08:22:42,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 08:22:42,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:42,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 08:22:42,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 08:22:42,899 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 7 states. [2019-11-20 08:22:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:43,296 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-11-20 08:22:43,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:22:43,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-20 08:22:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:43,298 INFO L225 Difference]: With dead ends: 69 [2019-11-20 08:22:43,298 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 08:22:43,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:22:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 08:22:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-20 08:22:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 08:22:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2019-11-20 08:22:43,304 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 13 [2019-11-20 08:22:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:43,304 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2019-11-20 08:22:43,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 08:22:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2019-11-20 08:22:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 08:22:43,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:43,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:22:43,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:43,514 INFO L410 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:43,514 INFO L82 PathProgramCache]: Analyzing trace with hash 286223756, now seen corresponding path program 1 times [2019-11-20 08:22:43,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:43,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1249116129] [2019-11-20 08:22:43,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:43,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 08:22:43,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:43,701 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:43,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 08:22:43,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:43,737 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-20 08:22:43,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:43,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-11-20 08:22:43,750 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-20 08:22:43,750 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:43,846 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-20 08:22:43,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1249116129] [2019-11-20 08:22:43,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:22:43,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 08:22:43,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502588777] [2019-11-20 08:22:43,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 08:22:43,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:43,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 08:22:43,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:22:43,848 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 6 states. [2019-11-20 08:22:44,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:44,109 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2019-11-20 08:22:44,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:22:44,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-20 08:22:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:44,110 INFO L225 Difference]: With dead ends: 66 [2019-11-20 08:22:44,110 INFO L226 Difference]: Without dead ends: 66 [2019-11-20 08:22:44,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 08:22:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-20 08:22:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2019-11-20 08:22:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-20 08:22:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-11-20 08:22:44,116 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 14 [2019-11-20 08:22:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:44,116 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-11-20 08:22:44,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 08:22:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-11-20 08:22:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 08:22:44,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:44,118 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:22:44,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:44,318 INFO L410 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:44,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:44,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1011627202, now seen corresponding path program 1 times [2019-11-20 08:22:44,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:44,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [925613039] [2019-11-20 08:22:44,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:44,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 08:22:44,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:44,481 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_63|]} [2019-11-20 08:22:44,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:22:44,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 08:22:44,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:44,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:44,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 08:22:44,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:44,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:44,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:44,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-11-20 08:22:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:22:44,664 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:45,166 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 08:22:45,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:22:45,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:45,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:45,172 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-20 08:22:45,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:45,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-11-20 08:22:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:22:45,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [925613039] [2019-11-20 08:22:45,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:22:45,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-20 08:22:45,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458564279] [2019-11-20 08:22:45,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 08:22:45,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:45,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 08:22:45,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:22:45,178 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 10 states. [2019-11-20 08:22:46,203 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-20 08:22:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:46,701 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2019-11-20 08:22:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 08:22:46,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-20 08:22:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:46,703 INFO L225 Difference]: With dead ends: 123 [2019-11-20 08:22:46,703 INFO L226 Difference]: Without dead ends: 123 [2019-11-20 08:22:46,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-11-20 08:22:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-20 08:22:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 75. [2019-11-20 08:22:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 08:22:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2019-11-20 08:22:46,710 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 15 [2019-11-20 08:22:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:46,711 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2019-11-20 08:22:46,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 08:22:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2019-11-20 08:22:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 08:22:46,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:46,712 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-20 08:22:46,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:46,915 INFO L410 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:46,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash -111311105, now seen corresponding path program 1 times [2019-11-20 08:22:46,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:46,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [400667756] [2019-11-20 08:22:46,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:47,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 08:22:47,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:47,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-20 08:22:47,136 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:47,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-20 08:22:47,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:47,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:47,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:47,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2019-11-20 08:22:47,167 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-20 08:22:47,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [400667756] [2019-11-20 08:22:47,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:22:47,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 08:22:47,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337183515] [2019-11-20 08:22:47,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 08:22:47,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:47,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 08:22:47,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:22:47,168 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 6 states. [2019-11-20 08:22:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:47,365 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2019-11-20 08:22:47,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:22:47,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-20 08:22:47,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:47,374 INFO L225 Difference]: With dead ends: 74 [2019-11-20 08:22:47,374 INFO L226 Difference]: Without dead ends: 74 [2019-11-20 08:22:47,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 08:22:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-20 08:22:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-20 08:22:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 08:22:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2019-11-20 08:22:47,380 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 18 [2019-11-20 08:22:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:47,380 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2019-11-20 08:22:47,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 08:22:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2019-11-20 08:22:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 08:22:47,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:47,382 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-20 08:22:47,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:47,585 INFO L410 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:47,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash -111311104, now seen corresponding path program 1 times [2019-11-20 08:22:47,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:47,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1396723535] [2019-11-20 08:22:47,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:47,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 08:22:47,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:22:47,866 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:48,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:22:48,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-20 08:22:48,220 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-20 08:22:48,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 08:22:48,235 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-20 08:22:48,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 08:22:48,250 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:22:48,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:48,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-20 08:22:48,299 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:43, output treesize:35 [2019-11-20 08:22:48,533 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-20 08:22:48,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1396723535] [2019-11-20 08:22:48,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:22:48,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-20 08:22:48,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952048662] [2019-11-20 08:22:48,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 08:22:48,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:48,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 08:22:48,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-11-20 08:22:48,535 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 14 states. [2019-11-20 08:22:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:49,276 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2019-11-20 08:22:49,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 08:22:49,277 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-11-20 08:22:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:49,278 INFO L225 Difference]: With dead ends: 93 [2019-11-20 08:22:49,278 INFO L226 Difference]: Without dead ends: 93 [2019-11-20 08:22:49,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-20 08:22:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-20 08:22:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2019-11-20 08:22:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-20 08:22:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2019-11-20 08:22:49,283 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 18 [2019-11-20 08:22:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:49,284 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2019-11-20 08:22:49,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 08:22:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2019-11-20 08:22:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 08:22:49,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:49,285 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:22:49,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:49,488 INFO L410 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:49,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:49,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1037476778, now seen corresponding path program 1 times [2019-11-20 08:22:49,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:49,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1233656602] [2019-11-20 08:22:49,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:49,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 08:22:49,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:49,694 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:49,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 08:22:49,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:49,728 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 08:22:49,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:49,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 08:22:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:22:49,841 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:22:50,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1233656602] [2019-11-20 08:22:50,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:22:50,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-20 08:22:50,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848970992] [2019-11-20 08:22:50,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 08:22:50,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:50,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 08:22:50,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-20 08:22:50,501 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 12 states. [2019-11-20 08:22:51,455 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2019-11-20 08:22:51,671 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-11-20 08:22:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:52,068 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2019-11-20 08:22:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 08:22:52,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-11-20 08:22:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:52,070 INFO L225 Difference]: With dead ends: 93 [2019-11-20 08:22:52,070 INFO L226 Difference]: Without dead ends: 93 [2019-11-20 08:22:52,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2019-11-20 08:22:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-20 08:22:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2019-11-20 08:22:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-20 08:22:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2019-11-20 08:22:52,076 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 17 [2019-11-20 08:22:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:52,076 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2019-11-20 08:22:52,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 08:22:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2019-11-20 08:22:52,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:22:52,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:52,078 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] [2019-11-20 08:22:52,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:52,278 INFO L410 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:52,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:52,279 INFO L82 PathProgramCache]: Analyzing trace with hash -354327757, now seen corresponding path program 1 times [2019-11-20 08:22:52,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:52,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [75398703] [2019-11-20 08:22:52,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:52,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 08:22:52,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:52,507 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 08:22:52,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 08:22:52,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:52,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:52,513 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-20 08:22:52,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 08:22:52,568 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-20 08:22:52,568 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:52,615 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-20 08:22:52,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [75398703] [2019-11-20 08:22:52,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:22:52,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 7 [2019-11-20 08:22:52,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091536917] [2019-11-20 08:22:52,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 08:22:52,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:52,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 08:22:52,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-20 08:22:52,618 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand 8 states. [2019-11-20 08:22:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:52,877 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2019-11-20 08:22:52,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 08:22:52,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-20 08:22:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:52,879 INFO L225 Difference]: With dead ends: 73 [2019-11-20 08:22:52,879 INFO L226 Difference]: Without dead ends: 73 [2019-11-20 08:22:52,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:22:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-20 08:22:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-11-20 08:22:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-20 08:22:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2019-11-20 08:22:52,883 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 21 [2019-11-20 08:22:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:52,884 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2019-11-20 08:22:52,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 08:22:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2019-11-20 08:22:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:22:52,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:52,885 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] [2019-11-20 08:22:53,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:53,089 INFO L410 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:53,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:53,089 INFO L82 PathProgramCache]: Analyzing trace with hash -354327756, now seen corresponding path program 1 times [2019-11-20 08:22:53,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:53,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [800515624] [2019-11-20 08:22:53,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:22:53,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 08:22:53,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:53,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:53,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 08:22:53,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:53,346 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-20 08:22:53,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:53,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-20 08:22:53,432 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-20 08:22:53,432 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:53,822 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-20 08:22:53,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [800515624] [2019-11-20 08:22:53,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:22:53,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-20 08:22:53,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220384939] [2019-11-20 08:22:53,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 08:22:53,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:53,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 08:22:53,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-20 08:22:53,824 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 14 states. [2019-11-20 08:22:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:22:55,075 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2019-11-20 08:22:55,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 08:22:55,076 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-20 08:22:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:22:55,077 INFO L225 Difference]: With dead ends: 100 [2019-11-20 08:22:55,077 INFO L226 Difference]: Without dead ends: 100 [2019-11-20 08:22:55,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2019-11-20 08:22:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-20 08:22:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 74. [2019-11-20 08:22:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 08:22:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2019-11-20 08:22:55,082 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 21 [2019-11-20 08:22:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:22:55,082 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2019-11-20 08:22:55,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 08:22:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2019-11-20 08:22:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 08:22:55,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:22:55,083 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:22:55,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:22:55,288 INFO L410 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:22:55,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:22:55,288 INFO L82 PathProgramCache]: Analyzing trace with hash 484387272, now seen corresponding path program 2 times [2019-11-20 08:22:55,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:22:55,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1449788248] [2019-11-20 08:22:55,289 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:22:55,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 08:22:55,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 08:22:55,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 08:22:55,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:22:55,534 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_88|]} [2019-11-20 08:22:55,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:22:55,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 08:22:55,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:55,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:55,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 08:22:55,569 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:55,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:55,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:55,589 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-11-20 08:22:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:22:55,727 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:22:56,638 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 08:22:56,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 08:22:56,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:56,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:56,661 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:22:56,662 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:22:56,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:22:56,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:22:56,679 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:27, output treesize:10 [2019-11-20 08:22:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:22:56,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1449788248] [2019-11-20 08:22:56,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:22:56,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-11-20 08:22:56,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441662518] [2019-11-20 08:22:56,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 08:22:56,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:22:56,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 08:22:56,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-20 08:22:56,771 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand 15 states. [2019-11-20 08:22:58,725 WARN L191 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-20 08:23:01,694 WARN L191 SmtUtils]: Spent 581.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 08:23:02,374 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-20 08:23:04,699 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 08:23:05,069 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-11-20 08:23:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:23:05,964 INFO L93 Difference]: Finished difference Result 205 states and 236 transitions. [2019-11-20 08:23:05,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 08:23:05,965 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-11-20 08:23:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:23:05,967 INFO L225 Difference]: With dead ends: 205 [2019-11-20 08:23:05,967 INFO L226 Difference]: Without dead ends: 205 [2019-11-20 08:23:05,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-11-20 08:23:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-20 08:23:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 114. [2019-11-20 08:23:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 08:23:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2019-11-20 08:23:05,973 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 23 [2019-11-20 08:23:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:23:05,973 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2019-11-20 08:23:05,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 08:23:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2019-11-20 08:23:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 08:23:05,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:23:05,975 INFO L410 BasicCegarLoop]: trace histogram [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-20 08:23:06,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:23:06,178 INFO L410 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:23:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:23:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash 63675694, now seen corresponding path program 1 times [2019-11-20 08:23:06,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:23:06,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1519830430] [2019-11-20 08:23:06,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:23:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:06,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 08:23:06,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:23:06,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-20 08:23:06,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:06,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:06,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:06,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-20 08:23:06,491 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-20 08:23:06,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:06,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:06,493 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-20 08:23:06,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 08:23:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:06,517 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:23:06,622 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 15 [2019-11-20 08:23:06,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-11-20 08:23:06,626 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:06,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:06,627 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:06,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:06,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:06,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:6 [2019-11-20 08:23:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:06,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1519830430] [2019-11-20 08:23:06,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:23:06,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 16 [2019-11-20 08:23:06,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290058898] [2019-11-20 08:23:06,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 08:23:06,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:23:06,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 08:23:06,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-20 08:23:06,644 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand 16 states. [2019-11-20 08:23:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:23:07,278 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2019-11-20 08:23:07,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 08:23:07,278 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-20 08:23:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:23:07,279 INFO L225 Difference]: With dead ends: 143 [2019-11-20 08:23:07,280 INFO L226 Difference]: Without dead ends: 143 [2019-11-20 08:23:07,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2019-11-20 08:23:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-20 08:23:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 130. [2019-11-20 08:23:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-20 08:23:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 156 transitions. [2019-11-20 08:23:07,285 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 156 transitions. Word has length 26 [2019-11-20 08:23:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:23:07,285 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 156 transitions. [2019-11-20 08:23:07,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 08:23:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 156 transitions. [2019-11-20 08:23:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 08:23:07,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:23:07,286 INFO L410 BasicCegarLoop]: trace histogram [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-20 08:23:07,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:23:07,494 INFO L410 AbstractCegarLoop]: === Iteration 17 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:23:07,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:23:07,494 INFO L82 PathProgramCache]: Analyzing trace with hash 63673516, now seen corresponding path program 1 times [2019-11-20 08:23:07,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:23:07,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [855541162] [2019-11-20 08:23:07,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:23:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:07,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 08:23:07,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:23:07,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 08:23:07,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:07,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:07,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:07,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 08:23:07,720 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 12 treesize of output 8 [2019-11-20 08:23:07,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:07,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:07,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:07,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-20 08:23:07,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 23 [2019-11-20 08:23:07,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:07,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:07,763 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-20 08:23:07,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:27 [2019-11-20 08:23:07,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2019-11-20 08:23:07,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:07,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:07,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:07,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2019-11-20 08:23:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:08,087 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:23:08,338 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 15 [2019-11-20 08:23:08,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-11-20 08:23:08,341 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:08,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:08,343 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:08,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:08,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:08,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:6 [2019-11-20 08:23:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:08,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [855541162] [2019-11-20 08:23:08,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:23:08,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 16 [2019-11-20 08:23:08,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518943803] [2019-11-20 08:23:08,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 08:23:08,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:23:08,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 08:23:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-20 08:23:08,369 INFO L87 Difference]: Start difference. First operand 130 states and 156 transitions. Second operand 16 states. [2019-11-20 08:23:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:23:09,370 INFO L93 Difference]: Finished difference Result 173 states and 200 transitions. [2019-11-20 08:23:09,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 08:23:09,371 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-20 08:23:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:23:09,373 INFO L225 Difference]: With dead ends: 173 [2019-11-20 08:23:09,374 INFO L226 Difference]: Without dead ends: 172 [2019-11-20 08:23:09,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2019-11-20 08:23:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-20 08:23:09,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2019-11-20 08:23:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-20 08:23:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 195 transitions. [2019-11-20 08:23:09,380 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 195 transitions. Word has length 26 [2019-11-20 08:23:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:23:09,380 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 195 transitions. [2019-11-20 08:23:09,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 08:23:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 195 transitions. [2019-11-20 08:23:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 08:23:09,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:23:09,381 INFO L410 BasicCegarLoop]: trace histogram [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-20 08:23:09,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:23:09,585 INFO L410 AbstractCegarLoop]: === Iteration 18 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:23:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:23:09,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1625268048, now seen corresponding path program 1 times [2019-11-20 08:23:09,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:23:09,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [482532495] [2019-11-20 08:23:09,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:23:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:09,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 08:23:09,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:23:09,784 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:09,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 08:23:09,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:09,816 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 08:23:09,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:09,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 08:23:09,842 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 17 treesize of output 13 [2019-11-20 08:23:09,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:09,892 INFO L567 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2019-11-20 08:23:09,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:09,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2019-11-20 08:23:10,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:10,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-20 08:23:10,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:10,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:10,094 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-20 08:23:10,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:10,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:10,122 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-20 08:23:10,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:29 [2019-11-20 08:23:10,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:10,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:10,455 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-11-20 08:23:10,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:10,734 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:23:11,879 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 38 treesize of output 36 [2019-11-20 08:23:11,895 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:23:11,905 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:23:11,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-20 08:23:11,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:11,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:11,938 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:11,957 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 40 treesize of output 38 [2019-11-20 08:23:11,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-20 08:23:11,988 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-20 08:23:12,070 INFO L567 ElimStorePlain]: treesize reduction 7, result has 81.1 percent of original size [2019-11-20 08:23:12,070 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:12,084 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 40 treesize of output 38 [2019-11-20 08:23:12,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-20 08:23:12,111 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-20 08:23:12,209 INFO L567 ElimStorePlain]: treesize reduction 7, result has 81.1 percent of original size [2019-11-20 08:23:12,209 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:12,331 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-20 08:23:12,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:12,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 08:23:12,332 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:119, output treesize:83 [2019-11-20 08:23:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:12,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [482532495] [2019-11-20 08:23:12,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:23:12,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-11-20 08:23:12,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655059676] [2019-11-20 08:23:12,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 08:23:12,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:23:12,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 08:23:12,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-11-20 08:23:12,682 INFO L87 Difference]: Start difference. First operand 166 states and 195 transitions. Second operand 23 states. [2019-11-20 08:23:13,037 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-20 08:23:14,331 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-11-20 08:23:14,642 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-20 08:23:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:23:20,703 INFO L93 Difference]: Finished difference Result 190 states and 224 transitions. [2019-11-20 08:23:20,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 08:23:20,704 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-11-20 08:23:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:23:20,705 INFO L225 Difference]: With dead ends: 190 [2019-11-20 08:23:20,706 INFO L226 Difference]: Without dead ends: 190 [2019-11-20 08:23:20,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 08:23:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-20 08:23:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2019-11-20 08:23:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-20 08:23:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 208 transitions. [2019-11-20 08:23:20,713 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 208 transitions. Word has length 26 [2019-11-20 08:23:20,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:23:20,713 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 208 transitions. [2019-11-20 08:23:20,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 08:23:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 208 transitions. [2019-11-20 08:23:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 08:23:20,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:23:20,714 INFO L410 BasicCegarLoop]: trace histogram [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-20 08:23:20,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:23:20,917 INFO L410 AbstractCegarLoop]: === Iteration 19 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:23:20,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:23:20,918 INFO L82 PathProgramCache]: Analyzing trace with hash -753974934, now seen corresponding path program 1 times [2019-11-20 08:23:20,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:23:20,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1818419484] [2019-11-20 08:23:20,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:23:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:21,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 08:23:21,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:23:21,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 08:23:21,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:21,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:21,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:21,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-20 08:23:21,170 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 15 treesize of output 11 [2019-11-20 08:23:21,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:21,227 INFO L567 ElimStorePlain]: treesize reduction 6, result has 86.4 percent of original size [2019-11-20 08:23:21,228 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-20 08:23:21,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-11-20 08:23:21,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 23 [2019-11-20 08:23:21,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:21,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:21,292 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-20 08:23:21,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-11-20 08:23:21,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:21,528 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2019-11-20 08:23:21,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:21,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:21,530 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-20 08:23:21,572 INFO L567 ElimStorePlain]: treesize reduction 5, result has 87.2 percent of original size [2019-11-20 08:23:21,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:21,573 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-20 08:23:21,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:30 [2019-11-20 08:23:21,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:21,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:21,994 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-11-20 08:23:22,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:22,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:23,615 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:23:25,285 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 08:23:26,256 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-20 08:23:26,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:23:26,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2019-11-20 08:23:26,295 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-20 08:23:26,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2019-11-20 08:23:26,314 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-20 08:23:26,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2019-11-20 08:23:26,336 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:23:26,876 WARN L191 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-11-20 08:23:26,876 INFO L567 ElimStorePlain]: treesize reduction 6, result has 97.4 percent of original size [2019-11-20 08:23:26,921 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 120 treesize of output 116 [2019-11-20 08:23:26,922 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-20 08:23:26,964 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 124 treesize of output 120 [2019-11-20 08:23:26,965 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-20 08:23:27,044 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 124 treesize of output 120 [2019-11-20 08:23:27,045 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-20 08:23:28,074 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-11-20 08:23:28,074 INFO L567 ElimStorePlain]: treesize reduction 201, result has 43.7 percent of original size [2019-11-20 08:23:28,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-20 08:23:28,081 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:245, output treesize:120 [2019-11-20 08:23:28,729 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-11-20 08:23:29,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:30,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1818419484] [2019-11-20 08:23:30,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:23:30,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-20 08:23:30,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475201563] [2019-11-20 08:23:30,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 08:23:30,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:23:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 08:23:30,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-20 08:23:30,120 INFO L87 Difference]: Start difference. First operand 176 states and 208 transitions. Second operand 27 states. [2019-11-20 08:23:30,574 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 08:23:32,020 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-20 08:23:32,937 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-20 08:23:33,664 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-20 08:23:34,419 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-20 08:23:34,878 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-20 08:23:35,843 WARN L191 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-20 08:23:36,555 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 08:23:37,233 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-20 08:23:37,759 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-20 08:23:38,930 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 08:23:39,715 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 08:23:40,447 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 08:23:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:23:40,906 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2019-11-20 08:23:40,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-20 08:23:40,908 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-11-20 08:23:40,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:23:40,910 INFO L225 Difference]: With dead ends: 210 [2019-11-20 08:23:40,910 INFO L226 Difference]: Without dead ends: 210 [2019-11-20 08:23:40,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=279, Invalid=1977, Unknown=0, NotChecked=0, Total=2256 [2019-11-20 08:23:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-20 08:23:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 199. [2019-11-20 08:23:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-20 08:23:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2019-11-20 08:23:40,916 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 26 [2019-11-20 08:23:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:23:40,917 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2019-11-20 08:23:40,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 08:23:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2019-11-20 08:23:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 08:23:40,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:23:40,918 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, 1, 1] [2019-11-20 08:23:41,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:23:41,121 INFO L410 AbstractCegarLoop]: === Iteration 20 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:23:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:23:41,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1973259744, now seen corresponding path program 1 times [2019-11-20 08:23:41,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:23:41,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [797780691] [2019-11-20 08:23:41,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/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-20 08:23:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:41,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 08:23:41,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:23:41,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-20 08:23:41,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:41,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:23:41,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:23:41,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 08:23:41,404 INFO L343 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2019-11-20 08:23:41,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 49 [2019-11-20 08:23:41,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:23:41,424 INFO L567 ElimStorePlain]: treesize reduction 4, result has 85.7 percent of original size [2019-11-20 08:23:41,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:41,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:23:41,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-11-20 08:23:41,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:41,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:41,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:41,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:41,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:41,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:41,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:41,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:41,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:41,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:41,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:23:43,700 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-20 08:23:43,700 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:23:47,762 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-20 08:23:47,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [797780691] [2019-11-20 08:23:47,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:23:47,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-11-20 08:23:47,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969960491] [2019-11-20 08:23:47,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 08:23:47,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:23:47,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 08:23:47,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=60, Unknown=3, NotChecked=0, Total=90 [2019-11-20 08:23:47,763 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand 10 states. [2019-11-20 08:24:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:24:02,019 INFO L93 Difference]: Finished difference Result 198 states and 236 transitions. [2019-11-20 08:24:02,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:24:02,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-20 08:24:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:24:02,021 INFO L225 Difference]: With dead ends: 198 [2019-11-20 08:24:02,021 INFO L226 Difference]: Without dead ends: 173 [2019-11-20 08:24:02,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=40, Invalid=89, Unknown=3, NotChecked=0, Total=132 [2019-11-20 08:24:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-20 08:24:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-11-20 08:24:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-20 08:24:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2019-11-20 08:24:02,026 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 27 [2019-11-20 08:24:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:24:02,026 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2019-11-20 08:24:02,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 08:24:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2019-11-20 08:24:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 08:24:02,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:24:02,027 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:24:02,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:02,227 INFO L410 AbstractCegarLoop]: === Iteration 21 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:24:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:24:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash -738480846, now seen corresponding path program 2 times [2019-11-20 08:24:02,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:24:02,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [268113939] [2019-11-20 08:24:02,228 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:02,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 08:24:02,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 08:24:02,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 08:24:02,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:24:02,454 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:02,454 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 08:24:02,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:02,484 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 08:24:02,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:02,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 08:24:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:02,750 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:24:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:03,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [268113939] [2019-11-20 08:24:03,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:24:03,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-11-20 08:24:03,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381126099] [2019-11-20 08:24:03,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 08:24:03,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:24:03,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 08:24:03,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-11-20 08:24:03,969 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand 21 states. [2019-11-20 08:24:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:24:05,709 INFO L93 Difference]: Finished difference Result 222 states and 253 transitions. [2019-11-20 08:24:05,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 08:24:05,710 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-11-20 08:24:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:24:05,711 INFO L225 Difference]: With dead ends: 222 [2019-11-20 08:24:05,711 INFO L226 Difference]: Without dead ends: 204 [2019-11-20 08:24:05,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2019-11-20 08:24:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-20 08:24:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 175. [2019-11-20 08:24:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-20 08:24:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 206 transitions. [2019-11-20 08:24:05,716 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 206 transitions. Word has length 31 [2019-11-20 08:24:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:24:05,716 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 206 transitions. [2019-11-20 08:24:05,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 08:24:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 206 transitions. [2019-11-20 08:24:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 08:24:05,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:24:05,717 INFO L410 BasicCegarLoop]: trace histogram [3, 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-20 08:24:05,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:05,921 INFO L410 AbstractCegarLoop]: === Iteration 22 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:24:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:24:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1183234794, now seen corresponding path program 2 times [2019-11-20 08:24:05,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:24:05,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1008126738] [2019-11-20 08:24:05,921 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:06,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 08:24:06,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 08:24:06,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-20 08:24:06,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:24:06,157 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_48|], 1=[|v_#valid_125|]} [2019-11-20 08:24:06,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:24:06,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 08:24:06,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:06,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:06,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 08:24:06,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:06,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:06,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:06,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-11-20 08:24:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:06,442 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:24:07,512 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 08:24:07,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:24:07,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:07,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:07,519 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-20 08:24:07,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:07,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:1 [2019-11-20 08:24:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:07,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1008126738] [2019-11-20 08:24:07,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:24:07,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2019-11-20 08:24:07,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132897242] [2019-11-20 08:24:07,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 08:24:07,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:24:07,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 08:24:07,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-11-20 08:24:07,529 INFO L87 Difference]: Start difference. First operand 175 states and 206 transitions. Second operand 19 states. [2019-11-20 08:24:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:24:08,708 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2019-11-20 08:24:08,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 08:24:08,711 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-11-20 08:24:08,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:24:08,713 INFO L225 Difference]: With dead ends: 219 [2019-11-20 08:24:08,713 INFO L226 Difference]: Without dead ends: 201 [2019-11-20 08:24:08,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-11-20 08:24:08,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-20 08:24:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 175. [2019-11-20 08:24:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-20 08:24:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 205 transitions. [2019-11-20 08:24:08,718 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 205 transitions. Word has length 34 [2019-11-20 08:24:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:24:08,718 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 205 transitions. [2019-11-20 08:24:08,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 08:24:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 205 transitions. [2019-11-20 08:24:08,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 08:24:08,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:24:08,719 INFO L410 BasicCegarLoop]: trace histogram [3, 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-20 08:24:08,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:08,920 INFO L410 AbstractCegarLoop]: === Iteration 23 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:24:08,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:24:08,920 INFO L82 PathProgramCache]: Analyzing trace with hash 529220533, now seen corresponding path program 1 times [2019-11-20 08:24:08,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:24:08,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [411086951] [2019-11-20 08:24:08,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:09,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 08:24:09,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:24:09,237 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 11 [2019-11-20 08:24:09,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:09,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:09,260 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-20 08:24:09,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-11-20 08:24:09,480 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:24:09,482 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:09,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 12 [2019-11-20 08:24:09,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:09,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:09,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:09,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:5 [2019-11-20 08:24:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:09,545 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:24:09,819 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 19 treesize of output 17 [2019-11-20 08:24:09,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2019-11-20 08:24:09,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:09,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:09,825 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:09,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:09,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:09,827 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:8 [2019-11-20 08:24:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:10,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [411086951] [2019-11-20 08:24:10,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:24:10,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2019-11-20 08:24:10,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607298010] [2019-11-20 08:24:10,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 08:24:10,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:24:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 08:24:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2019-11-20 08:24:10,105 INFO L87 Difference]: Start difference. First operand 175 states and 205 transitions. Second operand 26 states. [2019-11-20 08:24:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:24:12,045 INFO L93 Difference]: Finished difference Result 245 states and 278 transitions. [2019-11-20 08:24:12,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 08:24:12,046 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2019-11-20 08:24:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:24:12,047 INFO L225 Difference]: With dead ends: 245 [2019-11-20 08:24:12,047 INFO L226 Difference]: Without dead ends: 228 [2019-11-20 08:24:12,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=212, Invalid=1270, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 08:24:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-20 08:24:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 215. [2019-11-20 08:24:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-20 08:24:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 249 transitions. [2019-11-20 08:24:12,053 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 249 transitions. Word has length 35 [2019-11-20 08:24:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:24:12,054 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 249 transitions. [2019-11-20 08:24:12,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 08:24:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 249 transitions. [2019-11-20 08:24:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:24:12,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:24:12,055 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-20 08:24:12,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:12,258 INFO L410 AbstractCegarLoop]: === Iteration 24 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:24:12,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:24:12,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1078601485, now seen corresponding path program 1 times [2019-11-20 08:24:12,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:24:12,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [301590765] [2019-11-20 08:24:12,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:12,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 08:24:12,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:24:12,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 08:24:12,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:12,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:12,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:12,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-20 08:24:12,770 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 15 treesize of output 11 [2019-11-20 08:24:12,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:12,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:12,786 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-20 08:24:12,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-11-20 08:24:12,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 26 [2019-11-20 08:24:12,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:12,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:12,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 08:24:12,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:41 [2019-11-20 08:24:13,214 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:24:13,215 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2019-11-20 08:24:13,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:13,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:13,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:13,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:5 [2019-11-20 08:24:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:13,438 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:24:13,968 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 19 treesize of output 17 [2019-11-20 08:24:13,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2019-11-20 08:24:13,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:13,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:13,973 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:13,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:13,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:13,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:8 [2019-11-20 08:24:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:14,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [301590765] [2019-11-20 08:24:14,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:24:14,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2019-11-20 08:24:14,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413833429] [2019-11-20 08:24:14,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 08:24:14,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:24:14,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 08:24:14,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2019-11-20 08:24:14,307 INFO L87 Difference]: Start difference. First operand 215 states and 249 transitions. Second operand 25 states. [2019-11-20 08:24:16,129 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-11-20 08:24:16,476 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-20 08:24:16,807 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-11-20 08:24:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:24:17,236 INFO L93 Difference]: Finished difference Result 313 states and 351 transitions. [2019-11-20 08:24:17,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 08:24:17,237 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 38 [2019-11-20 08:24:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:24:17,238 INFO L225 Difference]: With dead ends: 313 [2019-11-20 08:24:17,239 INFO L226 Difference]: Without dead ends: 261 [2019-11-20 08:24:17,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=175, Invalid=1157, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 08:24:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-20 08:24:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 244. [2019-11-20 08:24:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-11-20 08:24:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 281 transitions. [2019-11-20 08:24:17,258 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 281 transitions. Word has length 38 [2019-11-20 08:24:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:24:17,259 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 281 transitions. [2019-11-20 08:24:17,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 08:24:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 281 transitions. [2019-11-20 08:24:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 08:24:17,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:24:17,260 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-20 08:24:17,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:17,469 INFO L410 AbstractCegarLoop]: === Iteration 25 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:24:17,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:24:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1419108536, now seen corresponding path program 2 times [2019-11-20 08:24:17,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:24:17,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2074665688] [2019-11-20 08:24:17,470 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:17,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 08:24:17,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 08:24:17,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 08:24:17,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:24:17,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:17,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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 08:24:17,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:17,792 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 08:24:17,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:17,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 08:24:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:18,364 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:24:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:20,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2074665688] [2019-11-20 08:24:20,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:24:20,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2019-11-20 08:24:20,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641557284] [2019-11-20 08:24:20,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-20 08:24:20,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:24:20,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-20 08:24:20,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2019-11-20 08:24:20,987 INFO L87 Difference]: Start difference. First operand 244 states and 281 transitions. Second operand 31 states. [2019-11-20 08:24:24,295 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 08:24:24,844 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 08:24:25,780 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-20 08:24:26,657 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 08:24:27,366 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 08:24:27,977 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-20 08:24:28,480 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-20 08:24:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:24:29,276 INFO L93 Difference]: Finished difference Result 426 states and 480 transitions. [2019-11-20 08:24:29,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-20 08:24:29,279 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 39 [2019-11-20 08:24:29,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:24:29,281 INFO L225 Difference]: With dead ends: 426 [2019-11-20 08:24:29,281 INFO L226 Difference]: Without dead ends: 426 [2019-11-20 08:24:29,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=348, Invalid=2202, Unknown=0, NotChecked=0, Total=2550 [2019-11-20 08:24:29,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-20 08:24:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 264. [2019-11-20 08:24:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-20 08:24:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 304 transitions. [2019-11-20 08:24:29,297 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 304 transitions. Word has length 39 [2019-11-20 08:24:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:24:29,297 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 304 transitions. [2019-11-20 08:24:29,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-20 08:24:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 304 transitions. [2019-11-20 08:24:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 08:24:29,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:24:29,298 INFO L410 BasicCegarLoop]: trace histogram [3, 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-20 08:24:29,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:29,499 INFO L410 AbstractCegarLoop]: === Iteration 26 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:24:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:24:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1805334096, now seen corresponding path program 2 times [2019-11-20 08:24:29,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:24:29,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [563837770] [2019-11-20 08:24:29,499 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:29,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 08:24:29,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 08:24:29,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 08:24:29,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:24:29,745 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_53|], 1=[|v_#valid_142|]} [2019-11-20 08:24:29,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:24:29,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 08:24:29,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:29,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:29,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 08:24:29,772 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:29,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:29,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:29,787 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-11-20 08:24:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:30,387 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:24:32,773 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 08:24:32,776 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 08:24:32,782 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:24:32,785 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 08:24:32,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:32,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:32,786 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-20 08:24:32,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:32,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:1 [2019-11-20 08:24:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:32,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [563837770] [2019-11-20 08:24:32,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:24:32,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2019-11-20 08:24:32,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995717549] [2019-11-20 08:24:32,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 08:24:32,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:24:32,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 08:24:32,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-11-20 08:24:32,797 INFO L87 Difference]: Start difference. First operand 264 states and 304 transitions. Second operand 29 states. [2019-11-20 08:24:35,633 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 08:24:36,133 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 08:24:37,078 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 08:24:37,449 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 08:24:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:24:38,926 INFO L93 Difference]: Finished difference Result 468 states and 527 transitions. [2019-11-20 08:24:38,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-20 08:24:38,928 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42 [2019-11-20 08:24:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:24:38,931 INFO L225 Difference]: With dead ends: 468 [2019-11-20 08:24:38,931 INFO L226 Difference]: Without dead ends: 468 [2019-11-20 08:24:38,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=279, Invalid=1791, Unknown=0, NotChecked=0, Total=2070 [2019-11-20 08:24:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-20 08:24:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 305. [2019-11-20 08:24:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-20 08:24:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 350 transitions. [2019-11-20 08:24:38,941 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 350 transitions. Word has length 42 [2019-11-20 08:24:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:24:38,942 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 350 transitions. [2019-11-20 08:24:38,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 08:24:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 350 transitions. [2019-11-20 08:24:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 08:24:38,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:24:38,943 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:24:39,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:39,150 INFO L410 AbstractCegarLoop]: === Iteration 27 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 08:24:39,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:24:39,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1180896726, now seen corresponding path program 3 times [2019-11-20 08:24:39,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:24:39,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1657619986] [2019-11-20 08:24:39,151 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_086b5e4e-ed4e-4098-868e-38763433000a/bin/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:24:39,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 08:24:39,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 08:24:39,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-20 08:24:39,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:24:39,550 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 1=[|v_#valid_147|]} [2019-11-20 08:24:39,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:24:39,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 08:24:39,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:39,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:39,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 08:24:39,587 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:39,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:39,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:39,608 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:30 [2019-11-20 08:24:40,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-20 08:24:40,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:40,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:40,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:40,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-11-20 08:24:40,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:24:40,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 24 [2019-11-20 08:24:40,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:24:40,203 INFO L567 ElimStorePlain]: treesize reduction 7, result has 86.8 percent of original size [2019-11-20 08:24:40,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:24:40,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:46 [2019-11-20 08:24:40,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:24:40,860 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:40,860 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2019-11-20 08:24:40,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:24:40,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:24:40,862 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-20 08:24:40,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:24:40,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:24:40,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:24:40,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:55 [2019-11-20 08:24:40,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:24:41,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:24:41,740 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-11-20 08:24:41,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:24:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 08:24:42,531 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:24:43,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:24:44,154 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-11-20 08:25:00,005 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 08:25:00,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:25:00,040 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2019-11-20 08:25:00,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:25:00,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-11-20 08:25:00,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:25:00,146 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_61], 1=[v_arrayElimCell_60]} [2019-11-20 08:25:00,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:25:00,367 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) 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-20 08:25:00,370 INFO L168 Benchmark]: Toolchain (without parser) took 144288.70 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.0 MB). Free memory was 943.4 MB in the beginning and 791.2 MB in the end (delta: 152.2 MB). Peak memory consumption was 498.2 MB. Max. memory is 11.5 GB. [2019-11-20 08:25:00,370 INFO L168 Benchmark]: CDTParser took 10.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:25:00,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-20 08:25:00,370 INFO L168 Benchmark]: Boogie Preprocessor took 65.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:25:00,371 INFO L168 Benchmark]: RCFGBuilder took 693.64 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: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:25:00,371 INFO L168 Benchmark]: TraceAbstraction took 142910.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 217.1 MB). Free memory was 1.0 GB in the beginning and 791.2 MB in the end (delta: 257.1 MB). Peak memory consumption was 474.2 MB. Max. memory is 11.5 GB. [2019-11-20 08:25:00,372 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 10.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 615.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 693.64 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: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 142910.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 217.1 MB). Free memory was 1.0 GB in the beginning and 791.2 MB in the end (delta: 257.1 MB). Peak memory consumption was 474.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...