./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232-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_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 9ee3a23cf8ca0f6d04d9d74ad314377c3dff5fab ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 01:01:09,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:01:09,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:01:09,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:01:09,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:01:09,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:01:09,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:01:09,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:01:09,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:01:09,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:01:09,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:01:09,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:01:09,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:01:09,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:01:09,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:01:09,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:01:09,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:01:09,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:01:09,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:01:09,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:01:09,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:01:09,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:01:09,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:01:09,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:01:09,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:01:09,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:01:09,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:01:09,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:01:09,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:01:09,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:01:09,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:01:09,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:01:09,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:01:09,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:01:09,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:01:09,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:01:09,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:01:09,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:01:09,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:01:09,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:01:09,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:01:09,358 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 01:01:09,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:01:09,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:01:09,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:01:09,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:01:09,394 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:01:09,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:01:09,394 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:01:09,395 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 01:01:09,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:01:09,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:01:09,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:01:09,395 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 01:01:09,396 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 01:01:09,396 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 01:01:09,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:01:09,396 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 01:01:09,396 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 01:01:09,397 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:01:09,397 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:01:09,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:01:09,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:01:09,397 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:01:09,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:01:09,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:01:09,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:01:09,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:01:09,399 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 01:01:09,399 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 01:01:09,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 01:01:09,399 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_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 -> 9ee3a23cf8ca0f6d04d9d74ad314377c3dff5fab [2019-11-20 01:01:09,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:01:09,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:01:09,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:01:09,553 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:01:09,553 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:01:09,554 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-0232-1.i [2019-11-20 01:01:09,603 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/bin/uautomizer/data/2f5ab6a6d/fd79125ada9645e0afa5d9a946344d66/FLAG8d45da04c [2019-11-20 01:01:10,043 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:01:10,044 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/sv-benchmarks/c/memsafety/test-0232-1.i [2019-11-20 01:01:10,062 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/bin/uautomizer/data/2f5ab6a6d/fd79125ada9645e0afa5d9a946344d66/FLAG8d45da04c [2019-11-20 01:01:10,073 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/bin/uautomizer/data/2f5ab6a6d/fd79125ada9645e0afa5d9a946344d66 [2019-11-20 01:01:10,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:01:10,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 01:01:10,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:01:10,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:01:10,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:01:10,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:01:10" (1/1) ... [2019-11-20 01:01:10,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628b2886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:01:10, skipping insertion in model container [2019-11-20 01:01:10,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:01:10" (1/1) ... [2019-11-20 01:01:10,091 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:01:10,128 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:01:10,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:01:10,475 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:01:10,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:01:10,610 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:01:10,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:01:10 WrapperNode [2019-11-20 01:01:10,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:01:10,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:01:10,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:01:10,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:01:10,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:01:10" (1/1) ... [2019-11-20 01:01:10,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:01:10" (1/1) ... [2019-11-20 01:01:10,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:01:10" (1/1) ... [2019-11-20 01:01:10,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:01:10" (1/1) ... [2019-11-20 01:01:10,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:01:10" (1/1) ... [2019-11-20 01:01:10,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:01:10" (1/1) ... [2019-11-20 01:01:10,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:01:10" (1/1) ... [2019-11-20 01:01:10,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:01:10,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:01:10,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:01:10,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:01:10,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:01:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 01:01:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:01:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 01:01:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 01:01:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 01:01:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 01:01:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 01:01:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-20 01:01:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 01:01:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 01:01:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 01:01:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 01:01:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 01:01:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 01:01:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 01:01:10,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 01:01:10,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 01:01:10,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 01:01:10,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 01:01:10,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 01:01:10,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 01:01:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 01:01:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 01:01:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 01:01:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 01:01:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 01:01:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 01:01:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 01:01:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 01:01:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 01:01:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 01:01:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 01:01:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 01:01:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 01:01:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 01:01:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 01:01:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 01:01:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 01:01:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 01:01:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 01:01:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 01:01:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 01:01:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 01:01:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 01:01:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 01:01:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 01:01:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 01:01:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 01:01:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 01:01:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 01:01:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 01:01:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 01:01:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 01:01:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 01:01:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 01:01:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 01:01:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 01:01:10,787 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 01:01:10,787 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 01:01:10,787 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 01:01:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 01:01:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 01:01:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 01:01:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 01:01:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 01:01:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 01:01:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 01:01:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 01:01:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 01:01:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 01:01:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 01:01:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 01:01:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 01:01:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 01:01:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 01:01:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 01:01:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 01:01:10,794 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 01:01:10,794 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 01:01:10,794 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 01:01:10,794 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 01:01:10,795 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 01:01:10,795 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 01:01:10,795 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 01:01:10,795 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 01:01:10,795 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 01:01:10,795 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 01:01:10,795 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 01:01:10,796 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 01:01:10,796 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 01:01:10,796 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 01:01:10,796 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 01:01:10,796 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 01:01:10,796 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 01:01:10,796 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 01:01:10,796 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 01:01:10,796 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 01:01:10,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 01:01:10,796 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 01:01:10,796 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 01:01:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 01:01:10,798 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 01:01:10,800 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 01:01:10,800 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 01:01:10,800 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 01:01:10,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 01:01:10,801 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-20 01:01:10,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 01:01:10,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 01:01:10,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 01:01:10,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 01:01:10,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:01:10,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 01:01:10,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:01:10,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 01:01:10,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:01:11,503 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:01:11,503 INFO L285 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-20 01:01:11,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:01:11 BoogieIcfgContainer [2019-11-20 01:01:11,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:01:11,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:01:11,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:01:11,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:01:11,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:01:10" (1/3) ... [2019-11-20 01:01:11,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46140c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:01:11, skipping insertion in model container [2019-11-20 01:01:11,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:01:10" (2/3) ... [2019-11-20 01:01:11,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46140c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:01:11, skipping insertion in model container [2019-11-20 01:01:11,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:01:11" (3/3) ... [2019-11-20 01:01:11,515 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2019-11-20 01:01:11,524 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:01:11,534 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-11-20 01:01:11,554 INFO L249 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-11-20 01:01:11,574 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:01:11,575 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 01:01:11,575 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:01:11,575 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:01:11,575 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:01:11,575 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:01:11,575 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:01:11,576 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:01:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-11-20 01:01:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 01:01:11,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:11,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:11,613 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:11,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1838646891, now seen corresponding path program 1 times [2019-11-20 01:01:11,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:11,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1189167833] [2019-11-20 01:01:11,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:11,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 01:01:11,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:11,867 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 01:01:11,868 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:11,885 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 01:01:11,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1189167833] [2019-11-20 01:01:11,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:11,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:01:11,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684462758] [2019-11-20 01:01:11,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 01:01:11,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:11,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 01:01:11,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:01:11,909 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2019-11-20 01:01:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:11,937 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-11-20 01:01:11,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 01:01:11,939 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-20 01:01:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:11,957 INFO L225 Difference]: With dead ends: 88 [2019-11-20 01:01:11,958 INFO L226 Difference]: Without dead ends: 85 [2019-11-20 01:01:11,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:01:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-20 01:01:12,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-20 01:01:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 01:01:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2019-11-20 01:01:12,015 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 8 [2019-11-20 01:01:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:12,015 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2019-11-20 01:01:12,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 01:01:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2019-11-20 01:01:12,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 01:01:12,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:12,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:12,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:12,217 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:12,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1163581944, now seen corresponding path program 1 times [2019-11-20 01:01:12,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:12,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [171921878] [2019-11-20 01:01:12,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:12,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:01:12,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:12,502 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 01:01:12,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:12,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:12,522 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 01:01:12,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:12,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:12,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:12,540 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 01:01:12,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:01:12,596 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 01:01:12,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:12,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:12,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:01:12,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 01:01:12,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:12,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:12,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:12,632 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-20 01:01:12,662 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 01:01:12,662 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:12,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:13,027 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 01:01:13,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [171921878] [2019-11-20 01:01:13,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:13,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 01:01:13,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031646330] [2019-11-20 01:01:13,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:01:13,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:13,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:01:13,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:01:13,030 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 8 states. [2019-11-20 01:01:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:17,240 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-11-20 01:01:17,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:01:17,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-20 01:01:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:17,245 INFO L225 Difference]: With dead ends: 103 [2019-11-20 01:01:17,245 INFO L226 Difference]: Without dead ends: 103 [2019-11-20 01:01:17,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:01:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-20 01:01:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2019-11-20 01:01:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-20 01:01:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-11-20 01:01:17,255 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 9 [2019-11-20 01:01:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:17,256 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-11-20 01:01:17,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:01:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-11-20 01:01:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 01:01:17,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:17,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:17,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:17,460 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:17,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:17,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1163581943, now seen corresponding path program 1 times [2019-11-20 01:01:17,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:17,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1462416721] [2019-11-20 01:01:17,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:17,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:01:17,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:17,651 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 01:01:17,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:17,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:17,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:17,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 01:01:17,705 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:17,705 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 01:01:17,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:17,743 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-20 01:01:17,744 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 01:01:17,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-20 01:01:17,761 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 01:01:17,761 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:17,823 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 01:01:17,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1462416721] [2019-11-20 01:01:17,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:17,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 01:01:17,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460981545] [2019-11-20 01:01:17,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:01:17,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:17,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:01:17,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:01:17,825 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 8 states. [2019-11-20 01:01:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:18,194 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-11-20 01:01:18,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:01:18,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-20 01:01:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:18,196 INFO L225 Difference]: With dead ends: 78 [2019-11-20 01:01:18,196 INFO L226 Difference]: Without dead ends: 78 [2019-11-20 01:01:18,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:01:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-20 01:01:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-20 01:01:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-20 01:01:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-11-20 01:01:18,211 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 9 [2019-11-20 01:01:18,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:18,211 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-11-20 01:01:18,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:01:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-11-20 01:01:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 01:01:18,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:18,212 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:18,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:18,413 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1711301932, now seen corresponding path program 1 times [2019-11-20 01:01:18,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:18,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [580803305] [2019-11-20 01:01:18,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:18,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:01:18,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:18,618 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 01:01:18,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:18,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:18,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:18,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 01:01:18,636 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 01:01:18,636 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:18,659 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 01:01:18,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [580803305] [2019-11-20 01:01:18,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:18,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-20 01:01:18,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073434570] [2019-11-20 01:01:18,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:01:18,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:18,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:01:18,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:01:18,661 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 4 states. [2019-11-20 01:01:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:18,836 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2019-11-20 01:01:18,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:01:18,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 01:01:18,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:18,837 INFO L225 Difference]: With dead ends: 74 [2019-11-20 01:01:18,837 INFO L226 Difference]: Without dead ends: 74 [2019-11-20 01:01:18,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 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 01:01:18,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-20 01:01:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-20 01:01:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 01:01:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-11-20 01:01:18,847 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 10 [2019-11-20 01:01:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:18,848 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-11-20 01:01:18,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:01:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-11-20 01:01:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 01:01:18,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:18,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:19,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:19,051 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:19,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:19,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1711301933, now seen corresponding path program 1 times [2019-11-20 01:01:19,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:19,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [74714006] [2019-11-20 01:01:19,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:19,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:01:19,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:19,227 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 01:01:19,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:19,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:19,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:19,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 01:01:19,248 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 01:01:19,249 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:19,287 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 01:01:19,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [74714006] [2019-11-20 01:01:19,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:19,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 01:01:19,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731415763] [2019-11-20 01:01:19,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:01:19,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:19,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:01:19,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:01:19,289 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2019-11-20 01:01:19,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:19,524 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-20 01:01:19,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:01:19,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 01:01:19,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:19,525 INFO L225 Difference]: With dead ends: 70 [2019-11-20 01:01:19,525 INFO L226 Difference]: Without dead ends: 70 [2019-11-20 01:01:19,525 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 01:01:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-20 01:01:19,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-20 01:01:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-20 01:01:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-11-20 01:01:19,531 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 10 [2019-11-20 01:01:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:19,531 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-11-20 01:01:19,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:01:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-11-20 01:01:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 01:01:19,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:19,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:19,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:19,735 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash 42455267, now seen corresponding path program 1 times [2019-11-20 01:01:19,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:19,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1631024458] [2019-11-20 01:01:19,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:19,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 01:01:19,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:20,010 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-20 01:01:20,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 18 [2019-11-20 01:01:20,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:20,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:20,049 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-20 01:01:20,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 18 [2019-11-20 01:01:20,050 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:20,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:20,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:20,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2019-11-20 01:01:20,114 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:20,114 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 26 treesize of output 22 [2019-11-20 01:01:20,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:20,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:20,140 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:20,140 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 26 treesize of output 22 [2019-11-20 01:01:20,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:20,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:20,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:20,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2019-11-20 01:01:20,161 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 01:01:20,161 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:20,323 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 01:01:20,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1631024458] [2019-11-20 01:01:20,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:20,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 01:01:20,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056832752] [2019-11-20 01:01:20,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 01:01:20,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:20,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 01:01:20,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:01:20,325 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 13 states. [2019-11-20 01:01:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:21,079 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-11-20 01:01:21,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 01:01:21,081 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-20 01:01:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:21,082 INFO L225 Difference]: With dead ends: 82 [2019-11-20 01:01:21,082 INFO L226 Difference]: Without dead ends: 82 [2019-11-20 01:01:21,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-11-20 01:01:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-20 01:01:21,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2019-11-20 01:01:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-20 01:01:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-20 01:01:21,088 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2019-11-20 01:01:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:21,088 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-20 01:01:21,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 01:01:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-20 01:01:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 01:01:21,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:21,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:21,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:21,290 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:21,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:21,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1739337176, now seen corresponding path program 1 times [2019-11-20 01:01:21,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:21,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1341800820] [2019-11-20 01:01:21,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:21,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:01:21,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:21,505 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 01:01:21,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:21,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:21,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:21,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-20 01:01:21,536 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 11 treesize of output 7 [2019-11-20 01:01:21,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:21,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:21,543 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 01:01:21,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-20 01:01:21,576 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 01:01:21,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:21,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:21,578 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 01:01:21,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-20 01:01:21,589 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 01:01:21,589 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:21,695 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 32 treesize of output 28 [2019-11-20 01:01:21,697 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:21,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:21,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:21,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-20 01:01:21,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:21,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 01:01:21,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:21,821 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2019-11-20 01:01:21,821 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:21,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:21,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:01:21,828 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-20 01:01:21,837 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 01:01:21,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1341800820] [2019-11-20 01:01:21,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:21,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2019-11-20 01:01:21,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634002470] [2019-11-20 01:01:21,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:01:21,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:21,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:01:21,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:01:21,839 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 10 states. [2019-11-20 01:01:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:22,273 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-11-20 01:01:22,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:01:22,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-20 01:01:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:22,275 INFO L225 Difference]: With dead ends: 85 [2019-11-20 01:01:22,275 INFO L226 Difference]: Without dead ends: 85 [2019-11-20 01:01:22,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:01:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-20 01:01:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2019-11-20 01:01:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-20 01:01:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2019-11-20 01:01:22,283 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 23 [2019-11-20 01:01:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:22,284 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2019-11-20 01:01:22,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:01:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2019-11-20 01:01:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 01:01:22,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:22,285 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:22,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:22,489 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:22,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:22,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1739337175, now seen corresponding path program 1 times [2019-11-20 01:01:22,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:22,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1330617874] [2019-11-20 01:01:22,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:22,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 01:01:22,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:22,716 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 11 treesize of output 7 [2019-11-20 01:01:22,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:22,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:22,733 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 11 treesize of output 7 [2019-11-20 01:01:22,733 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:22,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:22,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:22,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-11-20 01:01:22,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 01:01:22,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:22,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:22,813 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 01:01:22,814 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:22,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:22,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:22,823 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-11-20 01:01:22,862 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 01:01:22,862 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:23,263 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 28 treesize of output 24 [2019-11-20 01:01:23,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 01:01:23,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:23,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:01:23,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:01:23,300 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:23,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:23,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:01:23,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:01:23,351 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:23,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:23,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:01:23,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:01:23,377 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:23,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:23,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-11-20 01:01:23,396 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:22 [2019-11-20 01:01:23,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 01:01:23,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-20 01:01:23,473 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:23,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 01:01:23,480 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:23,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-20 01:01:23,489 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:23,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 01:01:23,508 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:23,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-20 01:01:23,520 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:23,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:23,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2019-11-20 01:01:23,576 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:67, output treesize:55 [2019-11-20 01:01:23,766 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 01:01:23,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1330617874] [2019-11-20 01:01:23,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:23,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2019-11-20 01:01:23,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442661105] [2019-11-20 01:01:23,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 01:01:23,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 01:01:23,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:01:23,767 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 13 states. [2019-11-20 01:01:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:24,693 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-11-20 01:01:24,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:01:24,694 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-20 01:01:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:24,695 INFO L225 Difference]: With dead ends: 87 [2019-11-20 01:01:24,695 INFO L226 Difference]: Without dead ends: 87 [2019-11-20 01:01:24,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-20 01:01:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-20 01:01:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-11-20 01:01:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 01:01:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-11-20 01:01:24,705 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 23 [2019-11-20 01:01:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:24,705 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-20 01:01:24,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 01:01:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-11-20 01:01:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 01:01:24,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:24,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:24,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:24,912 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:24,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:24,913 INFO L82 PathProgramCache]: Analyzing trace with hash -740581632, now seen corresponding path program 1 times [2019-11-20 01:01:24,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:24,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1833065644] [2019-11-20 01:01:24,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:25,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:01:25,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:25,101 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 11 treesize of output 7 [2019-11-20 01:01:25,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:25,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:25,107 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 01:01:25,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-20 01:01:25,133 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 16 treesize of output 8 [2019-11-20 01:01:25,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:25,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:25,136 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 01:01:25,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-20 01:01:25,148 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 01:01:25,148 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:25,247 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 30 treesize of output 26 [2019-11-20 01:01:25,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 01:01:25,264 INFO L567 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2019-11-20 01:01:25,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 01:01:25,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2019-11-20 01:01:25,271 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 01:01:25,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1833065644] [2019-11-20 01:01:25,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:25,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 8 [2019-11-20 01:01:25,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177719634] [2019-11-20 01:01:25,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:01:25,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:25,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:01:25,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:01:25,273 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 8 states. [2019-11-20 01:01:25,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:25,563 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-20 01:01:25,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:01:25,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-20 01:01:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:25,565 INFO L225 Difference]: With dead ends: 69 [2019-11-20 01:01:25,565 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 01:01:25,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:01:25,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 01:01:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-20 01:01:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-20 01:01:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-11-20 01:01:25,570 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 25 [2019-11-20 01:01:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:25,570 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-11-20 01:01:25,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:01:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-11-20 01:01:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 01:01:25,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:25,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:25,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:25,772 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:25,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2108347266, now seen corresponding path program 1 times [2019-11-20 01:01:25,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:25,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1812405724] [2019-11-20 01:01:25,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:25,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:01:25,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:25,979 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 11 treesize of output 7 [2019-11-20 01:01:25,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:25,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:25,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:25,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-20 01:01:26,013 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 01:01:26,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:26,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:26,016 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 01:01:26,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 01:01:26,025 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 01:01:26,025 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:26,108 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 28 treesize of output 24 [2019-11-20 01:01:26,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 01:01:26,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:26,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 01:01:26,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-11-20 01:01:26,123 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 01:01:26,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1812405724] [2019-11-20 01:01:26,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:26,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 7 [2019-11-20 01:01:26,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103128981] [2019-11-20 01:01:26,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:01:26,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:26,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:01:26,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:01:26,125 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2019-11-20 01:01:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:26,327 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-11-20 01:01:26,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:01:26,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-20 01:01:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:26,329 INFO L225 Difference]: With dead ends: 68 [2019-11-20 01:01:26,329 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 01:01:26,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:01:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 01:01:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-20 01:01:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 01:01:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-11-20 01:01:26,333 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-11-20 01:01:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:26,334 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-11-20 01:01:26,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:01:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-11-20 01:01:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 01:01:26,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:26,335 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:26,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:26,538 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash -934255735, now seen corresponding path program 1 times [2019-11-20 01:01:26,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:26,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1482509989] [2019-11-20 01:01:26,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:26,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 01:01:26,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:26,788 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 11 treesize of output 7 [2019-11-20 01:01:26,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:26,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:26,797 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 01:01:26,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2019-11-20 01:01:26,845 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 01:01:26,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:26,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:26,850 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 01:01:26,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-20 01:01:26,869 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 01:01:26,869 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:27,032 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 28 treesize of output 24 [2019-11-20 01:01:27,033 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:27,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:27,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:27,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2019-11-20 01:01:27,152 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 01:01:27,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1482509989] [2019-11-20 01:01:27,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:27,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 11 [2019-11-20 01:01:27,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605822310] [2019-11-20 01:01:27,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:01:27,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:27,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:01:27,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:01:27,153 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 12 states. [2019-11-20 01:01:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:27,595 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-20 01:01:27,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 01:01:27,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-20 01:01:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:27,597 INFO L225 Difference]: With dead ends: 67 [2019-11-20 01:01:27,597 INFO L226 Difference]: Without dead ends: 67 [2019-11-20 01:01:27,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:01:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-20 01:01:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-20 01:01:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-20 01:01:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-11-20 01:01:27,601 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 27 [2019-11-20 01:01:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:27,601 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-11-20 01:01:27,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:01:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-11-20 01:01:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 01:01:27,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:27,603 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:27,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:27,812 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:27,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:27,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1314824630, now seen corresponding path program 1 times [2019-11-20 01:01:27,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:27,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [345129563] [2019-11-20 01:01:27,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:28,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 01:01:28,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:28,144 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 01:01:28,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,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 01:01:28,160 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-11-20 01:01:28,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:01:28,196 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 01:01:28,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,242 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,242 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 01:01:28,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,262 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 01:01:28,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-11-20 01:01:28,335 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 11 treesize of output 7 [2019-11-20 01:01:28,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,357 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 11 treesize of output 7 [2019-11-20 01:01:28,357 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:28,373 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:43 [2019-11-20 01:01:28,486 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_145|], 3=[|v_#length_93|]} [2019-11-20 01:01:28,497 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-20 01:01:28,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,536 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 40 [2019-11-20 01:01:28,537 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,581 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-20 01:01:28,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:28,582 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:46 [2019-11-20 01:01:28,697 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-20 01:01:28,697 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 24 [2019-11-20 01:01:28,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,738 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-20 01:01:28,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 18 [2019-11-20 01:01:28,738 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:28,771 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:54 [2019-11-20 01:01:28,869 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,869 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 38 treesize of output 30 [2019-11-20 01:01:28,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,902 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 26 treesize of output 22 [2019-11-20 01:01:28,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:28,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:28,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:28,911 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:68, output treesize:20 [2019-11-20 01:01:28,959 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 01:01:28,959 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:29,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:30,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-11-20 01:01:30,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:30,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:30,293 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 72 treesize of output 68 [2019-11-20 01:01:30,293 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:30,403 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 01:01:30,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:30,421 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 46 treesize of output 38 [2019-11-20 01:01:30,424 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:30,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:30,532 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 108 treesize of output 100 [2019-11-20 01:01:30,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:30,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:30,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:30,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:30,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:30,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:30,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:30,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:30,536 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:30,758 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-20 01:01:30,758 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.3 percent of original size [2019-11-20 01:01:30,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:30,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:30,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:30,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-11-20 01:01:30,761 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:104, output treesize:85 [2019-11-20 01:01:30,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:30,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:30,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:31,051 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-20 01:01:31,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:31,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:31,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:31,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:31,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:31,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:31,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:31,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:31,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:31,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:31,314 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:31,314 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 26 treesize of output 30 [2019-11-20 01:01:31,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:31,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:31,335 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 18 treesize of output 22 [2019-11-20 01:01:31,335 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:31,363 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:31,363 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 33 treesize of output 37 [2019-11-20 01:01:31,363 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:31,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:31,398 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 26 treesize of output 30 [2019-11-20 01:01:31,399 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:31,437 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:31,438 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 31 treesize of output 35 [2019-11-20 01:01:31,438 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:31,472 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:31,472 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 20 treesize of output 24 [2019-11-20 01:01:31,473 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:31,758 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-11-20 01:01:31,758 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.2 percent of original size [2019-11-20 01:01:31,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2019-11-20 01:01:31,760 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:155, output treesize:69 [2019-11-20 01:01:32,214 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24 [2019-11-20 01:01:32,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 01:01:32,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:32,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:32,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:32,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:32,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:32,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:32,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:32,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:32,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:33,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:33,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:33,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:33,455 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 01:01:33,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [345129563] [2019-11-20 01:01:33,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:01:33,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-11-20 01:01:33,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635617888] [2019-11-20 01:01:33,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 01:01:33,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:33,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 01:01:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-20 01:01:33,457 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 21 states. [2019-11-20 01:01:34,578 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 54 [2019-11-20 01:01:34,755 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-20 01:01:35,110 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 51 [2019-11-20 01:01:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:38,433 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-11-20 01:01:38,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 01:01:38,434 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-11-20 01:01:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:38,435 INFO L225 Difference]: With dead ends: 73 [2019-11-20 01:01:38,435 INFO L226 Difference]: Without dead ends: 73 [2019-11-20 01:01:38,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-11-20 01:01:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-20 01:01:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-11-20 01:01:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-20 01:01:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-11-20 01:01:38,439 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 28 [2019-11-20 01:01:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:38,440 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-11-20 01:01:38,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 01:01:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-11-20 01:01:38,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 01:01:38,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:38,440 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:38,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:38,641 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:38,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:38,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1314824631, now seen corresponding path program 1 times [2019-11-20 01:01:38,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:38,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1226446157] [2019-11-20 01:01:38,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:38,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 01:01:38,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:38,878 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 01:01:38,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:38,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:38,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:38,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-20 01:01:38,899 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 11 treesize of output 7 [2019-11-20 01:01:38,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:38,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:38,905 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 01:01:38,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-20 01:01:38,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:38,956 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 18 treesize of output 46 [2019-11-20 01:01:38,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:38,976 INFO L567 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-11-20 01:01:38,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:38,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-11-20 01:01:39,034 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-20 01:01:39,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 22 [2019-11-20 01:01:39,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:39,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:39,067 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 01:01:39,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-11-20 01:01:39,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:39,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2019-11-20 01:01:39,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:39,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:39,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:39,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2019-11-20 01:01:39,141 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 01:01:39,141 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:39,313 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 32 treesize of output 28 [2019-11-20 01:01:39,314 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:39,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:39,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:39,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-20 01:01:39,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:39,437 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:39,437 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 17 treesize of output 21 [2019-11-20 01:01:39,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:39,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:39,446 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:39,446 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 17 treesize of output 21 [2019-11-20 01:01:39,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:39,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:39,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:39,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:01:39,468 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2019-11-20 01:01:39,478 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 01:01:39,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:39,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2019-11-20 01:01:39,481 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:39,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:39,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:01:39,486 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-20 01:01:39,491 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 01:01:39,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1226446157] [2019-11-20 01:01:39,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:01:39,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-11-20 01:01:39,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552680711] [2019-11-20 01:01:39,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 01:01:39,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:39,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 01:01:39,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:01:39,492 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 17 states. [2019-11-20 01:01:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:40,654 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-11-20 01:01:40,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 01:01:40,654 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-11-20 01:01:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:40,655 INFO L225 Difference]: With dead ends: 72 [2019-11-20 01:01:40,655 INFO L226 Difference]: Without dead ends: 72 [2019-11-20 01:01:40,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-11-20 01:01:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-20 01:01:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-20 01:01:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-20 01:01:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-20 01:01:40,659 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 28 [2019-11-20 01:01:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:40,660 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-20 01:01:40,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 01:01:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-20 01:01:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 01:01:40,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:40,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:40,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:40,861 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:40,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:40,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1102843360, now seen corresponding path program 1 times [2019-11-20 01:01:40,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:40,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1734196070] [2019-11-20 01:01:40,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:41,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:01:41,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:41,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 5 treesize of output 3 [2019-11-20 01:01:41,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:41,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:41,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:41,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-20 01:01:41,088 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 11 treesize of output 7 [2019-11-20 01:01:41,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:41,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:41,096 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 01:01:41,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-20 01:01:41,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 01:01:41,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:41,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:41,135 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 01:01:41,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 01:01:41,152 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 01:01:41,152 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:41,273 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 32 treesize of output 28 [2019-11-20 01:01:41,273 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:41,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:41,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:01:41,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2019-11-20 01:01:41,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:01:41,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 01:01:41,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:41,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2019-11-20 01:01:41,419 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:41,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:41,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:01:41,426 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-11-20 01:01:41,431 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 01:01:41,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1734196070] [2019-11-20 01:01:41,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:41,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2019-11-20 01:01:41,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658872365] [2019-11-20 01:01:41,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:01:41,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:41,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:01:41,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:01:41,432 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 10 states. [2019-11-20 01:01:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:41,837 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-11-20 01:01:41,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:01:41,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-11-20 01:01:41,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:41,838 INFO L225 Difference]: With dead ends: 69 [2019-11-20 01:01:41,838 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 01:01:41,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:01:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 01:01:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-20 01:01:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-20 01:01:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-11-20 01:01:41,842 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 28 [2019-11-20 01:01:41,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:41,842 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-11-20 01:01:41,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:01:41,842 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-11-20 01:01:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 01:01:41,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:41,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:42,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:42,044 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:42,044 INFO L82 PathProgramCache]: Analyzing trace with hash -171594132, now seen corresponding path program 1 times [2019-11-20 01:01:42,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:42,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1476844066] [2019-11-20 01:01:42,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:42,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 01:01:42,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:42,295 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 01:01:42,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:42,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 01:01:42,332 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 01:01:42,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:42,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2019-11-20 01:01:42,354 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 11 treesize of output 7 [2019-11-20 01:01:42,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:42,365 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 01:01:42,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-20 01:01:42,401 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:42,402 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 15 treesize of output 19 [2019-11-20 01:01:42,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:42,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-20 01:01:42,441 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 16 treesize of output 8 [2019-11-20 01:01:42,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:42,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-11-20 01:01:42,478 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 01:01:42,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,491 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-20 01:01:42,491 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 01:01:42,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-20 01:01:42,523 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 01:01:42,524 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:42,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:42,753 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 8 treesize of output 6 [2019-11-20 01:01:42,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:42,762 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 01:01:42,763 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:42,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-20 01:01:42,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:42,833 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 31 treesize of output 29 [2019-11-20 01:01:42,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:42,847 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 22 treesize of output 26 [2019-11-20 01:01:42,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:42,847 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:42,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:01:42,875 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 31 treesize of output 27 [2019-11-20 01:01:42,875 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,908 INFO L567 ElimStorePlain]: treesize reduction 5, result has 85.7 percent of original size [2019-11-20 01:01:42,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:01:42,909 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:54, output treesize:30 [2019-11-20 01:01:42,955 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 19 treesize of output 17 [2019-11-20 01:01:42,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,961 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 16 [2019-11-20 01:01:42,961 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,966 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 18 treesize of output 16 [2019-11-20 01:01:42,966 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:01:42,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:01:42,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-11-20 01:01:42,986 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:56, output treesize:38 [2019-11-20 01:01:43,026 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 01:01:43,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1476844066] [2019-11-20 01:01:43,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:43,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-20 01:01:43,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213409240] [2019-11-20 01:01:43,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 01:01:43,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:43,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 01:01:43,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:01:43,028 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 14 states. [2019-11-20 01:01:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:47,569 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-11-20 01:01:47,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 01:01:47,569 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-11-20 01:01:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:47,570 INFO L225 Difference]: With dead ends: 86 [2019-11-20 01:01:47,570 INFO L226 Difference]: Without dead ends: 86 [2019-11-20 01:01:47,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-11-20 01:01:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-20 01:01:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2019-11-20 01:01:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 01:01:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-11-20 01:01:47,573 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2019-11-20 01:01:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:47,574 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-11-20 01:01:47,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 01:01:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-11-20 01:01:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 01:01:47,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:47,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:47,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:47,779 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:47,779 INFO L82 PathProgramCache]: Analyzing trace with hash -171594131, now seen corresponding path program 1 times [2019-11-20 01:01:47,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:47,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1211408369] [2019-11-20 01:01:47,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:01:47,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:01:47,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:47,934 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 01:01:47,934 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:01:47,943 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 01:01:47,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1211408369] [2019-11-20 01:01:47,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:01:47,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:01:47,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372061948] [2019-11-20 01:01:47,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:01:47,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:01:47,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:01:47,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:01:47,944 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 3 states. [2019-11-20 01:01:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:48,041 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-20 01:01:48,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:01:48,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-20 01:01:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:48,042 INFO L225 Difference]: With dead ends: 63 [2019-11-20 01:01:48,042 INFO L226 Difference]: Without dead ends: 63 [2019-11-20 01:01:48,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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 01:01:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-20 01:01:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-20 01:01:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-20 01:01:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-20 01:01:48,046 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 29 [2019-11-20 01:01:48,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:48,046 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-20 01:01:48,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:01:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-20 01:01:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 01:01:48,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:01:48,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:01:48,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:48,250 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 01:01:48,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:01:48,251 INFO L82 PathProgramCache]: Analyzing trace with hash 624655538, now seen corresponding path program 1 times [2019-11-20 01:01:48,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:01:48,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2079269536] [2019-11-20 01:01:48,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdc91fd9-b83e-4832-a2df-a8adb6fc8e7d/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 01:01:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:01:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:01:48,724 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 01:01:48,725 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 01:01:48,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:01:48,945 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-20 01:01:48,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:01:48 BoogieIcfgContainer [2019-11-20 01:01:48,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:01:48,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:01:48,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:01:48,961 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:01:48,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:01:11" (3/4) ... [2019-11-20 01:01:48,965 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 01:01:48,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:01:48,966 INFO L168 Benchmark]: Toolchain (without parser) took 38890.37 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 356.0 MB). Free memory was 944.8 MB in the beginning and 1.3 GB in the end (delta: -372.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:01:48,966 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:01:48,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -218.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:48,967 INFO L168 Benchmark]: Boogie Preprocessor took 91.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:01:48,967 INFO L168 Benchmark]: RCFGBuilder took 801.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:48,967 INFO L168 Benchmark]: TraceAbstraction took 37455.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -215.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:01:48,967 INFO L168 Benchmark]: Witness Printer took 3.87 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:01:48,968 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 534.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -218.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 801.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37455.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -215.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.87 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 526]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 526. Possible FailurePath: [L528] struct item *list = ((void *)0); VAL [list={1877082112:0}] [L530] CALL append(&list) VAL [plist={1877082112:0}] [L519] struct item *item = malloc(sizeof *item); VAL [item={270464763:0}, malloc(sizeof *item)={270464763:0}, plist={1877082112:0}, plist={1877082112:0}] [L520] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={270464763:0}, malloc(sizeof *item)={270464763:0}, plist={1877082112:0}, plist={1877082112:0}] [L520] item->next = *plist VAL [\read(**plist)={0:0}, item={270464763:0}, malloc(sizeof *item)={270464763:0}, plist={1877082112:0}, plist={1877082112:0}] [L521] EXPR item->next VAL [item={270464763:0}, item->next={0:0}, malloc(sizeof *item)={270464763:0}, plist={1877082112:0}, plist={1877082112:0}] [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1343094784:0}, item={270464763:0}, item->next={0:0}, malloc(sizeof *item)={270464763:0}, malloc(sizeof *item)={-1343094784:0}, plist={1877082112:0}, plist={1877082112:0}] [L521-L523] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1343094784:0}, item={270464763:0}, item->next={0:0}, malloc(sizeof *item)={270464763:0}, malloc(sizeof *item)={-1343094784:0}, plist={1877082112:0}, plist={1877082112:0}] [L524] *plist = item VAL [item={270464763:0}, malloc(sizeof *item)={270464763:0}, malloc(sizeof *item)={-1343094784:0}, plist={1877082112:0}, plist={1877082112:0}] [L530] RET append(&list) VAL [list={1877082112:0}] [L531] COND FALSE !(__VERIFIER_nondet_int()) [L532] \read(*list) VAL [\read(*list)={270464763:0}, list={1877082112:0}] [L532] COND TRUE \read(*list) [L533] EXPR \read(*list) VAL [\read(*list)={270464763:0}, list={1877082112:0}] [L533] EXPR list->next VAL [\read(*list)={270464763:0}, list={1877082112:0}, list->next={0:0}] [L533] struct item *next = list->next; [L534] EXPR \read(*list) VAL [\read(*list)={270464763:0}, list={1877082112:0}, next={0:0}] [L534] free(list) VAL [\read(*list)={270464763:0}, list={1877082112:0}, next={0:0}] [L534] free(list) VAL [\read(*list)={270464763:0}, list={1877082112:0}, next={0:0}] [L534] free(list) [L535] list = next VAL [list={1877082112:0}, next={0:0}] [L537] \read(*list) VAL [\read(*list)={0:0}, list={1877082112:0}, next={0:0}] [L537] COND FALSE !(\read(*list)) [L542] return 0; [L528] struct item *list = ((void *)0); [L542] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 103 locations, 41 error locations. Result: UNSAFE, OverallTime: 37.3s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 717 SDtfs, 1156 SDslu, 2345 SDs, 0 SdLazy, 3021 SolverSat, 183 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 499 SyntacticMatches, 16 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 68 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 622 ConstructedInterpolants, 56 QuantifiedInterpolants, 157007 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1600 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...