./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.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_909250d0-5509-4644-afb2-c10aebc3e7b5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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 7546d6e17020b89cf8d45870128d84e73c6cd245 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:36:56,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:36:56,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:36:56,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:36:56,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:36:56,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:36:56,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:36:56,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:36:56,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:36:56,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:36:56,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:36:56,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:36:56,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:36:56,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:36:56,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:36:56,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:36:56,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:36:56,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:36:56,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:36:56,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:36:56,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:36:56,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:36:56,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:36:56,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:36:56,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:36:56,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:36:56,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:36:56,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:36:56,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:36:56,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:36:56,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:36:56,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:36:56,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:36:56,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:36:56,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:36:56,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:36:56,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:36:56,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:36:56,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:36:56,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:36:56,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:36:56,243 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 08:36:56,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:36:56,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:36:56,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:36:56,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:36:56,257 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 08:36:56,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:36:56,258 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:36:56,258 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 08:36:56,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 08:36:56,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:36:56,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:36:56,258 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 08:36:56,259 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 08:36:56,259 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 08:36:56,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:36:56,259 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 08:36:56,259 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 08:36:56,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:36:56,260 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:36:56,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:36:56,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 08:36:56,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:36:56,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 08:36:56,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:36:56,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:36:56,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:36:56,261 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 08:36:56,261 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 08:36:56,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 08:36:56,262 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_909250d0-5509-4644-afb2-c10aebc3e7b5/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 -> 7546d6e17020b89cf8d45870128d84e73c6cd245 [2019-11-20 08:36:56,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:36:56,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:36:56,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:36:56,426 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:36:56,427 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:36:56,427 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2019-11-20 08:36:56,485 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/bin/uautomizer/data/9e0919300/05337ea5db824fdfb7d9a927447381a8/FLAG7dd53d504 [2019-11-20 08:36:56,945 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:36:56,945 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2019-11-20 08:36:56,956 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/bin/uautomizer/data/9e0919300/05337ea5db824fdfb7d9a927447381a8/FLAG7dd53d504 [2019-11-20 08:36:57,448 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/bin/uautomizer/data/9e0919300/05337ea5db824fdfb7d9a927447381a8 [2019-11-20 08:36:57,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:36:57,454 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 08:36:57,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:36:57,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:36:57,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:36:57,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:36:57" (1/1) ... [2019-11-20 08:36:57,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e81ecb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:57, skipping insertion in model container [2019-11-20 08:36:57,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:36:57" (1/1) ... [2019-11-20 08:36:57,470 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:36:57,515 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:36:57,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:36:57,880 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:36:57,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:36:57,982 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:36:57,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:57 WrapperNode [2019-11-20 08:36:57,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:36:57,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:36:57,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:36:57,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:36:57,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:57" (1/1) ... [2019-11-20 08:36:57,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:57" (1/1) ... [2019-11-20 08:36:58,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:57" (1/1) ... [2019-11-20 08:36:58,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:57" (1/1) ... [2019-11-20 08:36:58,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:57" (1/1) ... [2019-11-20 08:36:58,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:57" (1/1) ... [2019-11-20 08:36:58,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:57" (1/1) ... [2019-11-20 08:36:58,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:36:58,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:36:58,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:36:58,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:36:58,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:36:58,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 08:36:58,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:36:58,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 08:36:58,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 08:36:58,126 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-20 08:36:58,126 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-20 08:36:58,127 INFO L138 BoogieDeclarations]: Found implementation of procedure _destroy_in_nondeterministic_order [2019-11-20 08:36:58,127 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 08:36:58,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 08:36:58,128 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 08:36:58,128 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 08:36:58,128 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 08:36:58,129 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 08:36:58,129 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 08:36:58,129 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 08:36:58,130 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 08:36:58,130 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 08:36:58,130 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 08:36:58,130 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 08:36:58,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 08:36:58,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 08:36:58,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 08:36:58,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 08:36:58,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 08:36:58,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 08:36:58,132 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 08:36:58,132 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 08:36:58,133 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 08:36:58,133 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 08:36:58,133 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 08:36:58,133 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 08:36:58,133 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 08:36:58,133 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 08:36:58,134 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 08:36:58,134 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 08:36:58,134 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 08:36:58,134 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 08:36:58,134 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 08:36:58,135 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 08:36:58,135 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 08:36:58,135 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 08:36:58,135 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 08:36:58,135 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 08:36:58,135 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 08:36:58,135 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 08:36:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 08:36:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 08:36:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 08:36:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 08:36:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 08:36:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 08:36:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 08:36:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 08:36:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 08:36:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 08:36:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 08:36:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 08:36:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 08:36:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 08:36:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 08:36:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 08:36:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 08:36:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 08:36:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 08:36:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 08:36:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 08:36:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 08:36:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 08:36:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 08:36:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 08:36:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 08:36:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 08:36:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 08:36:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 08:36:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 08:36:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 08:36:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 08:36:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 08:36:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 08:36:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 08:36:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 08:36:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 08:36:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 08:36:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 08:36:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 08:36:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 08:36:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 08:36:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 08:36:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 08:36:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 08:36:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 08:36:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 08:36:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 08:36:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 08:36:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 08:36:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 08:36:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 08:36:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 08:36:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 08:36:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 08:36:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 08:36:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 08:36:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 08:36:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 08:36:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 08:36:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 08:36:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 08:36:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 08:36:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 08:36:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 08:36:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 08:36:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 08:36:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 08:36:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 08:36:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-20 08:36:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-20 08:36:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 08:36:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 08:36:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure _destroy_in_nondeterministic_order [2019-11-20 08:36:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 08:36:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 08:36:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 08:36:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 08:36:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:36:58,903 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-20 08:36:58,939 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:36:58,939 INFO L285 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-20 08:36:58,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:36:58 BoogieIcfgContainer [2019-11-20 08:36:58,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:36:58,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 08:36:58,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 08:36:58,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 08:36:58,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:36:57" (1/3) ... [2019-11-20 08:36:58,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bb4cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:36:58, skipping insertion in model container [2019-11-20 08:36:58,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:36:57" (2/3) ... [2019-11-20 08:36:58,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bb4cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:36:58, skipping insertion in model container [2019-11-20 08:36:58,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:36:58" (3/3) ... [2019-11-20 08:36:58,948 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2019-11-20 08:36:58,958 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 08:36:58,965 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 62 error locations. [2019-11-20 08:36:58,975 INFO L249 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2019-11-20 08:36:58,993 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 08:36:58,993 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 08:36:59,001 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 08:36:59,002 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 08:36:59,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 08:36:59,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 08:36:59,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 08:36:59,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 08:36:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-20 08:36:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 08:36:59,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:36:59,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:36:59,042 INFO L410 AbstractCegarLoop]: === Iteration 1 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:36:59,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:36:59,046 INFO L82 PathProgramCache]: Analyzing trace with hash -23350716, now seen corresponding path program 1 times [2019-11-20 08:36:59,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:36:59,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [60520097] [2019-11-20 08:36:59,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:36:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:36:59,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:36:59,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:36:59,289 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:36:59,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:36:59,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:36:59,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:36:59,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 08:36:59,307 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:36:59,307 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:36:59,316 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:36:59,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [60520097] [2019-11-20 08:36:59,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:36:59,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 08:36:59,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85803222] [2019-11-20 08:36:59,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:36:59,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:36:59,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:36:59,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:36:59,337 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-20 08:36:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:36:59,515 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2019-11-20 08:36:59,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:36:59,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-20 08:36:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:36:59,530 INFO L225 Difference]: With dead ends: 149 [2019-11-20 08:36:59,530 INFO L226 Difference]: Without dead ends: 142 [2019-11-20 08:36:59,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:36:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-20 08:36:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-11-20 08:36:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-20 08:36:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2019-11-20 08:36:59,591 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 10 [2019-11-20 08:36:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:36:59,591 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2019-11-20 08:36:59,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:36:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2019-11-20 08:36:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 08:36:59,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:36:59,592 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:36:59,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:36:59,803 INFO L410 AbstractCegarLoop]: === Iteration 2 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:36:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:36:59,805 INFO L82 PathProgramCache]: Analyzing trace with hash -23350715, now seen corresponding path program 1 times [2019-11-20 08:36:59,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:36:59,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1724519069] [2019-11-20 08:36:59,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:36:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:36:59,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 08:36:59,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:36:59,988 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:36:59,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:00,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:00,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:00,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 08:37:00,013 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:37:00,013 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:00,048 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:37:00,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1724519069] [2019-11-20 08:37:00,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:00,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 08:37:00,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965949630] [2019-11-20 08:37:00,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:37:00,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:00,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:37:00,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:37:00,051 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand 4 states. [2019-11-20 08:37:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:00,168 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-11-20 08:37:00,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:00,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 08:37:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:00,171 INFO L225 Difference]: With dead ends: 139 [2019-11-20 08:37:00,171 INFO L226 Difference]: Without dead ends: 139 [2019-11-20 08:37:00,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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:37:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-20 08:37:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-11-20 08:37:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-20 08:37:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 144 transitions. [2019-11-20 08:37:00,183 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 144 transitions. Word has length 10 [2019-11-20 08:37:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:00,183 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 144 transitions. [2019-11-20 08:37:00,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:37:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 144 transitions. [2019-11-20 08:37:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 08:37:00,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:00,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:00,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:00,387 INFO L410 AbstractCegarLoop]: === Iteration 3 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:00,388 INFO L82 PathProgramCache]: Analyzing trace with hash 589419475, now seen corresponding path program 1 times [2019-11-20 08:37:00,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:00,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [726622324] [2019-11-20 08:37:00,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:00,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 08:37:00,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:00,610 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:37:00,610 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:00,665 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:37:00,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [726622324] [2019-11-20 08:37:00,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:00,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 08:37:00,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924959702] [2019-11-20 08:37:00,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 08:37:00,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:00,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 08:37:00,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 08:37:00,668 INFO L87 Difference]: Start difference. First operand 139 states and 144 transitions. Second operand 8 states. [2019-11-20 08:37:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:00,741 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2019-11-20 08:37:00,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:37:00,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-20 08:37:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:00,744 INFO L225 Difference]: With dead ends: 149 [2019-11-20 08:37:00,744 INFO L226 Difference]: Without dead ends: 149 [2019-11-20 08:37:00,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:37:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-20 08:37:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-11-20 08:37:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-20 08:37:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2019-11-20 08:37:00,754 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 15 [2019-11-20 08:37:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:00,754 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2019-11-20 08:37:00,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 08:37:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2019-11-20 08:37:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 08:37:00,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:00,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:00,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:00,962 INFO L410 AbstractCegarLoop]: === Iteration 4 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:00,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:00,963 INFO L82 PathProgramCache]: Analyzing trace with hash 589421012, now seen corresponding path program 1 times [2019-11-20 08:37:00,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:00,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [354433258] [2019-11-20 08:37:00,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:01,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 08:37:01,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:01,204 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:01,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 08:37:01,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:01,231 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 08:37:01,232 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:37:01,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-20 08:37:01,245 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:37:01,246 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:01,253 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:37:01,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [354433258] [2019-11-20 08:37:01,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:01,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 3 [2019-11-20 08:37:01,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539308547] [2019-11-20 08:37:01,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:37:01,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:01,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:37:01,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:37:01,255 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 4 states. [2019-11-20 08:37:01,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:01,493 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2019-11-20 08:37:01,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:37:01,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 08:37:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:01,496 INFO L225 Difference]: With dead ends: 144 [2019-11-20 08:37:01,496 INFO L226 Difference]: Without dead ends: 144 [2019-11-20 08:37:01,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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:37:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-20 08:37:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-11-20 08:37:01,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-20 08:37:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-11-20 08:37:01,507 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 15 [2019-11-20 08:37:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:01,507 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-11-20 08:37:01,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:37:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-11-20 08:37:01,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 08:37:01,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:01,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:01,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:01,711 INFO L410 AbstractCegarLoop]: === Iteration 5 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:01,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:01,711 INFO L82 PathProgramCache]: Analyzing trace with hash 589421013, now seen corresponding path program 1 times [2019-11-20 08:37:01,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:01,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1971866679] [2019-11-20 08:37:01,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:01,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 08:37:01,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:01,883 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:37:01,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:01,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:01,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:01,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 08:37:01,902 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:37:01,902 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:01,929 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:37:01,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1971866679] [2019-11-20 08:37:01,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:01,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 08:37:01,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396723535] [2019-11-20 08:37:01,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:37:01,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:01,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:37:01,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:37:01,931 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 4 states. [2019-11-20 08:37:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:02,032 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2019-11-20 08:37:02,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:02,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 08:37:02,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:02,034 INFO L225 Difference]: With dead ends: 143 [2019-11-20 08:37:02,034 INFO L226 Difference]: Without dead ends: 143 [2019-11-20 08:37:02,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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:37:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-20 08:37:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-11-20 08:37:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-20 08:37:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2019-11-20 08:37:02,042 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 15 [2019-11-20 08:37:02,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:02,042 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2019-11-20 08:37:02,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:37:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2019-11-20 08:37:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 08:37:02,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:02,043 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:02,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:02,246 INFO L410 AbstractCegarLoop]: === Iteration 6 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:02,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1092182320, now seen corresponding path program 1 times [2019-11-20 08:37:02,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:02,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [869471835] [2019-11-20 08:37:02,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:02,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 08:37:02,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:02,428 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:37:02,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:02,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:02,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:02,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 08:37:02,457 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:02,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-20 08:37:02,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:02,477 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 08:37:02,478 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:37:02,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 08:37:02,485 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:37:02,485 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:02,507 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:37:02,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [869471835] [2019-11-20 08:37:02,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:02,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 08:37:02,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895401242] [2019-11-20 08:37:02,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:37:02,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:02,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:37:02,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:37:02,508 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand 4 states. [2019-11-20 08:37:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:02,744 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2019-11-20 08:37:02,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:37:02,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-20 08:37:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:02,746 INFO L225 Difference]: With dead ends: 144 [2019-11-20 08:37:02,746 INFO L226 Difference]: Without dead ends: 144 [2019-11-20 08:37:02,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:37:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-20 08:37:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-11-20 08:37:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-20 08:37:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2019-11-20 08:37:02,753 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 16 [2019-11-20 08:37:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:02,753 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2019-11-20 08:37:02,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:37:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2019-11-20 08:37:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 08:37:02,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:02,759 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:02,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:02,969 INFO L410 AbstractCegarLoop]: === Iteration 7 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:02,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1092182321, now seen corresponding path program 1 times [2019-11-20 08:37:02,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:02,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [976362814] [2019-11-20 08:37:02,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:03,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 08:37:03,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:03,160 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:37:03,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:03,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:03,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 08:37:03,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:03,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:03,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:03,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 08:37:03,217 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:03,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 08:37:03,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:03,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:03,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 08:37:03,241 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:03,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:03,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:37:03,252 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2019-11-20 08:37:03,280 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:37:03,281 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:03,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:37:03,630 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:37:03,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [976362814] [2019-11-20 08:37:03,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:03,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 08:37:03,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159630499] [2019-11-20 08:37:03,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 08:37:03,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:03,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 08:37:03,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 08:37:03,632 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 8 states. [2019-11-20 08:37:04,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:04,377 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2019-11-20 08:37:04,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:37:04,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-20 08:37:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:04,379 INFO L225 Difference]: With dead ends: 143 [2019-11-20 08:37:04,379 INFO L226 Difference]: Without dead ends: 143 [2019-11-20 08:37:04,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:37:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-20 08:37:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-11-20 08:37:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-20 08:37:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2019-11-20 08:37:04,385 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 16 [2019-11-20 08:37:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:04,385 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2019-11-20 08:37:04,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 08:37:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2019-11-20 08:37:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:37:04,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:04,386 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:04,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:04,589 INFO L410 AbstractCegarLoop]: === Iteration 8 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1714106272, now seen corresponding path program 1 times [2019-11-20 08:37:04,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:04,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1866208159] [2019-11-20 08:37:04,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:04,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 08:37:04,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:04,802 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:04,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 08:37:04,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:04,826 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 08:37:04,827 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:37:04,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-20 08:37:04,874 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:04,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-20 08:37:04,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:04,890 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 08:37:04,891 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:37:04,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 08:37:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:04,907 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:04,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1866208159] [2019-11-20 08:37:04,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:37:04,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-11-20 08:37:04,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581078422] [2019-11-20 08:37:04,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:37:04,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:04,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:37:04,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:37:04,941 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand 5 states. [2019-11-20 08:37:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:05,092 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2019-11-20 08:37:05,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:37:05,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-20 08:37:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:05,093 INFO L225 Difference]: With dead ends: 141 [2019-11-20 08:37:05,093 INFO L226 Difference]: Without dead ends: 141 [2019-11-20 08:37:05,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:37:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-20 08:37:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-11-20 08:37:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 08:37:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2019-11-20 08:37:05,099 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 21 [2019-11-20 08:37:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:05,099 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2019-11-20 08:37:05,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:37:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2019-11-20 08:37:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:37:05,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:05,100 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:05,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:05,303 INFO L410 AbstractCegarLoop]: === Iteration 9 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:05,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:05,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1714106273, now seen corresponding path program 1 times [2019-11-20 08:37:05,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:05,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [46580417] [2019-11-20 08:37:05,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:05,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 08:37:05,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:05,508 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:37:05,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:05,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:05,517 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:37:05,518 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:05,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:05,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:05,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 08:37:05,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:37:05,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 08:37:05,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:05,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:05,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:05,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 08:37:05,584 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:05,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:05,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:37:05,598 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-11-20 08:37:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:05,618 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:05,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:37:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:05,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [46580417] [2019-11-20 08:37:05,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:37:05,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-20 08:37:05,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553708294] [2019-11-20 08:37:05,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 08:37:05,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:05,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 08:37:05,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 08:37:05,914 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 8 states. [2019-11-20 08:37:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:06,532 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-11-20 08:37:06,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:37:06,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-20 08:37:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:06,533 INFO L225 Difference]: With dead ends: 139 [2019-11-20 08:37:06,533 INFO L226 Difference]: Without dead ends: 139 [2019-11-20 08:37:06,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:37:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-20 08:37:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-11-20 08:37:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-20 08:37:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 144 transitions. [2019-11-20 08:37:06,538 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 144 transitions. Word has length 21 [2019-11-20 08:37:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:06,539 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 144 transitions. [2019-11-20 08:37:06,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 08:37:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 144 transitions. [2019-11-20 08:37:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 08:37:06,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:06,540 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:06,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:06,743 INFO L410 AbstractCegarLoop]: === Iteration 10 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:06,743 INFO L82 PathProgramCache]: Analyzing trace with hash 964765578, now seen corresponding path program 1 times [2019-11-20 08:37:06,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:06,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1889087999] [2019-11-20 08:37:06,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:06,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 08:37:06,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:06,934 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:37:06,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:06,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:06,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:06,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 08:37:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 08:37:06,984 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 08:37:07,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1889087999] [2019-11-20 08:37:07,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:07,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-11-20 08:37:07,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362191028] [2019-11-20 08:37:07,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 08:37:07,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:07,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 08:37:07,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:37:07,053 INFO L87 Difference]: Start difference. First operand 139 states and 144 transitions. Second operand 9 states. [2019-11-20 08:37:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:07,520 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2019-11-20 08:37:07,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 08:37:07,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-11-20 08:37:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:07,522 INFO L225 Difference]: With dead ends: 136 [2019-11-20 08:37:07,522 INFO L226 Difference]: Without dead ends: 136 [2019-11-20 08:37:07,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-20 08:37:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-20 08:37:07,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-11-20 08:37:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-20 08:37:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2019-11-20 08:37:07,526 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 32 [2019-11-20 08:37:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:07,527 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2019-11-20 08:37:07,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 08:37:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2019-11-20 08:37:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 08:37:07,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:07,528 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:07,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:07,729 INFO L410 AbstractCegarLoop]: === Iteration 11 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:07,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash 964765579, now seen corresponding path program 1 times [2019-11-20 08:37:07,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:07,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [181820395] [2019-11-20 08:37:07,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:07,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 08:37:07,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:07,947 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:37:07,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:07,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:07,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:07,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 08:37:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 08:37:08,057 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 08:37:08,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [181820395] [2019-11-20 08:37:08,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:08,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 08:37:08,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880900235] [2019-11-20 08:37:08,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 08:37:08,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:08,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 08:37:08,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-20 08:37:08,696 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 16 states. [2019-11-20 08:37:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:09,867 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-11-20 08:37:09,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 08:37:09,867 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-11-20 08:37:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:09,869 INFO L225 Difference]: With dead ends: 129 [2019-11-20 08:37:09,869 INFO L226 Difference]: Without dead ends: 129 [2019-11-20 08:37:09,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-11-20 08:37:09,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-20 08:37:09,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-11-20 08:37:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-20 08:37:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2019-11-20 08:37:09,873 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 32 [2019-11-20 08:37:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:09,874 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2019-11-20 08:37:09,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 08:37:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2019-11-20 08:37:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:37:09,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:09,875 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:10,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:10,078 INFO L410 AbstractCegarLoop]: === Iteration 12 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:10,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:10,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1105471948, now seen corresponding path program 1 times [2019-11-20 08:37:10,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:10,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [797173390] [2019-11-20 08:37:10,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:10,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 08:37:10,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:10,383 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:37:10,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:10,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:10,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:10,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 08:37:10,472 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:10,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-11-20 08:37:10,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:10,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:10,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:10,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2019-11-20 08:37:10,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:37:10,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:10,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:10,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:10,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 08:37:10,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 08:37:10,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:10,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:10,596 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:37:10,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-11-20 08:37:10,753 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:10,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-20 08:37:10,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:10,791 INFO L567 ElimStorePlain]: treesize reduction 24, result has 57.9 percent of original size [2019-11-20 08:37:10,791 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:37:10,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-11-20 08:37:10,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:37:10,850 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:10,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 52 [2019-11-20 08:37:10,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:10,897 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.4 percent of original size [2019-11-20 08:37:10,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:37:10,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:39 [2019-11-20 08:37:11,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:11,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2019-11-20 08:37:11,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:11,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:11,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:11,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2019-11-20 08:37:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:11,366 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:11,812 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 08:37:12,038 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 08:37:12,280 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 08:37:12,573 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 08:37:13,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:13,221 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-11-20 08:37:13,221 INFO L567 ElimStorePlain]: treesize reduction 25, result has 66.2 percent of original size [2019-11-20 08:37:13,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:13,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 08:37:13,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:41 [2019-11-20 08:37:13,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:13,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:13,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [797173390] [2019-11-20 08:37:13,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:37:13,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2019-11-20 08:37:13,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477599493] [2019-11-20 08:37:13,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-20 08:37:13,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:13,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-20 08:37:13,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2019-11-20 08:37:13,807 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand 32 states. [2019-11-20 08:37:15,181 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-11-20 08:37:15,645 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-11-20 08:37:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:17,218 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2019-11-20 08:37:17,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 08:37:17,219 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-11-20 08:37:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:17,220 INFO L225 Difference]: With dead ends: 128 [2019-11-20 08:37:17,220 INFO L226 Difference]: Without dead ends: 128 [2019-11-20 08:37:17,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=299, Invalid=1863, Unknown=0, NotChecked=0, Total=2162 [2019-11-20 08:37:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-20 08:37:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2019-11-20 08:37:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-20 08:37:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2019-11-20 08:37:17,225 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 38 [2019-11-20 08:37:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:17,225 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2019-11-20 08:37:17,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-20 08:37:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2019-11-20 08:37:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:37:17,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:17,226 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:17,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:17,427 INFO L410 AbstractCegarLoop]: === Iteration 13 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:17,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1105470732, now seen corresponding path program 1 times [2019-11-20 08:37:17,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:17,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1766967358] [2019-11-20 08:37:17,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:17,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 08:37:17,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:17,670 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 13 treesize of output 9 [2019-11-20 08:37:17,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:17,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:17,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:17,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 08:37:17,770 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 15 treesize of output 7 [2019-11-20 08:37:17,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:17,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:17,773 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:37:17,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 08:37:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 08:37:17,804 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 08:37:18,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1766967358] [2019-11-20 08:37:18,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:18,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 18 [2019-11-20 08:37:18,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098566859] [2019-11-20 08:37:18,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 08:37:18,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:18,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 08:37:18,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-20 08:37:18,112 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand 19 states. [2019-11-20 08:37:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:18,789 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2019-11-20 08:37:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 08:37:18,789 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-11-20 08:37:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:18,790 INFO L225 Difference]: With dead ends: 119 [2019-11-20 08:37:18,790 INFO L226 Difference]: Without dead ends: 119 [2019-11-20 08:37:18,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2019-11-20 08:37:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-20 08:37:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-11-20 08:37:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-20 08:37:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2019-11-20 08:37:18,794 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 38 [2019-11-20 08:37:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:18,795 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2019-11-20 08:37:18,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 08:37:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2019-11-20 08:37:18,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:37:18,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:18,796 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:18,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:18,996 INFO L410 AbstractCegarLoop]: === Iteration 14 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:18,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:18,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1105509714, now seen corresponding path program 1 times [2019-11-20 08:37:18,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:18,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1334553738] [2019-11-20 08:37:18,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:19,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 08:37:19,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 08:37:19,333 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 08:37:19,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1334553738] [2019-11-20 08:37:19,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:19,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2019-11-20 08:37:19,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860909099] [2019-11-20 08:37:19,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 08:37:19,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:19,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 08:37:19,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-20 08:37:19,478 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 17 states. [2019-11-20 08:37:20,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:20,156 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2019-11-20 08:37:20,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 08:37:20,157 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-11-20 08:37:20,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:20,158 INFO L225 Difference]: With dead ends: 114 [2019-11-20 08:37:20,158 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 08:37:20,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-11-20 08:37:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 08:37:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-20 08:37:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 08:37:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-11-20 08:37:20,161 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 38 [2019-11-20 08:37:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:20,162 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-11-20 08:37:20,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 08:37:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-11-20 08:37:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 08:37:20,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:20,163 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:20,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:20,366 INFO L410 AbstractCegarLoop]: === Iteration 15 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash 90108066, now seen corresponding path program 1 times [2019-11-20 08:37:20,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:20,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1756706852] [2019-11-20 08:37:20,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:20,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 08:37:20,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:20,680 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:37:20,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:20,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:20,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:20,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-20 08:37:20,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:20,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-11-20 08:37:20,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:20,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:20,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:20,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:18 [2019-11-20 08:37:20,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:37:20,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:20,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:20,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:20,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-20 08:37:20,876 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:20,876 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 55 [2019-11-20 08:37:20,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:20,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:20,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:20,895 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:37:20,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-11-20 08:37:21,029 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:21,029 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 81 [2019-11-20 08:37:21,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:21,083 INFO L567 ElimStorePlain]: treesize reduction 42, result has 52.3 percent of original size [2019-11-20 08:37:21,084 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:37:21,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2019-11-20 08:37:21,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:37:21,211 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:21,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 111 [2019-11-20 08:37:21,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:21,274 INFO L567 ElimStorePlain]: treesize reduction 68, result has 44.7 percent of original size [2019-11-20 08:37:21,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:37:21,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:58 [2019-11-20 08:37:21,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:21,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 93 [2019-11-20 08:37:21,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:37:21,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:37:21,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:21,907 INFO L567 ElimStorePlain]: treesize reduction 11, result has 50.0 percent of original size [2019-11-20 08:37:21,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:21,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:7 [2019-11-20 08:37:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:22,133 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:22,580 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 08:37:22,761 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 08:37:22,939 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 08:37:23,170 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 08:37:23,220 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:37:23,242 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:37:23,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:37:23,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:37:23,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:23,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:23,274 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_129| vanished before elimination [2019-11-20 08:37:23,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:23,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:93, output treesize:1 [2019-11-20 08:37:23,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:24,047 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2019-11-20 08:37:24,047 INFO L567 ElimStorePlain]: treesize reduction 50, result has 32.4 percent of original size [2019-11-20 08:37:24,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:37:24,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:24,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 08:37:24,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:28 [2019-11-20 08:37:24,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:26,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:26,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:37:26,407 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:26,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-11-20 08:37:26,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:26,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 08:37:26,432 INFO L567 ElimStorePlain]: treesize reduction 5, result has 68.8 percent of original size [2019-11-20 08:37:26,432 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:37:26,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:11 [2019-11-20 08:37:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:26,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1756706852] [2019-11-20 08:37:26,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:37:26,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 35 [2019-11-20 08:37:26,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390341134] [2019-11-20 08:37:26,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-20 08:37:26,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:26,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-20 08:37:26,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1144, Unknown=1, NotChecked=0, Total=1260 [2019-11-20 08:37:26,542 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 36 states. [2019-11-20 08:37:28,064 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-11-20 08:37:28,613 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-11-20 08:37:28,994 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-20 08:37:29,238 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-20 08:37:29,580 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-11-20 08:37:29,920 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-20 08:37:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:33,069 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-11-20 08:37:33,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 08:37:33,070 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2019-11-20 08:37:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:33,071 INFO L225 Difference]: With dead ends: 113 [2019-11-20 08:37:33,071 INFO L226 Difference]: Without dead ends: 113 [2019-11-20 08:37:33,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=335, Invalid=2316, Unknown=1, NotChecked=0, Total=2652 [2019-11-20 08:37:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-20 08:37:33,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2019-11-20 08:37:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 08:37:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-11-20 08:37:33,075 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 39 [2019-11-20 08:37:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:33,075 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-11-20 08:37:33,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-20 08:37:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-11-20 08:37:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 08:37:33,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:33,076 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:33,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:33,277 INFO L410 AbstractCegarLoop]: === Iteration 16 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:33,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:33,278 INFO L82 PathProgramCache]: Analyzing trace with hash 90145800, now seen corresponding path program 1 times [2019-11-20 08:37:33,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:33,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [274355948] [2019-11-20 08:37:33,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:33,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 08:37:33,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:33,560 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 13 treesize of output 9 [2019-11-20 08:37:33,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:33,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:33,571 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:37:33,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-11-20 08:37:33,708 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 15 treesize of output 7 [2019-11-20 08:37:33,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:33,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:33,714 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:37:33,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-20 08:37:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 08:37:33,772 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 08:37:34,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [274355948] [2019-11-20 08:37:34,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:34,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 10] imperfect sequences [] total 22 [2019-11-20 08:37:34,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96813968] [2019-11-20 08:37:34,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 08:37:34,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:34,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 08:37:34,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-11-20 08:37:34,192 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 23 states. [2019-11-20 08:37:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:37,037 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2019-11-20 08:37:37,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 08:37:37,038 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-20 08:37:37,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:37,039 INFO L225 Difference]: With dead ends: 104 [2019-11-20 08:37:37,039 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 08:37:37,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-11-20 08:37:37,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 08:37:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 08:37:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 08:37:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2019-11-20 08:37:37,043 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 39 [2019-11-20 08:37:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:37,043 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2019-11-20 08:37:37,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 08:37:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2019-11-20 08:37:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:37:37,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:37,044 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:37,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:37,245 INFO L410 AbstractCegarLoop]: === Iteration 17 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1501617162, now seen corresponding path program 1 times [2019-11-20 08:37:37,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:37,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [182181589] [2019-11-20 08:37:37,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:37,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-20 08:37:37,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:37,517 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:37,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 08:37:37,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:37,534 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-20 08:37:37,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:37,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-20 08:37:37,579 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:37,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-11-20 08:37:37,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:37,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:37,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:37,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2019-11-20 08:37:37,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:37:37,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:37,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:37,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:37,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-20 08:37:37,651 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:37,651 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2019-11-20 08:37:37,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:37,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:37,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:37,666 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:37:37,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:40 [2019-11-20 08:37:37,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:37,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2019-11-20 08:37:37,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:37,861 INFO L567 ElimStorePlain]: treesize reduction 42, result has 52.8 percent of original size [2019-11-20 08:37:37,862 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:37:37,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2019-11-20 08:37:37,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:37:38,031 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:38,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 115 [2019-11-20 08:37:38,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:38,126 INFO L567 ElimStorePlain]: treesize reduction 46, result has 54.9 percent of original size [2019-11-20 08:37:38,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:37:38,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:59 [2019-11-20 08:37:38,854 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 08:37:38,855 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:38,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 95 [2019-11-20 08:37:38,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:37:38,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:37:38,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:38,878 INFO L567 ElimStorePlain]: treesize reduction 42, result has 22.2 percent of original size [2019-11-20 08:37:38,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:38,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:7 [2019-11-20 08:37:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:38,949 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:39,527 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-20 08:37:39,806 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 08:37:39,967 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 08:37:40,157 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 08:37:40,507 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:40,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2019-11-20 08:37:40,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:40,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:40,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:40,517 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:37:40,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:35 [2019-11-20 08:37:40,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:40,637 INFO L567 ElimStorePlain]: treesize reduction 29, result has 29.3 percent of original size [2019-11-20 08:37:40,637 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:37:40,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:8 [2019-11-20 08:37:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 08:37:40,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [182181589] [2019-11-20 08:37:40,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:37:40,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2019-11-20 08:37:40,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194521393] [2019-11-20 08:37:40,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-20 08:37:40,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:40,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-20 08:37:40,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2019-11-20 08:37:40,956 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 33 states. [2019-11-20 08:37:42,145 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-11-20 08:37:42,576 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-11-20 08:37:43,295 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-20 08:37:43,788 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-11-20 08:37:43,995 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-11-20 08:37:46,581 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-20 08:37:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:47,325 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2019-11-20 08:37:47,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 08:37:47,326 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2019-11-20 08:37:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:47,326 INFO L225 Difference]: With dead ends: 107 [2019-11-20 08:37:47,326 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 08:37:47,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=372, Invalid=2078, Unknown=0, NotChecked=0, Total=2450 [2019-11-20 08:37:47,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 08:37:47,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-11-20 08:37:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 08:37:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2019-11-20 08:37:47,329 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 40 [2019-11-20 08:37:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:47,329 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2019-11-20 08:37:47,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-20 08:37:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2019-11-20 08:37:47,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:37:47,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:47,330 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:47,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:47,534 INFO L410 AbstractCegarLoop]: === Iteration 18 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:47,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:47,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1500447370, now seen corresponding path program 1 times [2019-11-20 08:37:47,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:47,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2118565255] [2019-11-20 08:37:47,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:47,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 08:37:47,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:47,774 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 5 treesize of output 3 [2019-11-20 08:37:47,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:47,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:47,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:47,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2019-11-20 08:37:47,797 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 13 treesize of output 9 [2019-11-20 08:37:47,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:47,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:47,806 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:37:47,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-11-20 08:37:47,891 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 11 [2019-11-20 08:37:47,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:47,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:47,892 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:37:47,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:5 [2019-11-20 08:37:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 08:37:47,923 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 08:37:48,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2118565255] [2019-11-20 08:37:48,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:48,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 19 [2019-11-20 08:37:48,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431873512] [2019-11-20 08:37:48,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 08:37:48,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:48,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 08:37:48,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-11-20 08:37:48,363 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 20 states. [2019-11-20 08:37:49,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:49,479 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-11-20 08:37:49,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 08:37:49,479 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-11-20 08:37:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:49,480 INFO L225 Difference]: With dead ends: 102 [2019-11-20 08:37:49,480 INFO L226 Difference]: Without dead ends: 102 [2019-11-20 08:37:49,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-11-20 08:37:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-20 08:37:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-20 08:37:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 08:37:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2019-11-20 08:37:49,484 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 40 [2019-11-20 08:37:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:49,484 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2019-11-20 08:37:49,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 08:37:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2019-11-20 08:37:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 08:37:49,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:49,491 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:49,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:49,692 INFO L410 AbstractCegarLoop]: === Iteration 19 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:49,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:49,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1505910075, now seen corresponding path program 1 times [2019-11-20 08:37:49,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:49,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [947117213] [2019-11-20 08:37:49,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:49,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 08:37:49,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:49,953 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 5 treesize of output 3 [2019-11-20 08:37:49,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:49,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:49,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:49,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2019-11-20 08:37:49,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:49,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 08:37:49,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:49,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:49,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:49,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-20 08:37:50,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 08:37:50,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:50,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:50,034 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:37:50,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2019-11-20 08:37:50,202 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 27 treesize of output 15 [2019-11-20 08:37:50,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:50,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:50,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:50,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:10 [2019-11-20 08:37:50,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 08:37:50,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:50,320 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-20 08:37:50,321 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:37:50,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-20 08:37:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:50,386 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:51,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:51,247 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 6 treesize of output 4 [2019-11-20 08:37:51,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:51,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:51,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:51,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-20 08:37:51,322 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:51,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2019-11-20 08:37:51,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:51,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:51,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:51,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:51,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-20 08:37:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:51,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [947117213] [2019-11-20 08:37:51,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:37:51,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2019-11-20 08:37:51,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925875209] [2019-11-20 08:37:51,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 08:37:51,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:51,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 08:37:51,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-11-20 08:37:51,332 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 26 states. [2019-11-20 08:37:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:52,696 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-11-20 08:37:52,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 08:37:52,696 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2019-11-20 08:37:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:52,697 INFO L225 Difference]: With dead ends: 101 [2019-11-20 08:37:52,697 INFO L226 Difference]: Without dead ends: 101 [2019-11-20 08:37:52,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2019-11-20 08:37:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-20 08:37:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-11-20 08:37:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 08:37:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2019-11-20 08:37:52,701 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 43 [2019-11-20 08:37:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:52,701 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2019-11-20 08:37:52,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 08:37:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2019-11-20 08:37:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 08:37:52,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:52,702 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:52,902 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:37:52,903 INFO L410 AbstractCegarLoop]: === Iteration 20 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:37:52,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:52,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1506341051, now seen corresponding path program 1 times [2019-11-20 08:37:52,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:37:52,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2068859979] [2019-11-20 08:37:52,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:37:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:53,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-20 08:37:53,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:37:53,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:53,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 08:37:53,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:53,236 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-20 08:37:53,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:53,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-20 08:37:53,280 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:53,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-11-20 08:37:53,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:53,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:53,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:53,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2019-11-20 08:37:53,300 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:37:53,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:53,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:53,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:37:53,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-20 08:37:53,350 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:53,350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2019-11-20 08:37:53,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:37:53,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:53,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 08:37:53,392 INFO L567 ElimStorePlain]: treesize reduction 40, result has 50.6 percent of original size [2019-11-20 08:37:53,392 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:37:53,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:40 [2019-11-20 08:37:53,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:53,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2019-11-20 08:37:53,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:53,527 INFO L567 ElimStorePlain]: treesize reduction 42, result has 52.8 percent of original size [2019-11-20 08:37:53,528 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:37:53,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2019-11-20 08:37:53,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:37:53,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:53,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 115 [2019-11-20 08:37:53,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:53,666 INFO L567 ElimStorePlain]: treesize reduction 68, result has 45.2 percent of original size [2019-11-20 08:37:53,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:37:53,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:59 [2019-11-20 08:37:54,153 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:54,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 95 [2019-11-20 08:37:54,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:37:54,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:37:54,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:54,172 INFO L567 ElimStorePlain]: treesize reduction 42, result has 19.2 percent of original size [2019-11-20 08:37:54,173 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:37:54,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:10 [2019-11-20 08:37:54,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 08:37:54,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:54,260 INFO L567 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2019-11-20 08:37:54,261 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:37:54,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2019-11-20 08:37:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:54,314 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:37:54,959 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-20 08:37:55,115 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 08:37:55,346 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 08:37:55,570 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 08:37:56,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:56,061 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 43 treesize of output 41 [2019-11-20 08:37:56,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:56,097 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:56,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2019-11-20 08:37:56,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:56,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:56,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:37:56,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-20 08:37:56,115 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:72 [2019-11-20 08:37:56,346 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:37:56,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:37:56,420 INFO L567 ElimStorePlain]: treesize reduction 10, result has 88.6 percent of original size [2019-11-20 08:37:56,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 08:37:56,465 INFO L567 ElimStorePlain]: treesize reduction 30, result has 43.4 percent of original size [2019-11-20 08:37:56,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 08:37:56,465 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:136, output treesize:9 [2019-11-20 08:37:56,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:37:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:56,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2068859979] [2019-11-20 08:37:56,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:37:56,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 33 [2019-11-20 08:37:56,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580077401] [2019-11-20 08:37:56,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-20 08:37:56,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 08:37:56,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-20 08:37:56,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2019-11-20 08:37:56,653 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 34 states. [2019-11-20 08:37:57,811 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-11-20 08:37:58,106 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-11-20 08:37:59,340 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-20 08:37:59,540 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-11-20 08:38:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:01,065 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2019-11-20 08:38:01,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 08:38:01,065 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2019-11-20 08:38:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:01,066 INFO L225 Difference]: With dead ends: 104 [2019-11-20 08:38:01,066 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 08:38:01,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=352, Invalid=2300, Unknown=0, NotChecked=0, Total=2652 [2019-11-20 08:38:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 08:38:01,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2019-11-20 08:38:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 08:38:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-11-20 08:38:01,074 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 43 [2019-11-20 08:38:01,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:01,074 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-11-20 08:38:01,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-20 08:38:01,075 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-11-20 08:38:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 08:38:01,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:01,076 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:01,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:38:01,286 INFO L410 AbstractCegarLoop]: === Iteration 21 === [_destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr46ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr47ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr48ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION]=== [2019-11-20 08:38:01,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:01,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1240568634, now seen corresponding path program 1 times [2019-11-20 08:38:01,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 08:38:01,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [172075494] [2019-11-20 08:38:01,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_909250d0-5509-4644-afb2-c10aebc3e7b5/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:38:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:01,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-20 08:38:01,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:01,563 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:38:01,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:38:01,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:38:01,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:38:01,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 08:38:01,591 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:38:01,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 08:38:01,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:38:01,611 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-20 08:38:01,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:38:01,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-11-20 08:38:01,656 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:38:01,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2019-11-20 08:38:01,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:38:01,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:38:01,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:38:01,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:16 [2019-11-20 08:38:01,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:38:01,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:38:01,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:38:01,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:38:01,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-20 08:38:01,739 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:38:01,739 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 56 [2019-11-20 08:38:01,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:38:01,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:38:01,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:38:01,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 08:38:01,795 INFO L567 ElimStorePlain]: treesize reduction 37, result has 50.7 percent of original size [2019-11-20 08:38:01,795 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:38:01,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2019-11-20 08:38:01,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:38:01,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 82 [2019-11-20 08:38:01,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:38:01,955 INFO L567 ElimStorePlain]: treesize reduction 42, result has 53.8 percent of original size [2019-11-20 08:38:01,955 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:38:01,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2019-11-20 08:38:02,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:38:02,070 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:38:02,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 112 [2019-11-20 08:38:02,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:38:02,128 INFO L567 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-11-20 08:38:02,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:38:02,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:73 [2019-11-20 08:38:02,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:38:02,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 104 [2019-11-20 08:38:02,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:38:02,797 INFO L567 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-11-20 08:38:02,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:38:02,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:78, output treesize:10 [2019-11-20 08:38:02,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 08:38:02,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:38:02,895 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-20 08:38:02,896 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:38:02,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-20 08:38:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:38:02,956 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 08:38:03,872 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-20 08:38:04,156 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 08:38:04,529 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 08:38:04,962 WARN L191 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 08:38:05,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:38:05,182 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 6 treesize of output 4 [2019-11-20 08:38:05,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:38:05,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:38:05,186 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:38:05,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-11-20 08:38:05,638 INFO L343 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2019-11-20 08:38:05,638 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 2 case distinctions, treesize of input 37 treesize of output 40 [2019-11-20 08:38:05,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:38:05,649 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:38:05,650 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 40 treesize of output 42 [2019-11-20 08:38:05,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:38:05,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:38:05,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:38:05,652 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_104], 2=[v_arrayElimCell_103]} [2019-11-20 08:38:05,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 08:38:05,855 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:38:05,858 INFO L168 Benchmark]: Toolchain (without parser) took 68404.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.8 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -299.8 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:38:05,858 INFO L168 Benchmark]: CDTParser took 0.25 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:38:05,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -139.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-20 08:38:05,859 INFO L168 Benchmark]: Boogie Preprocessor took 63.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 08:38:05,859 INFO L168 Benchmark]: RCFGBuilder took 893.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. [2019-11-20 08:38:05,859 INFO L168 Benchmark]: TraceAbstraction took 66916.03 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -231.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:38:05,860 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 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 527.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -139.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 893.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66916.03 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -231.3 MB). There was no memory consumed. 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...