./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 170d05f666fe960395aa4fb943b7fdfa4284d519 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 03:56:08,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:56:08,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:56:08,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:56:08,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:56:08,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:56:08,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:56:08,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:56:08,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:56:08,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:56:08,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:56:08,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:56:08,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:56:08,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:56:08,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:56:08,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:56:08,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:56:08,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:56:08,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:56:08,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:56:08,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:56:08,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:56:08,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:56:08,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:56:08,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:56:08,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:56:08,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:56:08,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:56:08,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:56:08,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:56:08,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:56:08,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:56:08,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:56:08,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:56:08,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:56:08,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:56:08,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:56:08,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:56:08,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:56:08,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:56:08,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:56:08,996 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 03:56:09,022 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:56:09,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:56:09,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:56:09,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:56:09,034 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:56:09,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:56:09,034 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:56:09,035 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 03:56:09,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:56:09,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:56:09,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:56:09,036 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 03:56:09,036 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 03:56:09,036 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 03:56:09,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:56:09,037 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 03:56:09,037 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 03:56:09,037 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:56:09,037 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:56:09,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:56:09,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:56:09,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:56:09,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:56:09,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:56:09,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:56:09,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:56:09,041 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 03:56:09,041 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 03:56:09,041 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 03:56:09,041 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_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 -> 170d05f666fe960395aa4fb943b7fdfa4284d519 [2019-11-20 03:56:09,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:56:09,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:56:09,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:56:09,231 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:56:09,232 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:56:09,233 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i [2019-11-20 03:56:09,296 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/data/1c4570327/e2d0a04a787d4062b6292979c3729ff2/FLAGc4bbaf878 [2019-11-20 03:56:09,724 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:56:09,725 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i [2019-11-20 03:56:09,745 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/data/1c4570327/e2d0a04a787d4062b6292979c3729ff2/FLAGc4bbaf878 [2019-11-20 03:56:10,026 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/data/1c4570327/e2d0a04a787d4062b6292979c3729ff2 [2019-11-20 03:56:10,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:56:10,030 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 03:56:10,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:56:10,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:56:10,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:56:10,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:56:10" (1/1) ... [2019-11-20 03:56:10,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139efc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:10, skipping insertion in model container [2019-11-20 03:56:10,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:56:10" (1/1) ... [2019-11-20 03:56:10,047 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:56:10,093 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:56:10,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:56:10,668 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:56:10,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:56:10,792 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:56:10,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:10 WrapperNode [2019-11-20 03:56:10,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:56:10,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:56:10,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:56:10,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:56:10,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:10" (1/1) ... [2019-11-20 03:56:10,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:10" (1/1) ... [2019-11-20 03:56:10,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:10" (1/1) ... [2019-11-20 03:56:10,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:10" (1/1) ... [2019-11-20 03:56:10,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:10" (1/1) ... [2019-11-20 03:56:10,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:10" (1/1) ... [2019-11-20 03:56:10,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:10" (1/1) ... [2019-11-20 03:56:10,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:56:10,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:56:10,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:56:10,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:56:10,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:10,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 03:56:10,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:56:10,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 03:56:10,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 03:56:10,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 03:56:10,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 03:56:10,932 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 03:56:10,932 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncat [2019-11-20 03:56:10,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 03:56:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 03:56:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 03:56:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 03:56:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 03:56:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 03:56:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 03:56:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 03:56:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 03:56:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 03:56:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 03:56:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 03:56:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 03:56:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 03:56:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 03:56:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 03:56:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 03:56:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 03:56:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 03:56:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 03:56:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 03:56:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 03:56:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 03:56:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 03:56:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 03:56:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 03:56:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 03:56:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 03:56:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 03:56:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 03:56:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 03:56:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 03:56:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 03:56:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 03:56:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 03:56:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 03:56:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 03:56:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 03:56:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 03:56:10,940 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 03:56:10,940 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 03:56:10,940 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 03:56:10,940 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 03:56:10,940 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 03:56:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 03:56:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 03:56:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 03:56:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 03:56:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 03:56:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 03:56:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 03:56:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 03:56:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 03:56:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 03:56:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 03:56:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 03:56:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 03:56:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 03:56:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 03:56:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 03:56:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 03:56:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 03:56:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 03:56:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 03:56:10,945 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 03:56:10,945 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 03:56:10,945 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 03:56:10,945 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 03:56:10,945 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 03:56:10,946 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 03:56:10,946 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 03:56:10,946 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 03:56:10,946 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 03:56:10,947 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 03:56:10,947 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 03:56:10,947 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 03:56:10,947 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 03:56:10,947 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 03:56:10,947 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 03:56:10,948 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 03:56:10,948 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 03:56:10,948 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 03:56:10,948 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 03:56:10,948 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 03:56:10,949 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 03:56:10,949 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 03:56:10,949 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 03:56:10,949 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 03:56:10,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 03:56:10,949 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 03:56:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 03:56:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 03:56:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 03:56:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 03:56:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 03:56:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 03:56:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 03:56:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 03:56:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 03:56:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 03:56:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 03:56:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 03:56:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 03:56:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 03:56:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 03:56:10,953 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 03:56:10,953 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 03:56:10,953 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 03:56:10,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 03:56:10,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-20 03:56:10,954 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncat [2019-11-20 03:56:10,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-20 03:56:10,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-20 03:56:10,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 03:56:10,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:56:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 03:56:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 03:56:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:56:11,742 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:56:11,742 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 03:56:11,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:56:11 BoogieIcfgContainer [2019-11-20 03:56:11,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:56:11,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:56:11,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:56:11,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:56:11,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:56:10" (1/3) ... [2019-11-20 03:56:11,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29326cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:56:11, skipping insertion in model container [2019-11-20 03:56:11,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:56:10" (2/3) ... [2019-11-20 03:56:11,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29326cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:56:11, skipping insertion in model container [2019-11-20 03:56:11,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:56:11" (3/3) ... [2019-11-20 03:56:11,752 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrncat-alloca-2.i [2019-11-20 03:56:11,762 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:56:11,769 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-20 03:56:11,791 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-20 03:56:11,809 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:56:11,809 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 03:56:11,810 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:56:11,810 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:56:11,810 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:56:11,810 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:56:11,810 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:56:11,811 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:56:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-11-20 03:56:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 03:56:11,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:11,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:11,836 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:11,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:11,842 INFO L82 PathProgramCache]: Analyzing trace with hash 979041190, now seen corresponding path program 1 times [2019-11-20 03:56:11,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:11,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1953156163] [2019-11-20 03:56:11,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:12,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:56:12,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:12,073 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 03:56:12,074 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:12,088 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 03:56:12,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1953156163] [2019-11-20 03:56:12,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:12,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 03:56:12,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879274112] [2019-11-20 03:56:12,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:56:12,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:12,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:56:12,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:12,110 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2019-11-20 03:56:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:12,275 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-11-20 03:56:12,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:56:12,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-20 03:56:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:12,285 INFO L225 Difference]: With dead ends: 62 [2019-11-20 03:56:12,285 INFO L226 Difference]: Without dead ends: 58 [2019-11-20 03:56:12,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-20 03:56:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-20 03:56:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-20 03:56:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2019-11-20 03:56:12,320 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 11 [2019-11-20 03:56:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:12,321 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-11-20 03:56:12,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:56:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2019-11-20 03:56:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 03:56:12,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:12,322 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:12,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:12,529 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:12,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash 285505728, now seen corresponding path program 1 times [2019-11-20 03:56:12,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:12,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [187041168] [2019-11-20 03:56:12,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:12,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:56:12,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:12,829 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 03:56:12,829 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:13,097 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 03:56:13,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [187041168] [2019-11-20 03:56:13,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:13,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 03:56:13,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789828533] [2019-11-20 03:56:13,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:56:13,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:13,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:56:13,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:56:13,100 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 8 states. [2019-11-20 03:56:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:13,548 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2019-11-20 03:56:13,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:56:13,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-11-20 03:56:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:13,555 INFO L225 Difference]: With dead ends: 63 [2019-11-20 03:56:13,556 INFO L226 Difference]: Without dead ends: 58 [2019-11-20 03:56:13,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:56:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-20 03:56:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-20 03:56:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-20 03:56:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2019-11-20 03:56:13,569 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 12 [2019-11-20 03:56:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:13,569 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2019-11-20 03:56:13,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:56:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2019-11-20 03:56:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 03:56:13,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:13,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:13,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:13,776 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:13,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash 342764030, now seen corresponding path program 1 times [2019-11-20 03:56:13,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:13,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [118602083] [2019-11-20 03:56:13,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:14,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:56:14,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:14,054 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_25|], 1=[|v_#valid_40|]} [2019-11-20 03:56:14,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:14,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:56:14,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:14,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:14,129 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 03:56:14,130 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:14,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:14,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:56:14,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-11-20 03:56:14,175 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 03:56:14,176 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:14,285 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 03:56:14,299 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 03:56:14,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:14,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:14,319 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:56:14,320 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:14,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:14,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:56:14,330 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-11-20 03:56:14,340 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 03:56:14,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [118602083] [2019-11-20 03:56:14,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:14,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 03:56:14,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282095571] [2019-11-20 03:56:14,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:56:14,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:14,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:56:14,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:56:14,342 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 5 states. [2019-11-20 03:56:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:14,831 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-11-20 03:56:14,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:56:14,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-20 03:56:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:14,835 INFO L225 Difference]: With dead ends: 80 [2019-11-20 03:56:14,835 INFO L226 Difference]: Without dead ends: 80 [2019-11-20 03:56:14,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:56:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-20 03:56:14,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2019-11-20 03:56:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 03:56:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-11-20 03:56:14,847 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 12 [2019-11-20 03:56:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:14,848 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-11-20 03:56:14,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:56:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-11-20 03:56:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 03:56:14,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:14,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:15,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:15,052 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash 342764029, now seen corresponding path program 1 times [2019-11-20 03:56:15,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:15,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [141534554] [2019-11-20 03:56:15,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:15,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:56:15,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:15,290 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 03:56:15,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:56:15,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:15,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:15,298 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 03:56:15,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 03:56:15,308 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 03:56:15,308 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:15,318 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 03:56:15,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [141534554] [2019-11-20 03:56:15,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:15,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 03:56:15,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224124827] [2019-11-20 03:56:15,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:56:15,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:15,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:56:15,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:15,320 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 3 states. [2019-11-20 03:56:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:15,422 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2019-11-20 03:56:15,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:56:15,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-20 03:56:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:15,424 INFO L225 Difference]: With dead ends: 58 [2019-11-20 03:56:15,424 INFO L226 Difference]: Without dead ends: 58 [2019-11-20 03:56:15,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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 03:56:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-20 03:56:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-20 03:56:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-20 03:56:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2019-11-20 03:56:15,430 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 12 [2019-11-20 03:56:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:15,431 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-11-20 03:56:15,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:56:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2019-11-20 03:56:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 03:56:15,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:15,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:15,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:15,634 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:15,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1316298315, now seen corresponding path program 1 times [2019-11-20 03:56:15,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:15,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2145375550] [2019-11-20 03:56:15,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:15,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 03:56:15,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:15,891 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_50|]} [2019-11-20 03:56:15,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:15,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:56:15,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:15,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:15,977 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 03:56:15,977 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:16,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:16,017 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 03:56:16,017 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:32 [2019-11-20 03:56:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:16,179 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:16,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:56:16,554 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 03:56:16,602 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 37 treesize of output 35 [2019-11-20 03:56:16,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:16,771 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-11-20 03:56:16,772 INFO L567 ElimStorePlain]: treesize reduction 31, result has 59.7 percent of original size [2019-11-20 03:56:16,779 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:56:16,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:16,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:16,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 03:56:16,830 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:83, output treesize:35 [2019-11-20 03:56:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:17,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2145375550] [2019-11-20 03:56:17,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:17,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 03:56:17,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740377633] [2019-11-20 03:56:17,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 03:56:17,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:17,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 03:56:17,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:56:17,015 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 9 states. [2019-11-20 03:56:17,828 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-11-20 03:56:18,307 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-11-20 03:56:18,914 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-11-20 03:56:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:19,841 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2019-11-20 03:56:19,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:56:19,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-11-20 03:56:19,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:19,843 INFO L225 Difference]: With dead ends: 108 [2019-11-20 03:56:19,844 INFO L226 Difference]: Without dead ends: 108 [2019-11-20 03:56:19,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-11-20 03:56:19,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-20 03:56:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 64. [2019-11-20 03:56:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-20 03:56:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-20 03:56:19,851 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 14 [2019-11-20 03:56:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:19,852 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-20 03:56:19,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 03:56:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-11-20 03:56:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 03:56:19,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:19,852 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:20,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:20,053 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:20,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1316298263, now seen corresponding path program 1 times [2019-11-20 03:56:20,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:20,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [315148698] [2019-11-20 03:56:20,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:20,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:56:20,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:20,205 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 03:56:20,205 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:20,238 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 03:56:20,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [315148698] [2019-11-20 03:56:20,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:20,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:56:20,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71868311] [2019-11-20 03:56:20,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:56:20,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:20,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:56:20,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:56:20,240 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 6 states. [2019-11-20 03:56:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:20,313 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2019-11-20 03:56:20,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:56:20,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-20 03:56:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:20,314 INFO L225 Difference]: With dead ends: 87 [2019-11-20 03:56:20,314 INFO L226 Difference]: Without dead ends: 87 [2019-11-20 03:56:20,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:56:20,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-20 03:56:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-11-20 03:56:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-20 03:56:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2019-11-20 03:56:20,321 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 14 [2019-11-20 03:56:20,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:20,322 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2019-11-20 03:56:20,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:56:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2019-11-20 03:56:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 03:56:20,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:20,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:20,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:20,527 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:20,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:20,528 INFO L82 PathProgramCache]: Analyzing trace with hash 458709099, now seen corresponding path program 1 times [2019-11-20 03:56:20,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:20,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1381115656] [2019-11-20 03:56:20,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:20,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:56:20,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:20,714 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 03:56:20,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:56:20,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:20,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:20,720 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 03:56:20,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 03:56:20,729 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 03:56:20,729 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:20,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1381115656] [2019-11-20 03:56:20,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:20,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 03:56:20,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43054986] [2019-11-20 03:56:20,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:56:20,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:56:20,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:56:20,744 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 3 states. [2019-11-20 03:56:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:20,814 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2019-11-20 03:56:20,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:56:20,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-20 03:56:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:20,815 INFO L225 Difference]: With dead ends: 74 [2019-11-20 03:56:20,816 INFO L226 Difference]: Without dead ends: 74 [2019-11-20 03:56:20,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 03:56:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-20 03:56:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-20 03:56:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 03:56:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2019-11-20 03:56:20,822 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 14 [2019-11-20 03:56:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:20,823 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2019-11-20 03:56:20,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:56:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2019-11-20 03:56:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 03:56:20,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:20,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:21,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:21,027 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:21,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:21,027 INFO L82 PathProgramCache]: Analyzing trace with hash 458709100, now seen corresponding path program 1 times [2019-11-20 03:56:21,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:21,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [158650561] [2019-11-20 03:56:21,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:21,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:56:21,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:21,226 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:21,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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:56:21,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:21,268 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 03:56:21,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:56:21,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-11-20 03:56:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:21,321 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:21,463 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 03:56:21,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [158650561] [2019-11-20 03:56:21,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:21,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:56:21,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555095567] [2019-11-20 03:56:21,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:56:21,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:21,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:56:21,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:56:21,465 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand 7 states. [2019-11-20 03:56:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:21,973 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2019-11-20 03:56:21,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:56:21,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-20 03:56:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:21,975 INFO L225 Difference]: With dead ends: 91 [2019-11-20 03:56:21,975 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 03:56:21,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:56:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 03:56:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2019-11-20 03:56:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-20 03:56:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2019-11-20 03:56:21,981 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 14 [2019-11-20 03:56:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:21,982 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2019-11-20 03:56:21,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:56:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2019-11-20 03:56:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 03:56:21,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:21,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:22,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:22,186 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:22,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2144425259, now seen corresponding path program 1 times [2019-11-20 03:56:22,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:22,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [648571803] [2019-11-20 03:56:22,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:22,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:56:22,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:22,397 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:22,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:56:22,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:22,442 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-20 03:56:22,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:56:22,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-11-20 03:56:22,460 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 03:56:22,460 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:22,559 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 03:56:22,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [648571803] [2019-11-20 03:56:22,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:22,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 03:56:22,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960903726] [2019-11-20 03:56:22,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:56:22,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:22,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:56:22,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:56:22,560 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 6 states. [2019-11-20 03:56:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:22,917 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2019-11-20 03:56:22,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:56:22,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-20 03:56:22,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:22,919 INFO L225 Difference]: With dead ends: 86 [2019-11-20 03:56:22,919 INFO L226 Difference]: Without dead ends: 86 [2019-11-20 03:56:22,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:56:22,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-20 03:56:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2019-11-20 03:56:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-20 03:56:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2019-11-20 03:56:22,924 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 15 [2019-11-20 03:56:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:22,924 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2019-11-20 03:56:22,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:56:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2019-11-20 03:56:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 03:56:22,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:22,925 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:23,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:23,126 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:23,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2101240641, now seen corresponding path program 1 times [2019-11-20 03:56:23,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:23,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1078654159] [2019-11-20 03:56:23,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:23,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 03:56:23,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:23,373 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_72|]} [2019-11-20 03:56:23,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:23,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:23,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:56:23,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:23,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:23,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:23,448 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 03:56:23,449 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:23,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:23,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 03:56:23,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:31 [2019-11-20 03:56:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:23,629 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:24,060 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 03:56:24,070 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 03:56:24,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:24,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:24,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:56:24,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:24,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:24,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:56:24,116 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:14 [2019-11-20 03:56:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:24,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1078654159] [2019-11-20 03:56:24,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:24,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-20 03:56:24,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630086118] [2019-11-20 03:56:24,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:56:24,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:24,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:56:24,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:56:24,286 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 12 states. [2019-11-20 03:56:24,638 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-11-20 03:56:25,224 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-11-20 03:56:26,007 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-11-20 03:56:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:27,061 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2019-11-20 03:56:27,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 03:56:27,063 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-11-20 03:56:27,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:27,064 INFO L225 Difference]: With dead ends: 131 [2019-11-20 03:56:27,064 INFO L226 Difference]: Without dead ends: 131 [2019-11-20 03:56:27,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-11-20 03:56:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-20 03:56:27,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 85. [2019-11-20 03:56:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 03:56:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-11-20 03:56:27,072 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 16 [2019-11-20 03:56:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:27,073 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-11-20 03:56:27,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:56:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-11-20 03:56:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:56:27,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:27,074 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:27,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:27,277 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:27,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:27,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1229403463, now seen corresponding path program 1 times [2019-11-20 03:56:27,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:27,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1182265327] [2019-11-20 03:56:27,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:27,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:56:27,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:27,447 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 03:56:27,447 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:27,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-20 03:56:27,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:27,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:27,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:56:27,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2019-11-20 03:56:27,462 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 03:56:27,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1182265327] [2019-11-20 03:56:27,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:27,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 03:56:27,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277560011] [2019-11-20 03:56:27,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:56:27,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:27,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:56:27,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:56:27,464 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 5 states. [2019-11-20 03:56:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:27,601 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2019-11-20 03:56:27,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:56:27,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-20 03:56:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:27,602 INFO L225 Difference]: With dead ends: 81 [2019-11-20 03:56:27,602 INFO L226 Difference]: Without dead ends: 81 [2019-11-20 03:56:27,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:56:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-20 03:56:27,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-11-20 03:56:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-20 03:56:27,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2019-11-20 03:56:27,607 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 18 [2019-11-20 03:56:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:27,607 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2019-11-20 03:56:27,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:56:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2019-11-20 03:56:27,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:56:27,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:27,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:27,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:27,809 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:27,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:27,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1229403464, now seen corresponding path program 1 times [2019-11-20 03:56:27,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:27,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1743992990] [2019-11-20 03:56:27,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:27,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 03:56:27,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:28,266 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 03:56:28,266 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:28,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:56:28,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-11-20 03:56:28,539 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 03:56:28,563 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 25 treesize of output 23 [2019-11-20 03:56:28,564 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 03:56:28,577 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 27 treesize of output 23 [2019-11-20 03:56:28,578 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 03:56:28,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:28,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-20 03:56:28,664 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:76, output treesize:68 [2019-11-20 03:56:28,990 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-11-20 03:56:29,260 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 03:56:29,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1743992990] [2019-11-20 03:56:29,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:56:29,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-20 03:56:29,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197999187] [2019-11-20 03:56:29,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:56:29,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:29,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:56:29,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:56:29,261 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 12 states. [2019-11-20 03:56:29,960 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 03:56:31,400 WARN L191 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-20 03:56:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:34,018 INFO L93 Difference]: Finished difference Result 142 states and 170 transitions. [2019-11-20 03:56:34,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 03:56:34,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-20 03:56:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:34,023 INFO L225 Difference]: With dead ends: 142 [2019-11-20 03:56:34,024 INFO L226 Difference]: Without dead ends: 142 [2019-11-20 03:56:34,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-20 03:56:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-20 03:56:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2019-11-20 03:56:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-20 03:56:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2019-11-20 03:56:34,030 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 18 [2019-11-20 03:56:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:34,030 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2019-11-20 03:56:34,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:56:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2019-11-20 03:56:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:56:34,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:34,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:34,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:34,235 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash 657577528, now seen corresponding path program 1 times [2019-11-20 03:56:34,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:34,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1240198989] [2019-11-20 03:56:34,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:34,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 03:56:34,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:34,505 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_39|], 1=[|v_#valid_84|]} [2019-11-20 03:56:34,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:34,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:34,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:56:34,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:34,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:34,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:34,581 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 03:56:34,582 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:34,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:34,622 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 03:56:34,623 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2019-11-20 03:56:34,839 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-11-20 03:56:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:35,159 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:35,989 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-20 03:56:36,382 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-11-20 03:56:36,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:56:36,391 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 03:56:36,418 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 57 treesize of output 55 [2019-11-20 03:56:36,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:36,428 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:56:36,437 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:56:36,437 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:36,445 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:56:36,456 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:56:36,457 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:36,749 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-11-20 03:56:36,749 INFO L567 ElimStorePlain]: treesize reduction 8, result has 84.3 percent of original size [2019-11-20 03:56:36,755 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:56:36,756 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:36,857 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-20 03:56:36,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:36,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:56:36,859 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:161, output treesize:24 [2019-11-20 03:56:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:37,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1240198989] [2019-11-20 03:56:37,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:37,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2019-11-20 03:56:37,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025732118] [2019-11-20 03:56:37,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 03:56:37,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:37,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 03:56:37,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-20 03:56:37,186 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand 15 states. [2019-11-20 03:56:37,702 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-11-20 03:56:38,755 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-11-20 03:56:39,565 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-11-20 03:56:40,154 WARN L191 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-20 03:56:40,838 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-20 03:56:41,354 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-11-20 03:56:41,507 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-11-20 03:56:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:43,267 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2019-11-20 03:56:43,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 03:56:43,269 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-20 03:56:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:43,270 INFO L225 Difference]: With dead ends: 119 [2019-11-20 03:56:43,270 INFO L226 Difference]: Without dead ends: 119 [2019-11-20 03:56:43,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-11-20 03:56:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-20 03:56:43,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2019-11-20 03:56:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 03:56:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2019-11-20 03:56:43,275 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 18 [2019-11-20 03:56:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:43,276 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2019-11-20 03:56:43,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 03:56:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2019-11-20 03:56:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:56:43,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:43,277 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:43,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:43,478 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1979129647, now seen corresponding path program 1 times [2019-11-20 03:56:43,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:43,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [967095472] [2019-11-20 03:56:43,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:43,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 03:56:43,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:43,670 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:43,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:56:43,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:43,702 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 03:56:43,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:56:43,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 03:56:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:43,819 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:44,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [967095472] [2019-11-20 03:56:44,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:44,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-20 03:56:44,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925586285] [2019-11-20 03:56:44,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:56:44,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:44,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:56:44,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:56:44,429 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand 12 states. [2019-11-20 03:56:45,399 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2019-11-20 03:56:45,613 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-11-20 03:56:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:46,315 INFO L93 Difference]: Finished difference Result 112 states and 135 transitions. [2019-11-20 03:56:46,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:56:46,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-20 03:56:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:46,318 INFO L225 Difference]: With dead ends: 112 [2019-11-20 03:56:46,318 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 03:56:46,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2019-11-20 03:56:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 03:56:46,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 80. [2019-11-20 03:56:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-20 03:56:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2019-11-20 03:56:46,323 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 18 [2019-11-20 03:56:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:46,323 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2019-11-20 03:56:46,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:56:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2019-11-20 03:56:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 03:56:46,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:46,325 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] [2019-11-20 03:56:46,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:46,525 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:46,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:46,526 INFO L82 PathProgramCache]: Analyzing trace with hash 340721217, now seen corresponding path program 1 times [2019-11-20 03:56:46,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:46,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1414838116] [2019-11-20 03:56:46,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:56:46,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 03:56:46,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:46,806 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_43|], 1=[|v_#valid_93|]} [2019-11-20 03:56:46,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:46,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:46,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:56:46,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:46,929 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-11-20 03:56:46,930 INFO L567 ElimStorePlain]: treesize reduction 4, result has 90.2 percent of original size [2019-11-20 03:56:46,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:46,940 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 03:56:46,940 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:46,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:46,972 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 03:56:46,972 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-11-20 03:56:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:47,426 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:48,177 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 03:56:48,196 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 03:56:48,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:48,281 INFO L567 ElimStorePlain]: treesize reduction 3, result has 94.9 percent of original size [2019-11-20 03:56:48,284 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:56:48,285 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:48,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:48,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:56:48,327 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:29 [2019-11-20 03:56:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:48,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1414838116] [2019-11-20 03:56:48,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:48,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-11-20 03:56:48,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286850535] [2019-11-20 03:56:48,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 03:56:48,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:48,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 03:56:48,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-11-20 03:56:48,489 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 17 states. [2019-11-20 03:56:49,396 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-20 03:56:49,983 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-20 03:56:50,895 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-20 03:56:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:56:53,122 INFO L93 Difference]: Finished difference Result 177 states and 218 transitions. [2019-11-20 03:56:53,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 03:56:53,125 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-11-20 03:56:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:56:53,127 INFO L225 Difference]: With dead ends: 177 [2019-11-20 03:56:53,127 INFO L226 Difference]: Without dead ends: 177 [2019-11-20 03:56:53,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2019-11-20 03:56:53,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-20 03:56:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 88. [2019-11-20 03:56:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-20 03:56:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2019-11-20 03:56:53,147 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 20 [2019-11-20 03:56:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:56:53,147 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2019-11-20 03:56:53,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 03:56:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2019-11-20 03:56:53,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 03:56:53,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:56:53,151 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:56:53,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:56:53,354 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:56:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:56:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash 620380932, now seen corresponding path program 2 times [2019-11-20 03:56:53,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:56:53,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1944036721] [2019-11-20 03:56:53,355 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:56:53,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:56:53,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:56:53,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 03:56:53,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:56:53,585 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_45|], 1=[|v_#valid_98|]} [2019-11-20 03:56:53,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:53,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:53,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:56:53,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:53,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:53,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:56:53,670 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 03:56:53,670 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:53,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:53,710 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 03:56:53,710 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2019-11-20 03:56:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:54,063 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:56:54,881 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 03:56:54,897 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 03:56:54,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:54,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:54,939 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:56:54,940 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:56:54,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:56:54,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:56:54,968 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:18 [2019-11-20 03:56:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:56:55,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1944036721] [2019-11-20 03:56:55,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:56:55,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-20 03:56:55,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014745428] [2019-11-20 03:56:55,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 03:56:55,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:56:55,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 03:56:55,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-20 03:56:55,718 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand 16 states. [2019-11-20 03:56:56,504 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 03:56:59,411 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 03:56:59,870 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 03:57:00,432 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-11-20 03:57:01,159 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 03:57:01,403 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-20 03:57:01,702 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-20 03:57:02,799 WARN L191 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-11-20 03:57:03,615 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 03:57:04,191 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-11-20 03:57:04,674 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-20 03:57:05,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:57:05,284 INFO L93 Difference]: Finished difference Result 171 states and 200 transitions. [2019-11-20 03:57:05,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 03:57:05,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-11-20 03:57:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:57:05,288 INFO L225 Difference]: With dead ends: 171 [2019-11-20 03:57:05,288 INFO L226 Difference]: Without dead ends: 171 [2019-11-20 03:57:05,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=334, Invalid=658, Unknown=0, NotChecked=0, Total=992 [2019-11-20 03:57:05,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-20 03:57:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 108. [2019-11-20 03:57:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 03:57:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2019-11-20 03:57:05,293 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 20 [2019-11-20 03:57:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:57:05,293 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2019-11-20 03:57:05,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 03:57:05,294 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2019-11-20 03:57:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 03:57:05,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:57:05,294 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] [2019-11-20 03:57:05,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:57:05,497 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:57:05,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:57:05,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1015527953, now seen corresponding path program 1 times [2019-11-20 03:57:05,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:57:05,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1561585566] [2019-11-20 03:57:05,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/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 03:57:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:57:05,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:57:05,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:57:05,686 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 03:57:05,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:57:05,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:05,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:05,691 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 03:57:05,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 03:57:05,722 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 03:57:05,722 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:57:05,751 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 03:57:05,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1561585566] [2019-11-20 03:57:05,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:57:05,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [] total 6 [2019-11-20 03:57:05,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20065477] [2019-11-20 03:57:05,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:57:05,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:57:05,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:57:05,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:57:05,752 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand 7 states. [2019-11-20 03:57:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:57:05,896 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2019-11-20 03:57:05,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:57:05,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-20 03:57:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:57:05,897 INFO L225 Difference]: With dead ends: 109 [2019-11-20 03:57:05,898 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 03:57:05,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:57:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 03:57:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-11-20 03:57:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 03:57:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 134 transitions. [2019-11-20 03:57:05,901 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 134 transitions. Word has length 22 [2019-11-20 03:57:05,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:57:05,902 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 134 transitions. [2019-11-20 03:57:05,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:57:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2019-11-20 03:57:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 03:57:05,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:57:05,903 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] [2019-11-20 03:57:06,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:57:06,103 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:57:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:57:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1015527954, now seen corresponding path program 1 times [2019-11-20 03:57:06,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:57:06,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1151480978] [2019-11-20 03:57:06,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:57:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:57:06,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 03:57:06,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:57:06,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:06,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:57:06,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:06,337 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-20 03:57:06,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:06,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-20 03:57:06,385 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 03:57:06,385 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:57:06,581 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 03:57:06,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1151480978] [2019-11-20 03:57:06,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:57:06,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-20 03:57:06,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645630828] [2019-11-20 03:57:06,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:57:06,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:57:06,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:57:06,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:57:06,582 INFO L87 Difference]: Start difference. First operand 107 states and 134 transitions. Second operand 12 states. [2019-11-20 03:57:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:57:07,511 INFO L93 Difference]: Finished difference Result 189 states and 238 transitions. [2019-11-20 03:57:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 03:57:07,512 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-20 03:57:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:57:07,514 INFO L225 Difference]: With dead ends: 189 [2019-11-20 03:57:07,514 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 03:57:07,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-11-20 03:57:07,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 03:57:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 116. [2019-11-20 03:57:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-20 03:57:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2019-11-20 03:57:07,519 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 22 [2019-11-20 03:57:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:57:07,519 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2019-11-20 03:57:07,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:57:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2019-11-20 03:57:07,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 03:57:07,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:57:07,520 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:57:07,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:57:07,721 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:57:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:57:07,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1015573754, now seen corresponding path program 2 times [2019-11-20 03:57:07,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:57:07,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1217019231] [2019-11-20 03:57:07,722 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:57:07,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:57:07,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:57:07,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-20 03:57:07,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:57:08,015 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_50|], 1=[|v_#valid_112|]} [2019-11-20 03:57:08,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:57:08,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:57:08,029 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:57:08,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:08,133 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-11-20 03:57:08,133 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.8 percent of original size [2019-11-20 03:57:08,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:57:08,145 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 03:57:08,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:08,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:08,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:08,184 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:37 [2019-11-20 03:57:08,345 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 19 treesize of output 15 [2019-11-20 03:57:08,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:08,521 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-11-20 03:57:08,522 INFO L567 ElimStorePlain]: treesize reduction 31, result has 67.4 percent of original size [2019-11-20 03:57:08,522 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 03:57:08,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:99, output treesize:64 [2019-11-20 03:57:08,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:57:08,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-11-20 03:57:08,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:08,790 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 03:57:08,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:08,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 03:57:08,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:73, output treesize:69 [2019-11-20 03:57:09,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:57:09,114 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:57:09,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-20 03:57:09,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:09,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:09,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 03:57:09,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:77, output treesize:51 [2019-11-20 03:57:09,532 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 03:57:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:57:09,537 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:57:10,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2019-11-20 03:57:10,825 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 33 treesize of output 31 [2019-11-20 03:57:10,826 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 03:57:10,993 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-11-20 03:57:10,993 INFO L567 ElimStorePlain]: treesize reduction 17, result has 73.0 percent of original size [2019-11-20 03:57:10,994 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:11,019 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 66 treesize of output 64 [2019-11-20 03:57:11,062 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 33 treesize of output 31 [2019-11-20 03:57:11,063 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-20 03:57:11,190 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-20 03:57:11,190 INFO L567 ElimStorePlain]: treesize reduction 7, result has 88.9 percent of original size [2019-11-20 03:57:11,190 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:11,209 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 64 treesize of output 62 [2019-11-20 03:57:11,287 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 33 treesize of output 31 [2019-11-20 03:57:11,288 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-20 03:57:11,425 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-11-20 03:57:11,426 INFO L567 ElimStorePlain]: treesize reduction 15, result has 75.4 percent of original size [2019-11-20 03:57:11,426 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:11,885 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2019-11-20 03:57:11,886 INFO L567 ElimStorePlain]: treesize reduction 18, result has 89.2 percent of original size [2019-11-20 03:57:11,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 03:57:11,886 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:197, output treesize:149 [2019-11-20 03:57:12,404 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 03:57:13,070 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 03:57:13,077 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 03:57:13,097 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:57:13,127 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:57:13,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:13,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:13,128 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-20 03:57:13,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:13,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:89, output treesize:1 [2019-11-20 03:57:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:57:13,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1217019231] [2019-11-20 03:57:13,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:57:13,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 21 [2019-11-20 03:57:13,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937112961] [2019-11-20 03:57:13,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:57:13,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:57:13,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:57:13,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-11-20 03:57:13,134 INFO L87 Difference]: Start difference. First operand 116 states and 147 transitions. Second operand 12 states. [2019-11-20 03:57:16,116 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-20 03:57:16,662 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-20 03:57:17,030 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-20 03:57:17,501 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-20 03:57:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:57:18,549 INFO L93 Difference]: Finished difference Result 167 states and 204 transitions. [2019-11-20 03:57:18,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 03:57:18,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-20 03:57:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:57:18,553 INFO L225 Difference]: With dead ends: 167 [2019-11-20 03:57:18,554 INFO L226 Difference]: Without dead ends: 167 [2019-11-20 03:57:18,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2019-11-20 03:57:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-20 03:57:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 140. [2019-11-20 03:57:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-20 03:57:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 180 transitions. [2019-11-20 03:57:18,560 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 180 transitions. Word has length 22 [2019-11-20 03:57:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:57:18,560 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 180 transitions. [2019-11-20 03:57:18,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:57:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 180 transitions. [2019-11-20 03:57:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 03:57:18,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:57:18,561 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:57:18,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:57:18,762 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:57:18,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:57:18,762 INFO L82 PathProgramCache]: Analyzing trace with hash -264289924, now seen corresponding path program 1 times [2019-11-20 03:57:18,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:57:18,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1576232436] [2019-11-20 03:57:18,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:57:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:57:19,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 03:57:19,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:57:19,040 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 03:57:19,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:19,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:19,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:19,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 03:57:19,235 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 17 treesize of output 13 [2019-11-20 03:57:19,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:19,459 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-20 03:57:19,460 INFO L567 ElimStorePlain]: treesize reduction 20, result has 71.0 percent of original size [2019-11-20 03:57:19,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 03:57:19,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:49 [2019-11-20 03:57:19,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-20 03:57:19,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:19,774 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 03:57:19,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:19,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 03:57:19,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:60 [2019-11-20 03:57:20,260 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:57:20,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-20 03:57:20,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:20,389 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-11-20 03:57:20,390 INFO L567 ElimStorePlain]: treesize reduction 9, result has 81.3 percent of original size [2019-11-20 03:57:20,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:20,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:75, output treesize:16 [2019-11-20 03:57:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:57:20,476 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:57:21,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:57:21,907 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 74 treesize of output 66 [2019-11-20 03:57:21,907 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 03:57:21,939 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 74 treesize of output 68 [2019-11-20 03:57:21,940 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 03:57:21,970 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 72 treesize of output 66 [2019-11-20 03:57:21,970 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 03:57:22,529 WARN L191 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-20 03:57:22,529 INFO L567 ElimStorePlain]: treesize reduction 26, result has 87.1 percent of original size [2019-11-20 03:57:22,553 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 60 treesize of output 58 [2019-11-20 03:57:22,597 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 33 treesize of output 31 [2019-11-20 03:57:22,599 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-20 03:57:22,811 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-11-20 03:57:22,812 INFO L567 ElimStorePlain]: treesize reduction 7, result has 87.7 percent of original size [2019-11-20 03:57:22,812 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:22,846 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 60 treesize of output 58 [2019-11-20 03:57:22,949 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 33 treesize of output 31 [2019-11-20 03:57:22,951 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-11-20 03:57:23,121 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-11-20 03:57:23,122 INFO L567 ElimStorePlain]: treesize reduction 7, result has 87.7 percent of original size [2019-11-20 03:57:23,122 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:23,155 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 54 treesize of output 52 [2019-11-20 03:57:23,212 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 33 treesize of output 31 [2019-11-20 03:57:23,213 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2019-11-20 03:57:23,382 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-11-20 03:57:23,382 INFO L567 ElimStorePlain]: treesize reduction 7, result has 86.3 percent of original size [2019-11-20 03:57:23,382 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:23,651 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 03:57:23,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:23,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-20 03:57:23,653 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:221, output treesize:145 [2019-11-20 03:57:24,519 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-11-20 03:57:25,249 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 03:57:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:57:25,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1576232436] [2019-11-20 03:57:25,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:57:25,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2019-11-20 03:57:25,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392842718] [2019-11-20 03:57:25,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 03:57:25,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:57:25,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 03:57:25,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-11-20 03:57:25,299 INFO L87 Difference]: Start difference. First operand 140 states and 180 transitions. Second operand 10 states. [2019-11-20 03:57:26,058 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 03:57:26,857 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-20 03:57:27,446 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-20 03:57:28,208 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-20 03:57:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:57:31,113 INFO L93 Difference]: Finished difference Result 171 states and 216 transitions. [2019-11-20 03:57:31,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:57:31,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 03:57:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:57:31,115 INFO L225 Difference]: With dead ends: 171 [2019-11-20 03:57:31,115 INFO L226 Difference]: Without dead ends: 171 [2019-11-20 03:57:31,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-11-20 03:57:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-20 03:57:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2019-11-20 03:57:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-20 03:57:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2019-11-20 03:57:31,122 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 22 [2019-11-20 03:57:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:57:31,122 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2019-11-20 03:57:31,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 03:57:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2019-11-20 03:57:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 03:57:31,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:57:31,123 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:57:31,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:57:31,324 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:57:31,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:57:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2094291523, now seen corresponding path program 1 times [2019-11-20 03:57:31,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:57:31,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [179849210] [2019-11-20 03:57:31,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:57:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:57:31,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 03:57:31,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:57:31,575 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_53|], 1=[|v_#valid_122|]} [2019-11-20 03:57:31,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:57:31,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:57:31,595 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:57:31,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:31,706 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-20 03:57:31,706 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.7 percent of original size [2019-11-20 03:57:31,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:57:31,727 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 03:57:31,727 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:31,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:31,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:57:31,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:35 [2019-11-20 03:57:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:57:32,547 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:57:33,549 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-20 03:57:33,959 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-11-20 03:57:34,326 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 03:57:34,837 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 03:57:35,449 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 03:57:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:57:35,456 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 03:57:35,461 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:57:35,467 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:57:35,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:35,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 78 [2019-11-20 03:57:35,499 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:35,504 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:57:35,512 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 03:57:35,512 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:35,744 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2019-11-20 03:57:35,744 INFO L567 ElimStorePlain]: treesize reduction 31, result has 58.1 percent of original size [2019-11-20 03:57:35,749 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:57:35,750 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:35,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:35,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:35,824 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:230, output treesize:24 [2019-11-20 03:57:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:57:36,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [179849210] [2019-11-20 03:57:36,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:57:36,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2019-11-20 03:57:36,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102977583] [2019-11-20 03:57:36,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 03:57:36,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:57:36,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 03:57:36,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-20 03:57:36,133 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 20 states. [2019-11-20 03:57:38,234 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-20 03:57:40,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:57:40,657 INFO L93 Difference]: Finished difference Result 186 states and 231 transitions. [2019-11-20 03:57:40,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 03:57:40,659 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2019-11-20 03:57:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:57:40,660 INFO L225 Difference]: With dead ends: 186 [2019-11-20 03:57:40,660 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 03:57:40,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2019-11-20 03:57:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 03:57:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 153. [2019-11-20 03:57:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-20 03:57:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2019-11-20 03:57:40,666 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 22 [2019-11-20 03:57:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:57:40,667 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2019-11-20 03:57:40,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 03:57:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2019-11-20 03:57:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 03:57:40,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:57:40,668 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:57:40,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:57:40,871 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:57:40,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:57:40,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1774077257, now seen corresponding path program 1 times [2019-11-20 03:57:40,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:57:40,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1337343123] [2019-11-20 03:57:40,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:57:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:57:41,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 03:57:41,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:57:41,132 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 1=[|v_#valid_127|]} [2019-11-20 03:57:41,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:57:41,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:57:41,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:57:41,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:41,300 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-20 03:57:41,300 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.7 percent of original size [2019-11-20 03:57:41,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:57:41,320 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 03:57:41,321 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:41,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:41,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:57:41,365 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:35 [2019-11-20 03:57:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:57:42,146 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:57:43,622 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-20 03:57:43,961 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-20 03:57:44,338 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 03:57:44,728 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 03:57:44,730 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 03:57:44,744 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 03:57:44,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:44,839 INFO L567 ElimStorePlain]: treesize reduction 35, result has 53.9 percent of original size [2019-11-20 03:57:44,844 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:57:44,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:57:44,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:57:44,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:57:44,874 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:22 [2019-11-20 03:57:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:57:45,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1337343123] [2019-11-20 03:57:45,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:57:45,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-11-20 03:57:45,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135771755] [2019-11-20 03:57:45,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 03:57:45,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:57:45,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 03:57:45,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2019-11-20 03:57:45,081 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. Second operand 21 states. [2019-11-20 03:57:47,561 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-20 03:57:49,732 WARN L191 SmtUtils]: Spent 994.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-20 03:57:54,894 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 03:57:57,030 WARN L191 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-20 03:57:57,830 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-11-20 03:57:59,988 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 03:58:01,491 WARN L191 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-11-20 03:58:02,112 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-11-20 03:58:02,637 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-20 03:58:03,619 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-11-20 03:58:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:04,585 INFO L93 Difference]: Finished difference Result 262 states and 318 transitions. [2019-11-20 03:58:04,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 03:58:04,590 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2019-11-20 03:58:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:04,591 INFO L225 Difference]: With dead ends: 262 [2019-11-20 03:58:04,591 INFO L226 Difference]: Without dead ends: 262 [2019-11-20 03:58:04,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=391, Invalid=941, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 03:58:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-20 03:58:04,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 181. [2019-11-20 03:58:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-20 03:58:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 232 transitions. [2019-11-20 03:58:04,599 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 232 transitions. Word has length 24 [2019-11-20 03:58:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:04,600 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 232 transitions. [2019-11-20 03:58:04,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 03:58:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 232 transitions. [2019-11-20 03:58:04,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 03:58:04,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:04,600 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:58:04,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:58:04,804 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:58:04,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash -989843843, now seen corresponding path program 1 times [2019-11-20 03:58:04,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:58:04,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1416588867] [2019-11-20 03:58:04,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:58:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:05,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 03:58:05,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:58:05,058 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 1=[|v_#valid_132|]} [2019-11-20 03:58:05,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:58:05,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:58:05,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:58:05,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:58:05,167 INFO L567 ElimStorePlain]: treesize reduction 4, result has 90.9 percent of original size [2019-11-20 03:58:05,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:58:05,176 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 03:58:05,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:58:05,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:58:05,210 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 03:58:05,210 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2019-11-20 03:58:12,392 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-20 03:58:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:58:12,808 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:58:14,408 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 03:58:15,379 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 03:58:16,294 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 03:58:16,299 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 03:58:16,315 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 03:58:16,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:58:16,392 INFO L567 ElimStorePlain]: treesize reduction 15, result has 77.3 percent of original size [2019-11-20 03:58:16,397 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:58:16,398 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:58:16,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:58:16,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:58:16,431 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:32 [2019-11-20 03:58:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:58:16,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1416588867] [2019-11-20 03:58:16,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:58:16,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2019-11-20 03:58:16,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485413624] [2019-11-20 03:58:16,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 03:58:16,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:58:16,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 03:58:16,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=539, Unknown=2, NotChecked=0, Total=650 [2019-11-20 03:58:16,688 INFO L87 Difference]: Start difference. First operand 181 states and 232 transitions. Second operand 26 states. [2019-11-20 03:58:20,203 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 03:58:26,094 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 03:58:28,683 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 03:58:35,727 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-20 03:58:38,383 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 03:58:49,352 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-11-20 03:58:51,690 WARN L191 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 03:58:52,173 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-11-20 03:58:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:56,548 INFO L93 Difference]: Finished difference Result 384 states and 490 transitions. [2019-11-20 03:58:56,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-20 03:58:56,550 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-11-20 03:58:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:56,552 INFO L225 Difference]: With dead ends: 384 [2019-11-20 03:58:56,552 INFO L226 Difference]: Without dead ends: 384 [2019-11-20 03:58:56,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=360, Invalid=1706, Unknown=4, NotChecked=0, Total=2070 [2019-11-20 03:58:56,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-20 03:58:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 240. [2019-11-20 03:58:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-20 03:58:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2019-11-20 03:58:56,562 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 26 [2019-11-20 03:58:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:56,562 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2019-11-20 03:58:56,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 03:58:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2019-11-20 03:58:56,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 03:58:56,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:56,563 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:58:56,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:58:56,767 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncatErr0REQUIRES_VIOLATION, cstrncatErr5REQUIRES_VIOLATION, cstrncatErr7REQUIRES_VIOLATION, cstrncatErr6REQUIRES_VIOLATION, cstrncatErr1REQUIRES_VIOLATION, cstrncatErr8REQUIRES_VIOLATION, cstrncatErr3REQUIRES_VIOLATION, cstrncatErr2REQUIRES_VIOLATION, cstrncatErr4REQUIRES_VIOLATION, cstrncatErr9REQUIRES_VIOLATION]=== [2019-11-20 03:58:56,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:56,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1289418404, now seen corresponding path program 1 times [2019-11-20 03:58:56,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:58:56,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [58835773] [2019-11-20 03:58:56,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac3e033b-bf2c-4174-b8f5-7c5760c2eac0/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:58:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:57,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 03:58:57,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:58:57,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-20 03:58:57,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:58:57,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:58:57,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:58:57,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-20 03:58:57,159 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 03:58:57,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:58:57,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:58:57,162 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 03:58:57,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 03:58:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:58:57,192 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:58:57,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:58:57,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:58:57,592 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 03:58:57,597 INFO L168 Benchmark]: Toolchain (without parser) took 167566.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -83.7 MB). Peak memory consumption was 133.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:57,597 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:58:57,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:57,598 INFO L168 Benchmark]: Boogie Preprocessor took 76.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:57,598 INFO L168 Benchmark]: RCFGBuilder took 873.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:57,598 INFO L168 Benchmark]: TraceAbstraction took 165850.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.4 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:57,600 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 761.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 873.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 165850.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.4 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...