./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/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 2d5a995d825785bc5dc95f3825623b1e4ecd07fe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:07:28,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:28,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:28,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:28,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:28,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:28,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:28,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:28,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:28,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:28,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:28,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:28,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:28,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:28,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:28,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:28,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:28,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:28,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:28,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:28,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:28,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:28,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:28,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:28,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:28,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:28,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:28,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:28,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:28,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:28,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:28,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:28,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:28,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:28,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:28,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:28,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:28,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:28,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:28,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:28,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:28,834 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 10:07:28,844 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:28,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:28,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:28,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:28,845 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:28,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:28,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:28,845 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:07:28,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:28,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:28,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:28,846 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 10:07:28,846 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 10:07:28,846 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 10:07:28,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:28,847 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:07:28,847 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:28,847 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:28,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:28,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:28,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:28,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:28,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:28,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:28,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:28,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:28,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:07:28,848 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:28,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_385de29e-549f-4c2c-8734-71c08ec87a9a/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 -> 2d5a995d825785bc5dc95f3825623b1e4ecd07fe [2019-12-07 10:07:28,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:28,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:28,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:28,959 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:28,959 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:28,960 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2019-12-07 10:07:29,001 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/data/228f246eb/0dbe476b3d5e43b38ece8256a7ee8c04/FLAGaa98ab4f9 [2019-12-07 10:07:29,460 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:29,461 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2019-12-07 10:07:29,471 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/data/228f246eb/0dbe476b3d5e43b38ece8256a7ee8c04/FLAGaa98ab4f9 [2019-12-07 10:07:29,480 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/data/228f246eb/0dbe476b3d5e43b38ece8256a7ee8c04 [2019-12-07 10:07:29,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:29,483 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 10:07:29,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:29,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:29,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:29,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40408828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29, skipping insertion in model container [2019-12-07 10:07:29,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:29,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:29,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:29,729 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:29,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:29,789 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:29,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29 WrapperNode [2019-12-07 10:07:29,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:29,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:29,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:29,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:29,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:29,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:29,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:29,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:29,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/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-12-07 10:07:29,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 10:07:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 10:07:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 10:07:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 10:07:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 10:07:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 10:07:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2019-12-07 10:07:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 10:07:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 10:07:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 10:07:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 10:07:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 10:07:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 10:07:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 10:07:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 10:07:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 10:07:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 10:07:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 10:07:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 10:07:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 10:07:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 10:07:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 10:07:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 10:07:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 10:07:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 10:07:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 10:07:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 10:07:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 10:07:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 10:07:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 10:07:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 10:07:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 10:07:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 10:07:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 10:07:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 10:07:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 10:07:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 10:07:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 10:07:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 10:07:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 10:07:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 10:07:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 10:07:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 10:07:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 10:07:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 10:07:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 10:07:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 10:07:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 10:07:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 10:07:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 10:07:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 10:07:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 10:07:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 10:07:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 10:07:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 10:07:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 10:07:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 10:07:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 10:07:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 10:07:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 10:07:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 10:07:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 10:07:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 10:07:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 10:07:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 10:07:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 10:07:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 10:07:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 10:07:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 10:07:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 10:07:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 10:07:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 10:07:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 10:07:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 10:07:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 10:07:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 10:07:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 10:07:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 10:07:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-12-07 10:07:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2019-12-07 10:07:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:07:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 10:07:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:07:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:07:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 10:07:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:30,164 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:30,165 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-12-07 10:07:30,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:30 BoogieIcfgContainer [2019-12-07 10:07:30,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:30,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:30,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:30,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:30,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:29" (1/3) ... [2019-12-07 10:07:30,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdc1796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:30, skipping insertion in model container [2019-12-07 10:07:30,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (2/3) ... [2019-12-07 10:07:30,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdc1796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:30, skipping insertion in model container [2019-12-07 10:07:30,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:30" (3/3) ... [2019-12-07 10:07:30,172 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca-1.i [2019-12-07 10:07:30,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:30,183 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 10:07:30,191 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 10:07:30,203 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:30,204 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 10:07:30,204 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:30,204 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:30,204 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:30,204 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:30,204 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:30,204 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2019-12-07 10:07:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:07:30,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:30,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:30,221 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:30,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:30,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1980189205, now seen corresponding path program 1 times [2019-12-07 10:07:30,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:30,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385857806] [2019-12-07 10:07:30,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:30,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385857806] [2019-12-07 10:07:30,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:30,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:07:30,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315089851] [2019-12-07 10:07:30,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:07:30,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:30,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:30,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:30,380 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 5 states. [2019-12-07 10:07:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:30,524 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2019-12-07 10:07:30,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:07:30,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 10:07:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:30,532 INFO L225 Difference]: With dead ends: 88 [2019-12-07 10:07:30,533 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 10:07:30,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:07:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 10:07:30,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 66. [2019-12-07 10:07:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 10:07:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-12-07 10:07:30,564 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 11 [2019-12-07 10:07:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:30,564 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-12-07 10:07:30,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:07:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-12-07 10:07:30,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:07:30,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:30,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:30,565 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:30,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1982036247, now seen corresponding path program 1 times [2019-12-07 10:07:30,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:30,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21496179] [2019-12-07 10:07:30,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:30,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21496179] [2019-12-07 10:07:30,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:30,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:30,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865369045] [2019-12-07 10:07:30,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:07:30,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:30,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:30,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:30,636 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 5 states. [2019-12-07 10:07:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:30,782 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-12-07 10:07:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:30,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 10:07:30,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:30,784 INFO L225 Difference]: With dead ends: 89 [2019-12-07 10:07:30,784 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 10:07:30,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-07 10:07:30,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 10:07:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-12-07 10:07:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 10:07:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-12-07 10:07:30,790 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 11 [2019-12-07 10:07:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:30,791 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-12-07 10:07:30,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:07:30,791 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-12-07 10:07:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:07:30,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:30,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:30,792 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:30,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:30,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1982036246, now seen corresponding path program 1 times [2019-12-07 10:07:30,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:30,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090769345] [2019-12-07 10:07:30,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:30,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090769345] [2019-12-07 10:07:30,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:30,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:30,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767328018] [2019-12-07 10:07:30,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:30,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:30,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:30,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:30,832 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 4 states. [2019-12-07 10:07:30,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:30,913 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-12-07 10:07:30,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:30,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:07:30,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:30,914 INFO L225 Difference]: With dead ends: 66 [2019-12-07 10:07:30,914 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 10:07:30,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 10:07:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-07 10:07:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 10:07:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2019-12-07 10:07:30,919 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 11 [2019-12-07 10:07:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:30,920 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2019-12-07 10:07:30,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2019-12-07 10:07:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:07:30,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:30,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:30,921 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:30,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:30,921 INFO L82 PathProgramCache]: Analyzing trace with hash 291262476, now seen corresponding path program 1 times [2019-12-07 10:07:30,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:30,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957219535] [2019-12-07 10:07:30,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:30,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957219535] [2019-12-07 10:07:30,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:30,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:30,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479118011] [2019-12-07 10:07:30,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:07:30,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:30,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:30,966 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand 5 states. [2019-12-07 10:07:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:31,051 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-12-07 10:07:31,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:31,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 10:07:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:31,052 INFO L225 Difference]: With dead ends: 65 [2019-12-07 10:07:31,052 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 10:07:31,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:07:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 10:07:31,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-12-07 10:07:31,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 10:07:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-12-07 10:07:31,057 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 13 [2019-12-07 10:07:31,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:31,057 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-12-07 10:07:31,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:07:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-12-07 10:07:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:07:31,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:31,058 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:31,058 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:31,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:31,058 INFO L82 PathProgramCache]: Analyzing trace with hash 291262528, now seen corresponding path program 1 times [2019-12-07 10:07:31,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:31,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675863846] [2019-12-07 10:07:31,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:31,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675863846] [2019-12-07 10:07:31,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:31,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:31,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84362452] [2019-12-07 10:07:31,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:31,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:31,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:31,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:31,088 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 4 states. [2019-12-07 10:07:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:31,162 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2019-12-07 10:07:31,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:31,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:07:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:31,163 INFO L225 Difference]: With dead ends: 63 [2019-12-07 10:07:31,163 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 10:07:31,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 10:07:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 10:07:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 10:07:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-12-07 10:07:31,167 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 13 [2019-12-07 10:07:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:31,168 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-12-07 10:07:31,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2019-12-07 10:07:31,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:07:31,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:31,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:31,168 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:31,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:31,169 INFO L82 PathProgramCache]: Analyzing trace with hash 291262529, now seen corresponding path program 1 times [2019-12-07 10:07:31,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:31,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465200541] [2019-12-07 10:07:31,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:31,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465200541] [2019-12-07 10:07:31,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:31,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:07:31,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935761676] [2019-12-07 10:07:31,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:07:31,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:31,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:31,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:31,204 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2019-12-07 10:07:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:31,290 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-12-07 10:07:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:07:31,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 10:07:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:31,291 INFO L225 Difference]: With dead ends: 83 [2019-12-07 10:07:31,291 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 10:07:31,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:07:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 10:07:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2019-12-07 10:07:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 10:07:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2019-12-07 10:07:31,296 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 13 [2019-12-07 10:07:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:31,296 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2019-12-07 10:07:31,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:07:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2019-12-07 10:07:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:07:31,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:31,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:31,298 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:31,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash 348520831, now seen corresponding path program 1 times [2019-12-07 10:07:31,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:31,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951004004] [2019-12-07 10:07:31,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,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-12-07 10:07:31,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951004004] [2019-12-07 10:07:31,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:31,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:07:31,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287897243] [2019-12-07 10:07:31,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:07:31,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:31,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:07:31,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:07:31,341 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand 6 states. [2019-12-07 10:07:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:31,452 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2019-12-07 10:07:31,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:07:31,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 10:07:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:31,453 INFO L225 Difference]: With dead ends: 86 [2019-12-07 10:07:31,454 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 10:07:31,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:07:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 10:07:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-12-07 10:07:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 10:07:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2019-12-07 10:07:31,460 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 13 [2019-12-07 10:07:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:31,460 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2019-12-07 10:07:31,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:07:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2019-12-07 10:07:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:07:31,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:31,461 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:31,461 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:31,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash 439202164, now seen corresponding path program 1 times [2019-12-07 10:07:31,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:31,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970181754] [2019-12-07 10:07:31,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:31,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970181754] [2019-12-07 10:07:31,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:31,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:31,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488080445] [2019-12-07 10:07:31,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:07:31,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:31,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:31,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:31,499 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 5 states. [2019-12-07 10:07:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:31,563 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-12-07 10:07:31,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:31,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 10:07:31,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:31,563 INFO L225 Difference]: With dead ends: 75 [2019-12-07 10:07:31,563 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 10:07:31,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:07:31,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 10:07:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-12-07 10:07:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 10:07:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2019-12-07 10:07:31,568 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 14 [2019-12-07 10:07:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:31,568 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2019-12-07 10:07:31,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:07:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2019-12-07 10:07:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:07:31,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:31,569 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:31,569 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1458990554, now seen corresponding path program 1 times [2019-12-07 10:07:31,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:31,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909519064] [2019-12-07 10:07:31,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:31,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909519064] [2019-12-07 10:07:31,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979302602] [2019-12-07 10:07:31,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,685 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 10:07:31,688 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:31,715 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-12-07 10:07:31,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:07:31,728 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-12-07 10:07:31,728 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:31,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:31,741 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-12-07 10:07:31,741 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:31,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:31,748 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:31,749 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 10:07:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:31,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:31,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-12-07 10:07:31,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256114027] [2019-12-07 10:07:31,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:07:31,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:31,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:07:31,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:07:31,760 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 7 states. [2019-12-07 10:07:31,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:31,889 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2019-12-07 10:07:31,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:07:31,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 10:07:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:31,890 INFO L225 Difference]: With dead ends: 95 [2019-12-07 10:07:31,890 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 10:07:31,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 10:07:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2019-12-07 10:07:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 10:07:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-12-07 10:07:31,894 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 15 [2019-12-07 10:07:31,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:31,894 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-12-07 10:07:31,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:07:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-12-07 10:07:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:07:31,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:31,895 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:32,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:32,096 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:32,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:32,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1456928450, now seen corresponding path program 1 times [2019-12-07 10:07:32,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:32,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522710929] [2019-12-07 10:07:32,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:32,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522710929] [2019-12-07 10:07:32,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145001789] [2019-12-07 10:07:32,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:32,227 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 10:07:32,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:32,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:32,240 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-12-07 10:07:32,240 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:32,251 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 10:07:32,252 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:32,252 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 10:07:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:32,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:32,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-12-07 10:07:32,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227383725] [2019-12-07 10:07:32,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:07:32,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:32,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:07:32,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:07:32,262 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 7 states. [2019-12-07 10:07:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:32,375 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2019-12-07 10:07:32,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:07:32,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 10:07:32,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:32,376 INFO L225 Difference]: With dead ends: 78 [2019-12-07 10:07:32,376 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 10:07:32,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 10:07:32,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2019-12-07 10:07:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 10:07:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2019-12-07 10:07:32,379 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 17 [2019-12-07 10:07:32,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:32,379 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2019-12-07 10:07:32,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:07:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2019-12-07 10:07:32,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:07:32,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:32,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:32,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:32,581 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:32,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:32,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1817523924, now seen corresponding path program 1 times [2019-12-07 10:07:32,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:32,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928590670] [2019-12-07 10:07:32,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:32,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928590670] [2019-12-07 10:07:32,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:32,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:07:32,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068494346] [2019-12-07 10:07:32,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:07:32,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:07:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:07:32,639 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 6 states. [2019-12-07 10:07:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:32,735 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2019-12-07 10:07:32,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:07:32,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 10:07:32,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:32,735 INFO L225 Difference]: With dead ends: 64 [2019-12-07 10:07:32,735 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 10:07:32,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 10:07:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 10:07:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 10:07:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-12-07 10:07:32,738 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 21 [2019-12-07 10:07:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:32,738 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-12-07 10:07:32,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:07:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-12-07 10:07:32,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:07:32,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:32,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:32,739 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:32,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1817523925, now seen corresponding path program 1 times [2019-12-07 10:07:32,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:32,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866407608] [2019-12-07 10:07:32,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:32,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866407608] [2019-12-07 10:07:32,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:32,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:07:32,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67431703] [2019-12-07 10:07:32,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:07:32,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:32,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:07:32,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:32,805 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 8 states. [2019-12-07 10:07:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:33,000 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-12-07 10:07:33,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:07:33,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 10:07:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:33,003 INFO L225 Difference]: With dead ends: 86 [2019-12-07 10:07:33,003 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 10:07:33,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:07:33,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 10:07:33,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-12-07 10:07:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 10:07:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-12-07 10:07:33,007 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 21 [2019-12-07 10:07:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:33,007 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-12-07 10:07:33,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:07:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-12-07 10:07:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:07:33,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:33,008 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-12-07 10:07:33,008 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:33,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:33,009 INFO L82 PathProgramCache]: Analyzing trace with hash 509312965, now seen corresponding path program 1 times [2019-12-07 10:07:33,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:33,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594615410] [2019-12-07 10:07:33,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:33,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594615410] [2019-12-07 10:07:33,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:33,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:33,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62442189] [2019-12-07 10:07:33,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:07:33,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:33,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:33,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:33,059 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 5 states. [2019-12-07 10:07:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:33,123 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-12-07 10:07:33,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:33,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:07:33,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:33,123 INFO L225 Difference]: With dead ends: 72 [2019-12-07 10:07:33,124 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 10:07:33,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 10:07:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-12-07 10:07:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 10:07:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-12-07 10:07:33,125 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 22 [2019-12-07 10:07:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:33,126 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-12-07 10:07:33,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:07:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-12-07 10:07:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:07:33,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:33,126 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-12-07 10:07:33,127 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:33,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:33,127 INFO L82 PathProgramCache]: Analyzing trace with hash 508666854, now seen corresponding path program 1 times [2019-12-07 10:07:33,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:33,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385262516] [2019-12-07 10:07:33,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:33,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385262516] [2019-12-07 10:07:33,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:33,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:07:33,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758268184] [2019-12-07 10:07:33,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:07:33,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:07:33,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:07:33,158 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 6 states. [2019-12-07 10:07:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:33,226 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2019-12-07 10:07:33,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:07:33,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:07:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:33,227 INFO L225 Difference]: With dead ends: 63 [2019-12-07 10:07:33,227 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 10:07:33,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:33,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 10:07:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 10:07:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 10:07:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-12-07 10:07:33,229 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 22 [2019-12-07 10:07:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:33,229 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-12-07 10:07:33,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:07:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-12-07 10:07:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:07:33,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:33,230 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-12-07 10:07:33,230 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:33,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:33,230 INFO L82 PathProgramCache]: Analyzing trace with hash 508666855, now seen corresponding path program 1 times [2019-12-07 10:07:33,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:33,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700123601] [2019-12-07 10:07:33,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:33,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700123601] [2019-12-07 10:07:33,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:33,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:07:33,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870541401] [2019-12-07 10:07:33,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:07:33,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:33,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:07:33,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:33,282 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 8 states. [2019-12-07 10:07:33,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:33,402 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-12-07 10:07:33,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:07:33,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-07 10:07:33,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:33,403 INFO L225 Difference]: With dead ends: 67 [2019-12-07 10:07:33,403 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 10:07:33,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:07:33,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 10:07:33,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-12-07 10:07:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 10:07:33,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-12-07 10:07:33,405 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 22 [2019-12-07 10:07:33,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:33,405 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-12-07 10:07:33,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:07:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-12-07 10:07:33,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:07:33,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:33,406 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:33,406 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:33,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:33,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2007435023, now seen corresponding path program 1 times [2019-12-07 10:07:33,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:33,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282924474] [2019-12-07 10:07:33,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:33,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282924474] [2019-12-07 10:07:33,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:33,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:33,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842444508] [2019-12-07 10:07:33,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:33,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:33,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:33,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:33,426 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 4 states. [2019-12-07 10:07:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:33,476 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-12-07 10:07:33,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:33,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 10:07:33,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:33,477 INFO L225 Difference]: With dead ends: 64 [2019-12-07 10:07:33,477 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 10:07:33,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 10:07:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 10:07:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 10:07:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2019-12-07 10:07:33,480 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 26 [2019-12-07 10:07:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:33,480 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2019-12-07 10:07:33,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2019-12-07 10:07:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:07:33,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:33,481 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, 1] [2019-12-07 10:07:33,482 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash 489090044, now seen corresponding path program 1 times [2019-12-07 10:07:33,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:33,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83373725] [2019-12-07 10:07:33,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:33,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83373725] [2019-12-07 10:07:33,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:33,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:33,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618363881] [2019-12-07 10:07:33,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:33,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:33,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:33,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:33,506 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 4 states. [2019-12-07 10:07:33,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:33,549 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-12-07 10:07:33,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:33,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 10:07:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:33,550 INFO L225 Difference]: With dead ends: 64 [2019-12-07 10:07:33,550 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 10:07:33,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:33,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 10:07:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 10:07:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 10:07:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-12-07 10:07:33,552 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 29 [2019-12-07 10:07:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:33,552 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-12-07 10:07:33,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-12-07 10:07:33,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:07:33,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:33,553 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, 1, 1, 1] [2019-12-07 10:07:33,553 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:33,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:33,553 INFO L82 PathProgramCache]: Analyzing trace with hash -859100191, now seen corresponding path program 1 times [2019-12-07 10:07:33,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:33,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572868292] [2019-12-07 10:07:33,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:33,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572868292] [2019-12-07 10:07:33,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:33,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:07:33,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762805714] [2019-12-07 10:07:33,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:07:33,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:33,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:07:33,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:07:33,642 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 10 states. [2019-12-07 10:07:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:33,823 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2019-12-07 10:07:33,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:07:33,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-12-07 10:07:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:33,824 INFO L225 Difference]: With dead ends: 86 [2019-12-07 10:07:33,824 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 10:07:33,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:07:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 10:07:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-07 10:07:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 10:07:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-12-07 10:07:33,826 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 31 [2019-12-07 10:07:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:33,826 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-12-07 10:07:33,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:07:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-12-07 10:07:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:07:33,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:33,826 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, 1, 1, 1] [2019-12-07 10:07:33,827 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:33,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:33,827 INFO L82 PathProgramCache]: Analyzing trace with hash -718551581, now seen corresponding path program 1 times [2019-12-07 10:07:33,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:33,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198802158] [2019-12-07 10:07:33,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:33,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198802158] [2019-12-07 10:07:33,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:33,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:07:33,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86025611] [2019-12-07 10:07:33,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:07:33,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:33,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:07:33,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:07:33,944 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 11 states. [2019-12-07 10:07:34,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:34,152 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2019-12-07 10:07:34,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:07:34,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-12-07 10:07:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:34,153 INFO L225 Difference]: With dead ends: 89 [2019-12-07 10:07:34,153 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 10:07:34,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:07:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 10:07:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2019-12-07 10:07:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 10:07:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-12-07 10:07:34,154 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 31 [2019-12-07 10:07:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:34,155 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-12-07 10:07:34,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:07:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-12-07 10:07:34,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:07:34,155 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:34,155 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:34,155 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:34,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:34,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2071968550, now seen corresponding path program 1 times [2019-12-07 10:07:34,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:34,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969590985] [2019-12-07 10:07:34,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:34,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969590985] [2019-12-07 10:07:34,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839360413] [2019-12-07 10:07:34,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:34,281 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 10:07:34,283 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:34,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:07:34,294 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:34,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:34,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:34,295 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 10:07:34,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:07:34,420 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:34,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-12-07 10:07:34,421 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:34,425 INFO L614 ElimStorePlain]: treesize reduction 13, result has 18.8 percent of original size [2019-12-07 10:07:34,425 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:34,425 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-12-07 10:07:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:07:34,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:07:34,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 20 [2019-12-07 10:07:34,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313564561] [2019-12-07 10:07:34,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:07:34,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:07:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:07:34,454 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 12 states. [2019-12-07 10:07:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:34,691 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2019-12-07 10:07:34,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:07:34,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-12-07 10:07:34,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:34,692 INFO L225 Difference]: With dead ends: 76 [2019-12-07 10:07:34,692 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 10:07:34,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2019-12-07 10:07:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 10:07:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 10:07:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 10:07:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-12-07 10:07:34,693 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 35 [2019-12-07 10:07:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:34,694 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-12-07 10:07:34,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:07:34,694 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-12-07 10:07:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:07:34,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:34,694 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:34,894 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:34,895 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1562495460, now seen corresponding path program 1 times [2019-12-07 10:07:34,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:34,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507184849] [2019-12-07 10:07:34,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:35,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507184849] [2019-12-07 10:07:35,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564553173] [2019-12-07 10:07:35,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:35,115 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 10:07:35,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:35,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:35,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-12-07 10:07:35,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69834096] [2019-12-07 10:07:35,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:07:35,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:35,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:07:35,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:07:35,189 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 16 states. [2019-12-07 10:07:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:35,406 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-12-07 10:07:35,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:07:35,406 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2019-12-07 10:07:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:35,407 INFO L225 Difference]: With dead ends: 70 [2019-12-07 10:07:35,407 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 10:07:35,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:07:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 10:07:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2019-12-07 10:07:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 10:07:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-12-07 10:07:35,409 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 35 [2019-12-07 10:07:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:35,409 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-12-07 10:07:35,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:07:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-12-07 10:07:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 10:07:35,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:35,410 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:35,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:35,611 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1192719032, now seen corresponding path program 1 times [2019-12-07 10:07:35,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:35,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877710961] [2019-12-07 10:07:35,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:07:35,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877710961] [2019-12-07 10:07:35,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:35,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 10:07:35,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559008983] [2019-12-07 10:07:35,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:07:35,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:35,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:07:35,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:07:35,786 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 16 states. [2019-12-07 10:07:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:36,070 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-12-07 10:07:36,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:07:36,071 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-12-07 10:07:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:36,071 INFO L225 Difference]: With dead ends: 84 [2019-12-07 10:07:36,071 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 10:07:36,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:07:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 10:07:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-12-07 10:07:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 10:07:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-12-07 10:07:36,073 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 36 [2019-12-07 10:07:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:36,073 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-12-07 10:07:36,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:07:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-12-07 10:07:36,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:07:36,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:36,074 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:36,074 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:36,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:36,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1073097963, now seen corresponding path program 1 times [2019-12-07 10:07:36,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:36,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151242246] [2019-12-07 10:07:36,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:07:36,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151242246] [2019-12-07 10:07:36,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48596507] [2019-12-07 10:07:36,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,205 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 10:07:36,207 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:07:36,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:36,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-12-07 10:07:36,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421302032] [2019-12-07 10:07:36,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:07:36,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:36,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:07:36,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:07:36,263 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 16 states. [2019-12-07 10:07:36,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:36,515 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-12-07 10:07:36,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:07:36,516 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-12-07 10:07:36,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:36,516 INFO L225 Difference]: With dead ends: 69 [2019-12-07 10:07:36,516 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 10:07:36,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:07:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 10:07:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-12-07 10:07:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 10:07:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-12-07 10:07:36,518 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 40 [2019-12-07 10:07:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:36,518 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-12-07 10:07:36,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:07:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-12-07 10:07:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 10:07:36,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:36,519 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:36,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:36,720 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash -83218317, now seen corresponding path program 1 times [2019-12-07 10:07:36,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:36,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341497532] [2019-12-07 10:07:36,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:07:36,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341497532] [2019-12-07 10:07:36,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888207592] [2019-12-07 10:07:36,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:37,055 INFO L264 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 10:07:37,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:37,128 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 14 treesize of output 10 [2019-12-07 10:07:37,128 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:37,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:37,134 INFO L534 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-12-07 10:07:37,134 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-12-07 10:07:37,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:07:37,465 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:07:37,476 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:37,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 40 [2019-12-07 10:07:37,477 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:37,483 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:37,484 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:37,484 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:46, output treesize:3 [2019-12-07 10:07:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:07:37,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:37,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2019-12-07 10:07:37,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279264687] [2019-12-07 10:07:37,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 10:07:37,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:37,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 10:07:37,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:07:37,537 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 29 states. [2019-12-07 10:07:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:39,827 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2019-12-07 10:07:39,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 10:07:39,827 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 49 [2019-12-07 10:07:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:39,828 INFO L225 Difference]: With dead ends: 168 [2019-12-07 10:07:39,828 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 10:07:39,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=501, Invalid=3921, Unknown=0, NotChecked=0, Total=4422 [2019-12-07 10:07:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 10:07:39,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2019-12-07 10:07:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 10:07:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-12-07 10:07:39,831 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 49 [2019-12-07 10:07:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:39,831 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-12-07 10:07:39,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 10:07:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-12-07 10:07:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 10:07:39,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:39,831 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:40,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:40,032 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:40,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:40,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2107871545, now seen corresponding path program 2 times [2019-12-07 10:07:40,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:40,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104358021] [2019-12-07 10:07:40,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:07:40,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104358021] [2019-12-07 10:07:40,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439476323] [2019-12-07 10:07:40,127 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:40,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:07:40,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:40,203 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 10:07:40,204 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:07:40,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:40,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-12-07 10:07:40,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203844263] [2019-12-07 10:07:40,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 10:07:40,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:40,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 10:07:40,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:07:40,276 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 18 states. [2019-12-07 10:07:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:40,569 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-12-07 10:07:40,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:07:40,570 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-07 10:07:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:40,570 INFO L225 Difference]: With dead ends: 89 [2019-12-07 10:07:40,570 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 10:07:40,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:07:40,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 10:07:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-12-07 10:07:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 10:07:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-12-07 10:07:40,572 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 57 [2019-12-07 10:07:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:40,573 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-12-07 10:07:40,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 10:07:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-12-07 10:07:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 10:07:40,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:40,573 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:40,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:40,774 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:40,775 INFO L82 PathProgramCache]: Analyzing trace with hash 919508483, now seen corresponding path program 2 times [2019-12-07 10:07:40,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:40,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653745693] [2019-12-07 10:07:40,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:07:40,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653745693] [2019-12-07 10:07:40,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849097251] [2019-12-07 10:07:40,875 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:40,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:07:40,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:40,940 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 10:07:40,942 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:07:41,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:41,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-12-07 10:07:41,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748201337] [2019-12-07 10:07:41,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 10:07:41,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:41,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 10:07:41,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:07:41,021 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 19 states. [2019-12-07 10:07:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:41,337 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-12-07 10:07:41,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:07:41,337 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-12-07 10:07:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:41,338 INFO L225 Difference]: With dead ends: 87 [2019-12-07 10:07:41,338 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 10:07:41,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:07:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 10:07:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-12-07 10:07:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 10:07:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2019-12-07 10:07:41,340 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 58 [2019-12-07 10:07:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:41,340 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2019-12-07 10:07:41,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 10:07:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2019-12-07 10:07:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:07:41,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:41,341 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:41,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:41,542 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:41,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1530472123, now seen corresponding path program 3 times [2019-12-07 10:07:41,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:41,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128948293] [2019-12-07 10:07:41,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:07:41,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128948293] [2019-12-07 10:07:41,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022443506] [2019-12-07 10:07:41,743 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:41,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 10:07:41,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:41,828 INFO L264 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 10:07:41,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:41,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:41,841 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-12-07 10:07:41,841 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:41,853 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 10:07:41,853 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:41,854 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 10:07:41,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 10:07:41,947 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:41,951 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:41,951 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:41,951 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 10:07:42,142 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 19 [2019-12-07 10:07:42,142 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:07:42,151 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:42,151 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 10:07:42,152 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:41 [2019-12-07 10:07:42,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:07:42,329 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:07:42,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:42,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 40 [2019-12-07 10:07:42,340 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:42,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:42,346 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:42,346 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:45, output treesize:3 [2019-12-07 10:07:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:07:42,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:42,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2019-12-07 10:07:42,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084096950] [2019-12-07 10:07:42,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 10:07:42,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:42,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 10:07:42,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:07:42,363 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 29 states. [2019-12-07 10:07:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:55,296 INFO L93 Difference]: Finished difference Result 220 states and 224 transitions. [2019-12-07 10:07:55,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 10:07:55,296 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2019-12-07 10:07:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:55,297 INFO L225 Difference]: With dead ends: 220 [2019-12-07 10:07:55,297 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 10:07:55,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=548, Invalid=4278, Unknown=4, NotChecked=0, Total=4830 [2019-12-07 10:07:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 10:07:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2019-12-07 10:07:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 10:07:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2019-12-07 10:07:55,299 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 67 [2019-12-07 10:07:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:55,300 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2019-12-07 10:07:55,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 10:07:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2019-12-07 10:07:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 10:07:55,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:55,300 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:55,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:55,501 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:55,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:55,502 INFO L82 PathProgramCache]: Analyzing trace with hash -816089973, now seen corresponding path program 4 times [2019-12-07 10:07:55,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:55,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796541418] [2019-12-07 10:07:55,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:07:55,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796541418] [2019-12-07 10:07:55,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720305120] [2019-12-07 10:07:55,620 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:55,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:07:55,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:55,688 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 10:07:55,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:55,694 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_27|], 1=[|v_#valid_34|]} [2019-12-07 10:07:55,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:07:55,697 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-12-07 10:07:55,697 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:55,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:55,706 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-12-07 10:07:55,706 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:55,710 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:55,710 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:55,711 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-12-07 10:07:55,731 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 10:07:55,731 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:55,735 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:55,735 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:55,735 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 10:07:55,754 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-12-07 10:07:55,754 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:55,758 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:55,758 INFO L534 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-12-07 10:07:55,759 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-12-07 10:07:56,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:07:56,089 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:56,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 40 [2019-12-07 10:07:56,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:07:56,090 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:56,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:56,098 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:56,098 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-12-07 10:07:56,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:07:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 10:07:56,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:56,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-12-07 10:07:56,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524414460] [2019-12-07 10:07:56,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 10:07:56,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:56,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 10:07:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:07:56,196 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 27 states. [2019-12-07 10:07:57,313 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-12-07 10:07:59,102 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-07 10:07:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:59,272 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-12-07 10:07:59,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 10:07:59,272 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 75 [2019-12-07 10:07:59,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:59,273 INFO L225 Difference]: With dead ends: 88 [2019-12-07 10:07:59,273 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 10:07:59,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=289, Invalid=1603, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 10:07:59,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 10:07:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-12-07 10:07:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 10:07:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-12-07 10:07:59,275 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 75 [2019-12-07 10:07:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:59,275 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-12-07 10:07:59,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 10:07:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-12-07 10:07:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 10:07:59,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:59,276 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:59,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:59,477 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:07:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:59,478 INFO L82 PathProgramCache]: Analyzing trace with hash 471014641, now seen corresponding path program 3 times [2019-12-07 10:07:59,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:59,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874993138] [2019-12-07 10:07:59,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:07:59,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874993138] [2019-12-07 10:07:59,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410113496] [2019-12-07 10:07:59,616 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:59,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 10:07:59,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:59,698 INFO L264 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 10:07:59,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:59,708 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:07:59,708 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-12-07 10:07:59,709 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:07:59,724 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 10:07:59,724 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:07:59,724 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 10:07:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:07:59,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:59,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2019-12-07 10:07:59,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072198822] [2019-12-07 10:07:59,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 10:07:59,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:59,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 10:07:59,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-12-07 10:07:59,883 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 25 states. [2019-12-07 10:08:00,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:00,366 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2019-12-07 10:08:00,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:08:00,366 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2019-12-07 10:08:00,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:00,367 INFO L225 Difference]: With dead ends: 102 [2019-12-07 10:08:00,367 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 10:08:00,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2019-12-07 10:08:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 10:08:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2019-12-07 10:08:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 10:08:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2019-12-07 10:08:00,369 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 76 [2019-12-07 10:08:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:00,370 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2019-12-07 10:08:00,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 10:08:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2019-12-07 10:08:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 10:08:00,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:00,370 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:00,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:00,571 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:00,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash 914851045, now seen corresponding path program 4 times [2019-12-07 10:08:00,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:00,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436161219] [2019-12-07 10:08:00,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 43 proven. 48 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:08:00,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436161219] [2019-12-07 10:08:00,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077474549] [2019-12-07 10:08:00,739 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:00,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:08:00,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:08:00,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 10:08:00,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:00,814 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_29|], 1=[|v_#valid_35|]} [2019-12-07 10:08:00,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:08:00,817 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-12-07 10:08:00,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:00,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:00,831 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-12-07 10:08:00,831 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:00,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:00,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:00,837 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-12-07 10:08:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 76 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:08:01,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:01,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2019-12-07 10:08:01,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427729907] [2019-12-07 10:08:01,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 10:08:01,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:01,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 10:08:01,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:08:01,019 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 27 states. [2019-12-07 10:08:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:01,349 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-12-07 10:08:01,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:08:01,350 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 86 [2019-12-07 10:08:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:01,350 INFO L225 Difference]: With dead ends: 166 [2019-12-07 10:08:01,350 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 10:08:01,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 10:08:01,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 10:08:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2019-12-07 10:08:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 10:08:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2019-12-07 10:08:01,353 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 86 [2019-12-07 10:08:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:01,353 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2019-12-07 10:08:01,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 10:08:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2019-12-07 10:08:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 10:08:01,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:01,354 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:01,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:01,554 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:01,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:01,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1040289602, now seen corresponding path program 5 times [2019-12-07 10:08:01,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:01,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695268858] [2019-12-07 10:08:01,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 16 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:02,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695268858] [2019-12-07 10:08:02,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798457970] [2019-12-07 10:08:02,157 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:02,248 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-07 10:08:02,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:08:02,250 INFO L264 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 10:08:02,251 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:02,366 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 14 treesize of output 10 [2019-12-07 10:08:02,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:02,370 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:02,370 INFO L534 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-12-07 10:08:02,371 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 10:08:02,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:02,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:08:02,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:02,603 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:02,603 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:02,603 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 10:08:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 10:08:02,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:02,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 37 [2019-12-07 10:08:02,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554743093] [2019-12-07 10:08:02,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 10:08:02,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:02,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 10:08:02,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 10:08:02,617 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 37 states. [2019-12-07 10:08:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:04,611 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-12-07 10:08:04,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 10:08:04,612 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 90 [2019-12-07 10:08:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:04,613 INFO L225 Difference]: With dead ends: 154 [2019-12-07 10:08:04,613 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 10:08:04,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=293, Invalid=3129, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 10:08:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 10:08:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2019-12-07 10:08:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 10:08:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2019-12-07 10:08:04,619 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 90 [2019-12-07 10:08:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:04,619 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2019-12-07 10:08:04,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 10:08:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2019-12-07 10:08:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 10:08:04,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:04,621 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:04,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:04,822 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:04,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:04,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1006630945, now seen corresponding path program 6 times [2019-12-07 10:08:04,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:04,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413030576] [2019-12-07 10:08:04,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 17 proven. 87 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 10:08:05,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413030576] [2019-12-07 10:08:05,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144636746] [2019-12-07 10:08:05,006 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:05,117 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-07 10:08:05,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:08:05,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 10:08:05,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:05,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:05,131 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-12-07 10:08:05,131 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:05,144 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 10:08:05,145 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:05,145 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 10:08:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 15 proven. 89 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 10:08:05,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:05,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2019-12-07 10:08:05,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037515700] [2019-12-07 10:08:05,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 10:08:05,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:05,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 10:08:05,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:08:05,358 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 29 states. [2019-12-07 10:08:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:06,026 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-12-07 10:08:06,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:08:06,026 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 94 [2019-12-07 10:08:06,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:06,027 INFO L225 Difference]: With dead ends: 120 [2019-12-07 10:08:06,027 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 10:08:06,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 10:08:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 10:08:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2019-12-07 10:08:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 10:08:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2019-12-07 10:08:06,029 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 94 [2019-12-07 10:08:06,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:06,029 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2019-12-07 10:08:06,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 10:08:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2019-12-07 10:08:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 10:08:06,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:06,030 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:06,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:06,231 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:06,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1601576531, now seen corresponding path program 7 times [2019-12-07 10:08:06,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:06,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558065277] [2019-12-07 10:08:06,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 77 proven. 71 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 10:08:06,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558065277] [2019-12-07 10:08:06,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856870131] [2019-12-07 10:08:06,455 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:06,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 10:08:06,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:06,542 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_31|], 1=[|v_#valid_36|]} [2019-12-07 10:08:06,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:08:06,546 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-12-07 10:08:06,546 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:06,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:06,554 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-12-07 10:08:06,554 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:06,559 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:06,559 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:06,560 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-12-07 10:08:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 120 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 10:08:06,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:06,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-12-07 10:08:06,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777353529] [2019-12-07 10:08:06,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 10:08:06,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:06,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 10:08:06,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2019-12-07 10:08:06,798 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 31 states. [2019-12-07 10:08:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:07,196 INFO L93 Difference]: Finished difference Result 198 states and 202 transitions. [2019-12-07 10:08:07,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:08:07,196 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-12-07 10:08:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:07,197 INFO L225 Difference]: With dead ends: 198 [2019-12-07 10:08:07,197 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 10:08:07,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=1235, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 10:08:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 10:08:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-12-07 10:08:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 10:08:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2019-12-07 10:08:07,200 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 104 [2019-12-07 10:08:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:07,200 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2019-12-07 10:08:07,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 10:08:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2019-12-07 10:08:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 10:08:07,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:07,201 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:07,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:07,402 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1691931792, now seen corresponding path program 8 times [2019-12-07 10:08:07,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:07,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858050112] [2019-12-07 10:08:07,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 20 proven. 173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:08,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858050112] [2019-12-07 10:08:08,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099627315] [2019-12-07 10:08:08,190 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:08,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:08:08,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:08:08,271 INFO L264 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 10:08:08,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:08,493 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 14 treesize of output 10 [2019-12-07 10:08:08,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:08,509 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:08,509 INFO L534 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-12-07 10:08:08,510 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-12-07 10:08:09,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:09,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 48 [2019-12-07 10:08:09,106 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:09,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:09,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:08:09,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:09,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:09,120 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:09,120 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:62 [2019-12-07 10:08:09,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 15 proven. 133 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 10:08:09,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:09,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 21] total 50 [2019-12-07 10:08:09,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396341194] [2019-12-07 10:08:09,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-12-07 10:08:09,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:09,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-12-07 10:08:09,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 10:08:09,326 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 50 states. [2019-12-07 10:08:11,874 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-12-07 10:08:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:20,190 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2019-12-07 10:08:20,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 10:08:20,191 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 108 [2019-12-07 10:08:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:20,192 INFO L225 Difference]: With dead ends: 197 [2019-12-07 10:08:20,192 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 10:08:20,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=626, Invalid=7564, Unknown=0, NotChecked=0, Total=8190 [2019-12-07 10:08:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 10:08:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2019-12-07 10:08:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 10:08:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2019-12-07 10:08:20,202 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 108 [2019-12-07 10:08:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:20,203 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2019-12-07 10:08:20,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-12-07 10:08:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2019-12-07 10:08:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 10:08:20,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:20,204 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:20,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:20,405 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:20,405 INFO L82 PathProgramCache]: Analyzing trace with hash 609270721, now seen corresponding path program 9 times [2019-12-07 10:08:20,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:20,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597880462] [2019-12-07 10:08:20,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 121 proven. 98 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 10:08:20,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597880462] [2019-12-07 10:08:20,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029080897] [2019-12-07 10:08:20,609 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:20,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-12-07 10:08:20,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:08:20,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 10:08:20,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:20,815 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_32|], 1=[|v_#valid_37|]} [2019-12-07 10:08:20,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:08:20,818 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-12-07 10:08:20,819 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:20,826 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:20,829 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-12-07 10:08:20,829 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:20,835 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:20,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:20,836 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 10:08:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 174 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 10:08:21,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:21,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2019-12-07 10:08:21,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663741807] [2019-12-07 10:08:21,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 10:08:21,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 10:08:21,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 10:08:21,135 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand 34 states. [2019-12-07 10:08:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:21,637 INFO L93 Difference]: Finished difference Result 230 states and 234 transitions. [2019-12-07 10:08:21,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 10:08:21,638 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 122 [2019-12-07 10:08:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:21,639 INFO L225 Difference]: With dead ends: 230 [2019-12-07 10:08:21,639 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 10:08:21,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=1509, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 10:08:21,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 10:08:21,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2019-12-07 10:08:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-07 10:08:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2019-12-07 10:08:21,642 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 122 [2019-12-07 10:08:21,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:21,643 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2019-12-07 10:08:21,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 10:08:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2019-12-07 10:08:21,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-07 10:08:21,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:21,644 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:21,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:21,844 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:21,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:21,844 INFO L82 PathProgramCache]: Analyzing trace with hash 688233374, now seen corresponding path program 10 times [2019-12-07 10:08:21,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:21,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027289794] [2019-12-07 10:08:21,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 24 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:22,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027289794] [2019-12-07 10:08:22,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063102423] [2019-12-07 10:08:22,648 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:22,732 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:08:22,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:08:22,734 INFO L264 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 10:08:22,737 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:22,750 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:22,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12-07 10:08:22,751 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:22,762 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 10:08:22,762 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:22,762 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 10:08:22,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 10:08:22,986 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:22,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:22,990 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:22,990 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 10:08:23,354 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 24 treesize of output 18 [2019-12-07 10:08:23,355 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:08:23,363 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:23,363 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 10:08:23,363 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:35 [2019-12-07 10:08:23,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:23,651 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:08:23,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:23,664 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2019-12-07 10:08:23,665 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:23,679 INFO L614 ElimStorePlain]: treesize reduction 26, result has 36.6 percent of original size [2019-12-07 10:08:23,679 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:23,679 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:39, output treesize:3 [2019-12-07 10:08:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 144 proven. 75 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 10:08:23,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:23,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25] total 53 [2019-12-07 10:08:23,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80765657] [2019-12-07 10:08:23,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-12-07 10:08:23,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:23,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-12-07 10:08:23,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2573, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 10:08:23,731 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 53 states. [2019-12-07 10:08:24,959 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-07 10:08:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:28,218 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2019-12-07 10:08:28,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 10:08:28,218 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 126 [2019-12-07 10:08:28,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:28,219 INFO L225 Difference]: With dead ends: 210 [2019-12-07 10:08:28,219 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 10:08:28,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=608, Invalid=7224, Unknown=0, NotChecked=0, Total=7832 [2019-12-07 10:08:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 10:08:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2019-12-07 10:08:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-12-07 10:08:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2019-12-07 10:08:28,224 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 126 [2019-12-07 10:08:28,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:28,224 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2019-12-07 10:08:28,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-12-07 10:08:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2019-12-07 10:08:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 10:08:28,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:28,225 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:28,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:28,425 INFO L410 AbstractCegarLoop]: === Iteration 37 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:28,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:28,426 INFO L82 PathProgramCache]: Analyzing trace with hash -934966853, now seen corresponding path program 11 times [2019-12-07 10:08:28,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:28,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600358375] [2019-12-07 10:08:28,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 47 proven. 193 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 10:08:28,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600358375] [2019-12-07 10:08:28,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924284263] [2019-12-07 10:08:28,688 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:28,894 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-07 10:08:28,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:08:28,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 10:08:28,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:28,908 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:28,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, 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-12-07 10:08:28,908 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:28,921 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 10:08:28,922 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:28,922 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 10:08:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 45 proven. 195 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 10:08:29,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:29,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 25 [2019-12-07 10:08:29,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671362300] [2019-12-07 10:08:29,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 10:08:29,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:29,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 10:08:29,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:08:29,066 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand 26 states. [2019-12-07 10:08:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:30,133 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2019-12-07 10:08:30,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:08:30,133 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2019-12-07 10:08:30,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:30,134 INFO L225 Difference]: With dead ends: 156 [2019-12-07 10:08:30,134 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 10:08:30,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 10:08:30,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 10:08:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2019-12-07 10:08:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 10:08:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2019-12-07 10:08:30,137 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 130 [2019-12-07 10:08:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:30,137 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2019-12-07 10:08:30,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 10:08:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2019-12-07 10:08:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 10:08:30,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:30,138 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:30,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:30,339 INFO L410 AbstractCegarLoop]: === Iteration 38 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:30,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1005060817, now seen corresponding path program 12 times [2019-12-07 10:08:30,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:30,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067544282] [2019-12-07 10:08:30,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 175 proven. 129 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 10:08:30,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067544282] [2019-12-07 10:08:30,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012875959] [2019-12-07 10:08:30,594 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:30,855 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-07 10:08:30,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:08:30,858 INFO L264 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 81 conjunts are in the unsatisfiable core [2019-12-07 10:08:30,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:30,863 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-12-07 10:08:30,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:30,869 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:30,869 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:30,869 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-12-07 10:08:31,184 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 14 treesize of output 10 [2019-12-07 10:08:31,184 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:31,191 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:31,192 INFO L534 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-12-07 10:08:31,192 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2019-12-07 10:08:31,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-12-07 10:08:31,228 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:31,236 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:31,236 INFO L534 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-12-07 10:08:31,236 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2019-12-07 10:08:31,697 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:08:31,697 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 26 treesize of output 10 [2019-12-07 10:08:31,698 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:31,702 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:31,702 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:31,702 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:3 [2019-12-07 10:08:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 28 proven. 341 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:08:31,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:31,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28] total 47 [2019-12-07 10:08:31,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003588401] [2019-12-07 10:08:31,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-07 10:08:31,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:31,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-07 10:08:31,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2021, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 10:08:31,865 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 47 states. [2019-12-07 10:08:35,085 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-12-07 10:08:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:37,324 INFO L93 Difference]: Finished difference Result 257 states and 261 transitions. [2019-12-07 10:08:37,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 10:08:37,325 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 140 [2019-12-07 10:08:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:37,325 INFO L225 Difference]: With dead ends: 257 [2019-12-07 10:08:37,325 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 10:08:37,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=387, Invalid=4869, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 10:08:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 10:08:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-12-07 10:08:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 10:08:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2019-12-07 10:08:37,328 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 140 [2019-12-07 10:08:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:37,328 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2019-12-07 10:08:37,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-07 10:08:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2019-12-07 10:08:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 10:08:37,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:37,329 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:37,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:37,529 INFO L410 AbstractCegarLoop]: === Iteration 39 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:37,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2064220108, now seen corresponding path program 13 times [2019-12-07 10:08:37,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:37,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128637276] [2019-12-07 10:08:37,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 28 proven. 367 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:38,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128637276] [2019-12-07 10:08:38,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906497078] [2019-12-07 10:08:38,442 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:38,534 INFO L264 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 61 conjunts are in the unsatisfiable core [2019-12-07 10:08:38,536 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:38,821 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 14 treesize of output 10 [2019-12-07 10:08:38,821 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:38,826 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:38,826 INFO L534 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-12-07 10:08:38,826 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-12-07 10:08:39,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:39,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:39,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-12-07 10:08:39,566 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:39,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:39,567 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:39,567 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-12-07 10:08:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 28 proven. 276 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 10:08:39,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:39,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 28] total 58 [2019-12-07 10:08:39,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215244648] [2019-12-07 10:08:39,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-12-07 10:08:39,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:39,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-12-07 10:08:39,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3117, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 10:08:39,606 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 58 states. [2019-12-07 10:08:42,431 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 10:08:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:44,288 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-12-07 10:08:44,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 10:08:44,288 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 144 [2019-12-07 10:08:44,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:44,290 INFO L225 Difference]: With dead ends: 238 [2019-12-07 10:08:44,290 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 10:08:44,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1906 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=483, Invalid=7349, Unknown=0, NotChecked=0, Total=7832 [2019-12-07 10:08:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 10:08:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2019-12-07 10:08:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 10:08:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2019-12-07 10:08:44,294 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 144 [2019-12-07 10:08:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:44,295 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2019-12-07 10:08:44,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-12-07 10:08:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2019-12-07 10:08:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 10:08:44,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:44,296 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:44,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:44,497 INFO L410 AbstractCegarLoop]: === Iteration 40 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:44,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2059362473, now seen corresponding path program 14 times [2019-12-07 10:08:44,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:44,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406009248] [2019-12-07 10:08:44,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 68 proven. 261 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 10:08:44,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406009248] [2019-12-07 10:08:44,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717808187] [2019-12-07 10:08:44,777 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:44,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:08:44,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:08:44,878 INFO L264 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 10:08:44,880 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:44,889 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:44,889 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-12-07 10:08:44,890 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:44,900 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 10:08:44,900 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:44,901 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 10:08:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 66 proven. 263 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 10:08:45,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:45,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 28 [2019-12-07 10:08:45,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106321200] [2019-12-07 10:08:45,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 10:08:45,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:45,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 10:08:45,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:08:45,083 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand 29 states. [2019-12-07 10:08:46,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:46,620 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2019-12-07 10:08:46,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 10:08:46,621 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 148 [2019-12-07 10:08:46,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:46,623 INFO L225 Difference]: With dead ends: 174 [2019-12-07 10:08:46,623 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 10:08:46,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=1319, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 10:08:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 10:08:46,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2019-12-07 10:08:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-12-07 10:08:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 169 transitions. [2019-12-07 10:08:46,628 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 169 transitions. Word has length 148 [2019-12-07 10:08:46,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:46,628 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 169 transitions. [2019-12-07 10:08:46,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 10:08:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 169 transitions. [2019-12-07 10:08:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 10:08:46,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:46,630 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:46,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:46,831 INFO L410 AbstractCegarLoop]: === Iteration 41 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:46,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:46,831 INFO L82 PathProgramCache]: Analyzing trace with hash 224166557, now seen corresponding path program 15 times [2019-12-07 10:08:46,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:46,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330883801] [2019-12-07 10:08:46,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 239 proven. 164 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 10:08:47,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330883801] [2019-12-07 10:08:47,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368057514] [2019-12-07 10:08:47,102 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:47,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-07 10:08:47,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:08:47,363 INFO L264 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 72 conjunts are in the unsatisfiable core [2019-12-07 10:08:47,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:47,367 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_39|]} [2019-12-07 10:08:47,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:08:47,370 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-12-07 10:08:47,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:47,377 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:47,379 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-12-07 10:08:47,379 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:47,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:47,385 INFO L534 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-12-07 10:08:47,385 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-12-07 10:08:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 312 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:48,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:48,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 31] total 52 [2019-12-07 10:08:48,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602864055] [2019-12-07 10:08:48,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 10:08:48,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:48,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 10:08:48,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2337, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 10:08:48,497 INFO L87 Difference]: Start difference. First operand 166 states and 169 transitions. Second operand 52 states. [2019-12-07 10:08:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:53,346 INFO L93 Difference]: Finished difference Result 392 states and 396 transitions. [2019-12-07 10:08:53,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 10:08:53,346 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 158 [2019-12-07 10:08:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:53,347 INFO L225 Difference]: With dead ends: 392 [2019-12-07 10:08:53,347 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 10:08:53,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2271 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=766, Invalid=6206, Unknown=0, NotChecked=0, Total=6972 [2019-12-07 10:08:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 10:08:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2019-12-07 10:08:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 10:08:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 173 transitions. [2019-12-07 10:08:53,351 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 173 transitions. Word has length 158 [2019-12-07 10:08:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:53,351 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 173 transitions. [2019-12-07 10:08:53,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 10:08:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 173 transitions. [2019-12-07 10:08:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 10:08:53,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:53,352 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:53,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:53,553 INFO L410 AbstractCegarLoop]: === Iteration 42 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:08:53,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:53,553 INFO L82 PathProgramCache]: Analyzing trace with hash -248547334, now seen corresponding path program 16 times [2019-12-07 10:08:53,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:53,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070295921] [2019-12-07 10:08:53,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 32 proven. 491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:54,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070295921] [2019-12-07 10:08:54,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033123135] [2019-12-07 10:08:54,814 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:54,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:08:54,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:08:54,911 INFO L264 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 10:08:54,913 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:54,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:54,923 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-12-07 10:08:54,923 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:54,940 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 10:08:54,940 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:54,941 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 10:08:55,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 10:08:55,326 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:55,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:55,329 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:55,329 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 10:08:55,801 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 24 treesize of output 18 [2019-12-07 10:08:55,802 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:08:55,809 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:55,809 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 10:08:55,809 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:35 [2019-12-07 10:08:55,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:56,051 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:08:56,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:56,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2019-12-07 10:08:56,062 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:56,072 INFO L614 ElimStorePlain]: treesize reduction 26, result has 36.6 percent of original size [2019-12-07 10:08:56,072 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:56,073 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:39, output treesize:3 [2019-12-07 10:08:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 270 proven. 133 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 10:08:56,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:56,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 29] total 64 [2019-12-07 10:08:56,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912904725] [2019-12-07 10:08:56,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-12-07 10:08:56,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:56,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-12-07 10:08:56,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3776, Unknown=0, NotChecked=0, Total=4032 [2019-12-07 10:08:56,146 INFO L87 Difference]: Start difference. First operand 170 states and 173 transitions. Second operand 64 states. [2019-12-07 10:09:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:03,988 INFO L93 Difference]: Finished difference Result 266 states and 269 transitions. [2019-12-07 10:09:03,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-07 10:09:03,988 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 162 [2019-12-07 10:09:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:03,989 INFO L225 Difference]: With dead ends: 266 [2019-12-07 10:09:03,989 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 10:09:03,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2616 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=778, Invalid=10564, Unknown=0, NotChecked=0, Total=11342 [2019-12-07 10:09:03,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 10:09:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 174. [2019-12-07 10:09:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 10:09:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 177 transitions. [2019-12-07 10:09:03,992 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 177 transitions. Word has length 162 [2019-12-07 10:09:03,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:03,992 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 177 transitions. [2019-12-07 10:09:03,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-12-07 10:09:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 177 transitions. [2019-12-07 10:09:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 10:09:03,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:03,993 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:04,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:09:04,194 INFO L410 AbstractCegarLoop]: === Iteration 43 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:09:04,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:04,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1474028649, now seen corresponding path program 17 times [2019-12-07 10:09:04,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:04,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788923373] [2019-12-07 10:09:04,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 93 proven. 339 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 10:09:04,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788923373] [2019-12-07 10:09:04,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012619719] [2019-12-07 10:09:04,515 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:09:04,779 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-12-07 10:09:04,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:09:04,783 INFO L264 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-07 10:09:04,785 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:09:04,795 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:09:04,796 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-12-07 10:09:04,796 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:09:04,811 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 10:09:04,811 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:09:04,811 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 10:09:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 66 proven. 366 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 10:09:05,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:09:05,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 34 [2019-12-07 10:09:05,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655123900] [2019-12-07 10:09:05,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 10:09:05,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:05,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 10:09:05,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 10:09:05,117 INFO L87 Difference]: Start difference. First operand 174 states and 177 transitions. Second operand 35 states. [2019-12-07 10:09:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:07,313 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2019-12-07 10:09:07,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 10:09:07,314 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 166 [2019-12-07 10:09:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:07,316 INFO L225 Difference]: With dead ends: 192 [2019-12-07 10:09:07,316 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 10:09:07,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=1862, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 10:09:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 10:09:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2019-12-07 10:09:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-12-07 10:09:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 187 transitions. [2019-12-07 10:09:07,322 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 187 transitions. Word has length 166 [2019-12-07 10:09:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:07,323 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 187 transitions. [2019-12-07 10:09:07,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 10:09:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 187 transitions. [2019-12-07 10:09:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-07 10:09:07,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:07,325 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:07,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:09:07,526 INFO L410 AbstractCegarLoop]: === Iteration 44 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2019-12-07 10:09:07,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:07,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1681845259, now seen corresponding path program 18 times [2019-12-07 10:09:07,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:07,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439460333] [2019-12-07 10:09:07,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 313 proven. 203 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 10:09:07,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439460333] [2019-12-07 10:09:07,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763827224] [2019-12-07 10:09:07,866 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:09:08,396 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-12-07 10:09:08,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:09:08,399 INFO L264 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 10:09:08,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:09:08,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:09:08,411 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-12-07 10:09:08,412 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:09:08,422 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 10:09:08,422 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:09:08,422 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 10:09:08,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 10:09:08,441 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:09:08,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:09:08,442 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:09:08,442 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 10:09:08,631 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:09:08,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2019-12-07 10:09:08,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:09:08,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:09:08,642 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:09:08,642 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:23 [2019-12-07 10:09:08,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:09:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 40 proven. 52 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-12-07 10:09:08,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:09:08,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12] total 36 [2019-12-07 10:09:08,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38946070] [2019-12-07 10:09:08,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 10:09:08,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:08,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 10:09:08,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 10:09:08,787 INFO L87 Difference]: Start difference. First operand 184 states and 187 transitions. Second operand 36 states. [2019-12-07 10:09:12,159 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-12-07 10:09:12,606 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-07 10:09:13,484 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-12-07 10:09:14,150 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-12-07 10:09:14,363 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-12-07 10:09:14,632 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-07 10:09:14,903 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-12-07 10:09:16,155 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-12-07 10:09:16,458 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-07 10:09:16,731 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-12-07 10:09:18,792 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-12-07 10:09:19,314 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-07 10:09:19,630 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-12-07 10:09:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:20,030 INFO L93 Difference]: Finished difference Result 324 states and 328 transitions. [2019-12-07 10:09:20,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-12-07 10:09:20,031 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 176 [2019-12-07 10:09:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:20,032 INFO L225 Difference]: With dead ends: 324 [2019-12-07 10:09:20,032 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:09:20,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4187 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2362, Invalid=13894, Unknown=0, NotChecked=0, Total=16256 [2019-12-07 10:09:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:09:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:09:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:09:20,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:09:20,035 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2019-12-07 10:09:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:20,035 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:09:20,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 10:09:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:09:20,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:09:20,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:09:20,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:09:20 BoogieIcfgContainer [2019-12-07 10:09:20,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:09:20,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:09:20,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:09:20,241 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:09:20,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:30" (3/4) ... [2019-12-07 10:09:20,244 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:09:20,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 10:09:20,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 10:09:20,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 10:09:20,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-07 10:09:20,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-07 10:09:20,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 10:09:20,251 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncmp [2019-12-07 10:09:20,251 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-07 10:09:20,255 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-12-07 10:09:20,255 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 10:09:20,256 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 10:09:20,256 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 10:09:20,293 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_385de29e-549f-4c2c-8734-71c08ec87a9a/bin/uautomizer/witness.graphml [2019-12-07 10:09:20,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:09:20,294 INFO L168 Benchmark]: Toolchain (without parser) took 110811.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 934.0 MB in the beginning and 924.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 162.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:20,294 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:09:20,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:20,295 INFO L168 Benchmark]: Boogie Preprocessor took 40.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:20,295 INFO L168 Benchmark]: RCFGBuilder took 335.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:20,295 INFO L168 Benchmark]: TraceAbstraction took 110073.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.0 GB in the beginning and 933.8 MB in the end (delta: 77.9 MB). Peak memory consumption was 141.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:20,296 INFO L168 Benchmark]: Witness Printer took 52.49 ms. Allocated memory is still 1.2 GB. Free memory was 933.8 MB in the beginning and 924.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:20,297 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 335.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 110073.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.0 GB in the beginning and 933.8 MB in the end (delta: 77.9 MB). Peak memory consumption was 141.9 MB. Max. memory is 11.5 GB. * Witness Printer took 52.49 ms. Allocated memory is still 1.2 GB. Free memory was 933.8 MB in the beginning and 924.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 525]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 525]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 81 locations, 19 error locations. Result: SAFE, OverallTime: 110.0s, OverallIterations: 44, TraceHistogramMax: 10, AutomataDifference: 80.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2124 SDtfs, 7308 SDslu, 7474 SDs, 0 SdLazy, 42436 SolverSat, 932 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 41.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3659 GetRequests, 2215 SyntacticMatches, 30 SemanticMatches, 1414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21915 ImplicationChecksByTransitivity, 49.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 44 MinimizatonAttempts, 216 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 5316 NumberOfCodeBlocks, 5270 NumberOfCodeBlocksAsserted, 132 NumberOfCheckSat, 5246 ConstructedInterpolants, 397 QuantifiedInterpolants, 6883412 SizeOfPredicates, 275 NumberOfNonLiveVariables, 9176 ConjunctsInSsa, 1001 ConjunctsInUnsatCore, 70 InterpolantComputations, 19 PerfectInterpolantSequences, 4932/10530 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...