./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.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_ad2945da-24ff-486e-87d5-d701d2979b07/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 f3eebd0d696af164582cbeee8be4a910d35e299c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:18:21,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:18:21,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:18:21,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:18:21,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:18:21,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:18:21,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:18:21,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:18:21,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:18:21,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:18:21,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:18:21,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:18:21,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:18:21,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:18:21,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:18:21,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:18:21,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:18:21,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:18:21,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:18:21,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:18:21,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:18:21,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:18:21,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:18:21,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:18:21,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:18:21,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:18:21,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:18:21,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:18:21,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:18:21,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:18:21,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:18:21,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:18:21,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:18:21,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:18:21,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:18:21,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:18:21,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:18:21,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:18:21,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:18:21,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:18:21,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:18:21,307 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 15:18:21,316 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:18:21,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:18:21,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:18:21,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:18:21,317 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:18:21,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:18:21,317 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:18:21,318 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 15:18:21,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:18:21,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:18:21,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:18:21,318 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 15:18:21,318 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 15:18:21,318 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 15:18:21,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:18:21,319 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:18:21,319 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:18:21,319 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:18:21,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:18:21,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:18:21,319 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:18:21,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:18:21,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:18:21,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:18:21,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:18:21,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:18:21,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:18:21,320 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:18:21,320 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_ad2945da-24ff-486e-87d5-d701d2979b07/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 -> f3eebd0d696af164582cbeee8be4a910d35e299c [2019-12-07 15:18:21,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:18:21,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:18:21,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:18:21,429 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:18:21,429 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:18:21,430 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2019-12-07 15:18:21,466 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/bin/uautomizer/data/c603914b8/61799e737fe1484194dc67a1e0a71972/FLAG9ce9387de [2019-12-07 15:18:21,914 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:18:21,914 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2019-12-07 15:18:21,923 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/bin/uautomizer/data/c603914b8/61799e737fe1484194dc67a1e0a71972/FLAG9ce9387de [2019-12-07 15:18:21,932 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/bin/uautomizer/data/c603914b8/61799e737fe1484194dc67a1e0a71972 [2019-12-07 15:18:21,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:18:21,935 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 15:18:21,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:18:21,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:18:21,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:18:21,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:18:21" (1/1) ... [2019-12-07 15:18:21,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5589b06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:18:21, skipping insertion in model container [2019-12-07 15:18:21,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:18:21" (1/1) ... [2019-12-07 15:18:21,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:18:21,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:18:22,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:18:22,176 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:18:22,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:18:22,236 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:18:22,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:18:22 WrapperNode [2019-12-07 15:18:22,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:18:22,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:18:22,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:18:22,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:18:22,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:18:22" (1/1) ... [2019-12-07 15:18:22,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:18:22" (1/1) ... [2019-12-07 15:18:22,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:18:22" (1/1) ... [2019-12-07 15:18:22,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:18:22" (1/1) ... [2019-12-07 15:18:22,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:18:22" (1/1) ... [2019-12-07 15:18:22,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:18:22" (1/1) ... [2019-12-07 15:18:22,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:18:22" (1/1) ... [2019-12-07 15:18:22,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:18:22,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:18:22,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:18:22,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:18:22,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:18:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:22,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 15:18:22,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:18:22,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 15:18:22,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 15:18:22,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 15:18:22,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 15:18:22,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 15:18:22,314 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2019-12-07 15:18:22,314 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 15:18:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 15:18:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 15:18:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 15:18:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 15:18:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 15:18:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 15:18:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 15:18:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 15:18:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 15:18:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 15:18:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 15:18:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 15:18:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 15:18:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 15:18:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 15:18:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 15:18:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 15:18:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 15:18:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 15:18:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 15:18:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 15:18:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 15:18:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 15:18:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 15:18:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 15:18:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 15:18:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 15:18:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 15:18:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 15:18:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 15:18:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 15:18:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 15:18:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 15:18:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 15:18:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 15:18:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 15:18:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 15:18:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 15:18:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 15:18:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 15:18:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 15:18:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 15:18:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 15:18:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 15:18:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 15:18:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 15:18:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 15:18:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 15:18:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 15:18:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 15:18:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:18:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:18:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 15:18:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:18:22,593 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:18:22,593 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-12-07 15:18:22,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:18:22 BoogieIcfgContainer [2019-12-07 15:18:22,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:18:22,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:18:22,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:18:22,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:18:22,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:18:21" (1/3) ... [2019-12-07 15:18:22,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4f4b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:18:22, skipping insertion in model container [2019-12-07 15:18:22,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:18:22" (2/3) ... [2019-12-07 15:18:22,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4f4b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:18:22, skipping insertion in model container [2019-12-07 15:18:22,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:18:22" (3/3) ... [2019-12-07 15:18:22,601 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca-2.i [2019-12-07 15:18:22,610 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:18:22,614 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 15:18:22,622 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 15:18:22,635 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:18:22,635 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 15:18:22,636 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:18:22,636 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:18:22,636 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:18:22,636 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:18:22,636 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:18:22,636 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:18:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-12-07 15:18:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 15:18:22,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:22,653 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:22,653 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 15:18:22,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:22,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1096953401, now seen corresponding path program 1 times [2019-12-07 15:18:22,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:22,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680241824] [2019-12-07 15:18:22,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:22,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 15:18:22,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680241824] [2019-12-07 15:18:22,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:22,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:18:22,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628566088] [2019-12-07 15:18:22,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:18:22,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:22,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:18:22,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:18:22,820 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 5 states. [2019-12-07 15:18:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:22,962 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2019-12-07 15:18:22,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:18:22,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 15:18:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:22,970 INFO L225 Difference]: With dead ends: 85 [2019-12-07 15:18:22,971 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 15:18:22,972 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 15:18:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 15:18:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2019-12-07 15:18:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 15:18:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-12-07 15:18:23,001 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 11 [2019-12-07 15:18:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:23,001 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-12-07 15:18:23,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:18:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-12-07 15:18:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 15:18:23,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:23,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:23,002 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 15:18:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:23,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1095106359, now seen corresponding path program 1 times [2019-12-07 15:18:23,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:23,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633082768] [2019-12-07 15:18:23,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,066 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 15:18:23,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633082768] [2019-12-07 15:18:23,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:23,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:18:23,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348742058] [2019-12-07 15:18:23,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:18:23,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:23,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:18:23,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:18:23,069 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 5 states. [2019-12-07 15:18:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:23,197 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2019-12-07 15:18:23,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:18:23,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 15:18:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:23,199 INFO L225 Difference]: With dead ends: 86 [2019-12-07 15:18:23,199 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 15:18:23,200 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 15:18:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 15:18:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 65. [2019-12-07 15:18:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 15:18:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-12-07 15:18:23,206 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 11 [2019-12-07 15:18:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:23,206 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-12-07 15:18:23,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:18:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-12-07 15:18:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 15:18:23,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:23,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:23,207 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 15:18:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:23,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1095106360, now seen corresponding path program 1 times [2019-12-07 15:18:23,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:23,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602387867] [2019-12-07 15:18:23,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:18:23,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602387867] [2019-12-07 15:18:23,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:23,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:18:23,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599307018] [2019-12-07 15:18:23,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:18:23,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:23,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:18:23,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:18:23,239 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 4 states. [2019-12-07 15:18:23,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:23,314 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2019-12-07 15:18:23,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:18:23,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 15:18:23,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:23,315 INFO L225 Difference]: With dead ends: 63 [2019-12-07 15:18:23,315 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 15:18:23,316 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 15:18:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 15:18:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 15:18:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 15:18:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2019-12-07 15:18:23,320 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 11 [2019-12-07 15:18:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:23,321 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2019-12-07 15:18:23,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:18:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2019-12-07 15:18:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:18:23,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:23,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:23,322 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 15:18:23,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:23,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1905282242, now seen corresponding path program 1 times [2019-12-07 15:18:23,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:23,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951747728] [2019-12-07 15:18:23,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,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 15:18:23,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951747728] [2019-12-07 15:18:23,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:23,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:18:23,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370834822] [2019-12-07 15:18:23,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:18:23,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:23,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:18:23,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:18:23,365 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 5 states. [2019-12-07 15:18:23,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:23,445 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-12-07 15:18:23,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:18:23,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 15:18:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:23,446 INFO L225 Difference]: With dead ends: 62 [2019-12-07 15:18:23,446 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 15:18:23,447 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 15:18:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 15:18:23,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 15:18:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 15:18:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2019-12-07 15:18:23,451 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 13 [2019-12-07 15:18:23,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:23,451 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2019-12-07 15:18:23,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:18:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2019-12-07 15:18:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:18:23,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:23,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:23,452 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 15:18:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1905282190, now seen corresponding path program 1 times [2019-12-07 15:18:23,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:23,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729127776] [2019-12-07 15:18:23,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,480 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 15:18:23,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729127776] [2019-12-07 15:18:23,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:23,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:18:23,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111724228] [2019-12-07 15:18:23,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:18:23,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:23,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:18:23,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:18:23,481 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 4 states. [2019-12-07 15:18:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:23,548 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-12-07 15:18:23,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:18:23,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 15:18:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:23,549 INFO L225 Difference]: With dead ends: 60 [2019-12-07 15:18:23,550 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 15:18:23,550 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 15:18:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 15:18:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-12-07 15:18:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 15:18:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-12-07 15:18:23,553 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 13 [2019-12-07 15:18:23,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:23,554 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-12-07 15:18:23,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:18:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-12-07 15:18:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:18:23,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:23,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:23,554 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 15:18:23,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:23,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1905282189, now seen corresponding path program 1 times [2019-12-07 15:18:23,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:23,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58785579] [2019-12-07 15:18:23,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,587 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 15:18:23,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58785579] [2019-12-07 15:18:23,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:23,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:18:23,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410078553] [2019-12-07 15:18:23,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:18:23,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:23,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:18:23,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:18:23,589 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 5 states. [2019-12-07 15:18:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:23,666 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2019-12-07 15:18:23,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:18:23,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 15:18:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:23,667 INFO L225 Difference]: With dead ends: 80 [2019-12-07 15:18:23,667 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 15:18:23,667 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 15:18:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 15:18:23,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-12-07 15:18:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 15:18:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2019-12-07 15:18:23,672 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 13 [2019-12-07 15:18:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:23,672 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2019-12-07 15:18:23,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:18:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2019-12-07 15:18:23,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:18:23,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:23,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:23,673 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 15:18:23,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:23,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1848023887, now seen corresponding path program 1 times [2019-12-07 15:18:23,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:23,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71113146] [2019-12-07 15:18:23,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,727 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 15:18:23,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71113146] [2019-12-07 15:18:23,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:23,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:18:23,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328442566] [2019-12-07 15:18:23,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:18:23,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:23,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:18:23,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:18:23,729 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand 6 states. [2019-12-07 15:18:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:23,830 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-12-07 15:18:23,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:18:23,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 15:18:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:23,831 INFO L225 Difference]: With dead ends: 83 [2019-12-07 15:18:23,831 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 15:18:23,831 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 15:18:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 15:18:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2019-12-07 15:18:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 15:18:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2019-12-07 15:18:23,837 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 13 [2019-12-07 15:18:23,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:23,837 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2019-12-07 15:18:23,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:18:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2019-12-07 15:18:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:18:23,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:23,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:23,838 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 15:18:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:23,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1065792642, now seen corresponding path program 1 times [2019-12-07 15:18:23,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:23,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113163205] [2019-12-07 15:18:23,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,875 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 15:18:23,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113163205] [2019-12-07 15:18:23,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:23,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:18:23,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365806342] [2019-12-07 15:18:23,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:18:23,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:23,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:18:23,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:18:23,877 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand 5 states. [2019-12-07 15:18:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:23,937 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2019-12-07 15:18:23,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:18:23,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 15:18:23,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:23,937 INFO L225 Difference]: With dead ends: 72 [2019-12-07 15:18:23,938 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 15:18:23,938 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 15:18:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 15:18:23,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-12-07 15:18:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 15:18:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2019-12-07 15:18:23,942 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 14 [2019-12-07 15:18:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:23,942 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-12-07 15:18:23,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:18:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2019-12-07 15:18:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 15:18:23,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:23,943 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:23,943 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 15:18:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:23,944 INFO L82 PathProgramCache]: Analyzing trace with hash -591541108, now seen corresponding path program 1 times [2019-12-07 15:18:23,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:23,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668893090] [2019-12-07 15:18:23,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:23,998 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 15:18:23,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668893090] [2019-12-07 15:18:23,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354547221] [2019-12-07 15:18:23,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:24,057 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 15:18:24,061 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:24,089 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-12-07 15:18:24,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:18:24,101 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 15:18:24,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:24,109 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:24,114 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 15:18:24,114 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:24,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:24,121 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 15:18:24,121 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 15:18:24,131 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 15:18:24,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:24,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-12-07 15:18:24,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572723911] [2019-12-07 15:18:24,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:18:24,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:24,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:18:24,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:18:24,132 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 7 states. [2019-12-07 15:18:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:24,246 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2019-12-07 15:18:24,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:18:24,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 15:18:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:24,246 INFO L225 Difference]: With dead ends: 92 [2019-12-07 15:18:24,247 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 15:18:24,247 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 15:18:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 15:18:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2019-12-07 15:18:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 15:18:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-12-07 15:18:24,250 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 15 [2019-12-07 15:18:24,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:24,250 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-12-07 15:18:24,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:18:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-12-07 15:18:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 15:18:24,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:24,251 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:24,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:24,452 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 15:18:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:24,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2008977164, now seen corresponding path program 1 times [2019-12-07 15:18:24,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:24,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868022487] [2019-12-07 15:18:24,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:24,524 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 15:18:24,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868022487] [2019-12-07 15:18:24,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891618227] [2019-12-07 15:18:24,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:24,578 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 15:18:24,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:24,591 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:24,591 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 15:18:24,592 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:24,603 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 15:18:24,603 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 15:18:24,603 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 15:18:24,612 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 15:18:24,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:24,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-12-07 15:18:24,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195426015] [2019-12-07 15:18:24,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:18:24,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:24,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:18:24,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:18:24,613 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 7 states. [2019-12-07 15:18:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:24,715 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2019-12-07 15:18:24,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:18:24,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 15:18:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:24,716 INFO L225 Difference]: With dead ends: 75 [2019-12-07 15:18:24,716 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 15:18:24,717 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 15:18:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 15:18:24,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2019-12-07 15:18:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 15:18:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2019-12-07 15:18:24,719 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 17 [2019-12-07 15:18:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:24,719 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2019-12-07 15:18:24,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:18:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2019-12-07 15:18:24,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 15:18:24,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:24,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:24,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:24,921 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 15:18:24,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:24,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1968803502, now seen corresponding path program 1 times [2019-12-07 15:18:24,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:24,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308744045] [2019-12-07 15:18:24,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:24,978 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 15:18:24,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308744045] [2019-12-07 15:18:24,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:24,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:18:24,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66599964] [2019-12-07 15:18:24,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:18:24,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:24,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:18:24,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:18:24,980 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 6 states. [2019-12-07 15:18:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:25,064 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-12-07 15:18:25,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:18:25,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-07 15:18:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:25,065 INFO L225 Difference]: With dead ends: 62 [2019-12-07 15:18:25,065 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 15:18:25,065 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 15:18:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 15:18:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 15:18:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 15:18:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2019-12-07 15:18:25,068 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 19 [2019-12-07 15:18:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:25,068 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2019-12-07 15:18:25,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:18:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2019-12-07 15:18:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 15:18:25,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:25,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:25,069 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 15:18:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1968803501, now seen corresponding path program 1 times [2019-12-07 15:18:25,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:25,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523403226] [2019-12-07 15:18:25,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,122 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 15:18:25,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523403226] [2019-12-07 15:18:25,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:25,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:18:25,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296458024] [2019-12-07 15:18:25,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:18:25,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:25,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:18:25,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:18:25,123 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 8 states. [2019-12-07 15:18:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:25,265 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-12-07 15:18:25,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:18:25,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 15:18:25,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:25,267 INFO L225 Difference]: With dead ends: 76 [2019-12-07 15:18:25,267 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 15:18:25,268 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 15:18:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 15:18:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2019-12-07 15:18:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 15:18:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2019-12-07 15:18:25,270 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 19 [2019-12-07 15:18:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:25,270 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2019-12-07 15:18:25,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:18:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2019-12-07 15:18:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 15:18:25,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:25,271 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 15:18:25,271 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 15:18:25,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2060413811, now seen corresponding path program 1 times [2019-12-07 15:18:25,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:25,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962972966] [2019-12-07 15:18:25,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,314 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 15:18:25,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962972966] [2019-12-07 15:18:25,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:25,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:18:25,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506691746] [2019-12-07 15:18:25,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:18:25,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:18:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:18:25,315 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 7 states. [2019-12-07 15:18:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:25,420 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-12-07 15:18:25,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:18:25,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-07 15:18:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:25,421 INFO L225 Difference]: With dead ends: 66 [2019-12-07 15:18:25,421 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 15:18:25,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:18:25,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 15:18:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-07 15:18:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 15:18:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2019-12-07 15:18:25,424 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 21 [2019-12-07 15:18:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:25,424 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2019-12-07 15:18:25,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:18:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2019-12-07 15:18:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 15:18:25,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:25,425 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 15:18:25,425 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 15:18:25,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:25,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2060413812, now seen corresponding path program 1 times [2019-12-07 15:18:25,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:25,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211909678] [2019-12-07 15:18:25,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,486 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 15:18:25,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211909678] [2019-12-07 15:18:25,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:25,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 15:18:25,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924848650] [2019-12-07 15:18:25,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:18:25,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:25,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:18:25,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:18:25,487 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand 9 states. [2019-12-07 15:18:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:25,665 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2019-12-07 15:18:25,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:18:25,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-07 15:18:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:25,666 INFO L225 Difference]: With dead ends: 68 [2019-12-07 15:18:25,667 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 15:18:25,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:18:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 15:18:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-12-07 15:18:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 15:18:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-12-07 15:18:25,669 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 21 [2019-12-07 15:18:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:25,669 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-12-07 15:18:25,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:18:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-12-07 15:18:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:18:25,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:25,670 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 15:18:25,670 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 15:18:25,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:25,670 INFO L82 PathProgramCache]: Analyzing trace with hash -551434875, now seen corresponding path program 1 times [2019-12-07 15:18:25,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:25,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510322379] [2019-12-07 15:18:25,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:18:25,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510322379] [2019-12-07 15:18:25,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:25,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:18:25,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869280545] [2019-12-07 15:18:25,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:18:25,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:25,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:18:25,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:18:25,723 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 5 states. [2019-12-07 15:18:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:25,787 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-12-07 15:18:25,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:18:25,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 15:18:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:25,787 INFO L225 Difference]: With dead ends: 65 [2019-12-07 15:18:25,787 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 15:18:25,788 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 15:18:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 15:18:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-12-07 15:18:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 15:18:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2019-12-07 15:18:25,789 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 22 [2019-12-07 15:18:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:25,789 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2019-12-07 15:18:25,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:18:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2019-12-07 15:18:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 15:18:25,790 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:25,790 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:25,790 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 15:18:25,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:25,790 INFO L82 PathProgramCache]: Analyzing trace with hash 77751092, now seen corresponding path program 1 times [2019-12-07 15:18:25,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:25,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467134721] [2019-12-07 15:18:25,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,828 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 15:18:25,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467134721] [2019-12-07 15:18:25,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:25,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:18:25,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856574494] [2019-12-07 15:18:25,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:18:25,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:25,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:18:25,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:18:25,829 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 7 states. [2019-12-07 15:18:25,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:25,913 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2019-12-07 15:18:25,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:18:25,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-07 15:18:25,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:25,914 INFO L225 Difference]: With dead ends: 58 [2019-12-07 15:18:25,914 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 15:18:25,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:18:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 15:18:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-07 15:18:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 15:18:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2019-12-07 15:18:25,916 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 23 [2019-12-07 15:18:25,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:25,916 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2019-12-07 15:18:25,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:18:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2019-12-07 15:18:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 15:18:25,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:25,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:25,917 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 15:18:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:25,917 INFO L82 PathProgramCache]: Analyzing trace with hash 77751093, now seen corresponding path program 1 times [2019-12-07 15:18:25,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:25,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838102891] [2019-12-07 15:18:25,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:25,959 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 15:18:25,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838102891] [2019-12-07 15:18:25,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:25,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:18:25,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371505263] [2019-12-07 15:18:25,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:18:25,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:25,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:18:25,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:18:25,960 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 8 states. [2019-12-07 15:18:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:26,065 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-12-07 15:18:26,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:18:26,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-07 15:18:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:26,066 INFO L225 Difference]: With dead ends: 64 [2019-12-07 15:18:26,066 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 15:18:26,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:18:26,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 15:18:26,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2019-12-07 15:18:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 15:18:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2019-12-07 15:18:26,068 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 23 [2019-12-07 15:18:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:26,068 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2019-12-07 15:18:26,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:18:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2019-12-07 15:18:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:18:26,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:26,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:26,068 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 15:18:26,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:26,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1704080630, now seen corresponding path program 1 times [2019-12-07 15:18:26,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:26,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211452812] [2019-12-07 15:18:26,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:26,144 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 15:18:26,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211452812] [2019-12-07 15:18:26,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:26,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 15:18:26,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110796156] [2019-12-07 15:18:26,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 15:18:26,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:26,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 15:18:26,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:18:26,145 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 11 states. [2019-12-07 15:18:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:26,350 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-12-07 15:18:26,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:18:26,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-07 15:18:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:26,351 INFO L225 Difference]: With dead ends: 68 [2019-12-07 15:18:26,351 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 15:18:26,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:18:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 15:18:26,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2019-12-07 15:18:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 15:18:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2019-12-07 15:18:26,353 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 25 [2019-12-07 15:18:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:26,354 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2019-12-07 15:18:26,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 15:18:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2019-12-07 15:18:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:18:26,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:26,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:26,354 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 15:18:26,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:26,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1704080629, now seen corresponding path program 1 times [2019-12-07 15:18:26,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:26,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583447515] [2019-12-07 15:18:26,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:26,398 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 15:18:26,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583447515] [2019-12-07 15:18:26,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:26,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:18:26,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829472151] [2019-12-07 15:18:26,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:18:26,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:26,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:18:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:18:26,400 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 7 states. [2019-12-07 15:18:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:26,510 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2019-12-07 15:18:26,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:18:26,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-07 15:18:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:26,511 INFO L225 Difference]: With dead ends: 60 [2019-12-07 15:18:26,511 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 15:18:26,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:18:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 15:18:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-12-07 15:18:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 15:18:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-12-07 15:18:26,512 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 25 [2019-12-07 15:18:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:26,513 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-12-07 15:18:26,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:18:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-12-07 15:18:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 15:18:26,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:26,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:26,513 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 15:18:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:26,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1505322102, now seen corresponding path program 1 times [2019-12-07 15:18:26,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:26,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476275299] [2019-12-07 15:18:26,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:18:26,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476275299] [2019-12-07 15:18:26,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:26,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 15:18:26,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507824204] [2019-12-07 15:18:26,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 15:18:26,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:26,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 15:18:26,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:18:26,622 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 10 states. [2019-12-07 15:18:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:26,840 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-12-07 15:18:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:18:26,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-12-07 15:18:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:26,841 INFO L225 Difference]: With dead ends: 76 [2019-12-07 15:18:26,841 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 15:18:26,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:18:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 15:18:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 15:18:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 15:18:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-12-07 15:18:26,843 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 27 [2019-12-07 15:18:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:26,843 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-12-07 15:18:26,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 15:18:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-12-07 15:18:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 15:18:26,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:26,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:26,844 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 15:18:26,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:26,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1928023928, now seen corresponding path program 1 times [2019-12-07 15:18:26,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:26,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351800608] [2019-12-07 15:18:26,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:18:26,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351800608] [2019-12-07 15:18:26,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:26,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 15:18:26,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984284349] [2019-12-07 15:18:26,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 15:18:26,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:26,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 15:18:26,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:18:26,982 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 11 states. [2019-12-07 15:18:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:27,183 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2019-12-07 15:18:27,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 15:18:27,183 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-12-07 15:18:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:27,184 INFO L225 Difference]: With dead ends: 79 [2019-12-07 15:18:27,184 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 15:18:27,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:18:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 15:18:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-12-07 15:18:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 15:18:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-12-07 15:18:27,185 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 27 [2019-12-07 15:18:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:27,186 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-12-07 15:18:27,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 15:18:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-12-07 15:18:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 15:18:27,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:27,186 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:27,186 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 15:18:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1331508539, now seen corresponding path program 1 times [2019-12-07 15:18:27,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:27,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615444728] [2019-12-07 15:18:27,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:27,274 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 15:18:27,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615444728] [2019-12-07 15:18:27,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994970416] [2019-12-07 15:18:27,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:27,342 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 15:18:27,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:27,355 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 15:18:27,355 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:27,356 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:27,356 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:18:27,356 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 15:18:27,461 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:27,461 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 15:18:27,462 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:27,466 INFO L614 ElimStorePlain]: treesize reduction 13, result has 18.8 percent of original size [2019-12-07 15:18:27,466 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 15:18:27,466 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-12-07 15:18:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:18:27,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:18:27,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 20 [2019-12-07 15:18:27,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187541005] [2019-12-07 15:18:27,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 15:18:27,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:27,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 15:18:27,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2019-12-07 15:18:27,483 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 11 states. [2019-12-07 15:18:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:27,636 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-12-07 15:18:27,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:18:27,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-12-07 15:18:27,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:27,637 INFO L225 Difference]: With dead ends: 66 [2019-12-07 15:18:27,637 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 15:18:27,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2019-12-07 15:18:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 15:18:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-07 15:18:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 15:18:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-12-07 15:18:27,639 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 31 [2019-12-07 15:18:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:27,639 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-12-07 15:18:27,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 15:18:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-12-07 15:18:27,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 15:18:27,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:27,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:27,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:27,840 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 15:18:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:27,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1197495033, now seen corresponding path program 1 times [2019-12-07 15:18:27,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:27,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690826159] [2019-12-07 15:18:27,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:27,946 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 15:18:27,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690826159] [2019-12-07 15:18:27,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633046093] [2019-12-07 15:18:27,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:28,007 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 15:18:28,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:28,012 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_34|]} [2019-12-07 15:18:28,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:18:28,015 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 15:18:28,016 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:28,024 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:28,027 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 15:18:28,028 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:28,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:28,034 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 15:18:28,034 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 15:18:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:18:28,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:28,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2019-12-07 15:18:28,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771890719] [2019-12-07 15:18:28,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 15:18:28,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:28,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 15:18:28,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:18:28,109 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 17 states. [2019-12-07 15:18:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:28,429 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-12-07 15:18:28,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:18:28,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-12-07 15:18:28,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:28,429 INFO L225 Difference]: With dead ends: 58 [2019-12-07 15:18:28,429 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 15:18:28,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:18:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 15:18:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2019-12-07 15:18:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 15:18:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-12-07 15:18:28,431 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 31 [2019-12-07 15:18:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:28,431 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-12-07 15:18:28,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 15:18:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-12-07 15:18:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 15:18:28,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:28,432 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] [2019-12-07 15:18:28,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:28,633 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 15:18:28,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash -258507878, now seen corresponding path program 1 times [2019-12-07 15:18:28,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:28,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32802789] [2019-12-07 15:18:28,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:28,797 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 15:18:28,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32802789] [2019-12-07 15:18:28,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:18:28,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 15:18:28,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156140734] [2019-12-07 15:18:28,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 15:18:28,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:28,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 15:18:28,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-07 15:18:28,798 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 15 states. [2019-12-07 15:18:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:29,042 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-12-07 15:18:29,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 15:18:29,042 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-12-07 15:18:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:29,042 INFO L225 Difference]: With dead ends: 70 [2019-12-07 15:18:29,043 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 15:18:29,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:18:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 15:18:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-12-07 15:18:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 15:18:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-12-07 15:18:29,044 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 33 [2019-12-07 15:18:29,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:29,044 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-12-07 15:18:29,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 15:18:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-12-07 15:18:29,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 15:18:29,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:29,045 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, 1, 1] [2019-12-07 15:18:29,045 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 15:18:29,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:29,045 INFO L82 PathProgramCache]: Analyzing trace with hash -912468131, now seen corresponding path program 1 times [2019-12-07 15:18:29,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:29,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048084948] [2019-12-07 15:18:29,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:18:29,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048084948] [2019-12-07 15:18:29,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466369001] [2019-12-07 15:18:29,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:29,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 15:18:29,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:18:29,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:29,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-12-07 15:18:29,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22530097] [2019-12-07 15:18:29,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 15:18:29,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:29,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 15:18:29,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-12-07 15:18:29,280 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 18 states. [2019-12-07 15:18:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:29,577 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-12-07 15:18:29,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 15:18:29,577 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-12-07 15:18:29,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:29,578 INFO L225 Difference]: With dead ends: 55 [2019-12-07 15:18:29,578 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 15:18:29,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2019-12-07 15:18:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 15:18:29,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-12-07 15:18:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 15:18:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-12-07 15:18:29,581 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 37 [2019-12-07 15:18:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:29,581 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-12-07 15:18:29,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 15:18:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-12-07 15:18:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 15:18:29,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:29,582 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:18:29,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:29,783 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 15:18:29,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:29,784 INFO L82 PathProgramCache]: Analyzing trace with hash -708544290, now seen corresponding path program 1 times [2019-12-07 15:18:29,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:29,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614296313] [2019-12-07 15:18:29,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:18:29,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614296313] [2019-12-07 15:18:29,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368841144] [2019-12-07 15:18:29,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:29,965 INFO L264 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 15:18:29,967 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:18:30,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:30,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-12-07 15:18:30,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079046770] [2019-12-07 15:18:30,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 15:18:30,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:30,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 15:18:30,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-07 15:18:30,033 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 18 states. [2019-12-07 15:18:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:30,337 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-12-07 15:18:30,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 15:18:30,337 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2019-12-07 15:18:30,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:30,338 INFO L225 Difference]: With dead ends: 60 [2019-12-07 15:18:30,338 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 15:18:30,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-12-07 15:18:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 15:18:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2019-12-07 15:18:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 15:18:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-12-07 15:18:30,340 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2019-12-07 15:18:30,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:30,340 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-12-07 15:18:30,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 15:18:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-12-07 15:18:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 15:18:30,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:30,341 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, 1] [2019-12-07 15:18:30,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:30,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 15:18:30,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:30,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1988461663, now seen corresponding path program 1 times [2019-12-07 15:18:30,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:30,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757644189] [2019-12-07 15:18:30,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:30,661 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 15:18:30,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757644189] [2019-12-07 15:18:30,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910765091] [2019-12-07 15:18:30,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:30,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 15:18:30,742 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:30,835 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 15:18:30,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:30,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-12-07 15:18:30,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612653824] [2019-12-07 15:18:30,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 15:18:30,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:30,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 15:18:30,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-12-07 15:18:30,836 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 19 states. [2019-12-07 15:18:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:31,223 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-12-07 15:18:31,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:18:31,223 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2019-12-07 15:18:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:31,224 INFO L225 Difference]: With dead ends: 64 [2019-12-07 15:18:31,224 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 15:18:31,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2019-12-07 15:18:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 15:18:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2019-12-07 15:18:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 15:18:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-12-07 15:18:31,225 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 41 [2019-12-07 15:18:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:31,226 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-12-07 15:18:31,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 15:18:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-12-07 15:18:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 15:18:31,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:31,226 INFO L410 BasicCegarLoop]: trace histogram [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 15:18:31,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:31,427 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 15:18:31,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:31,427 INFO L82 PathProgramCache]: Analyzing trace with hash -82412129, now seen corresponding path program 1 times [2019-12-07 15:18:31,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:31,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937116243] [2019-12-07 15:18:31,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:18:31,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937116243] [2019-12-07 15:18:31,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091039780] [2019-12-07 15:18:31,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:31,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 53 conjunts are in the unsatisfiable core [2019-12-07 15:18:31,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:31,868 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 15:18:31,868 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:31,872 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:31,872 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 15:18:31,872 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 15:18:32,082 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 15:18:32,083 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:32,084 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:32,084 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 15:18:32,084 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 15:18:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 15:18:32,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:32,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2019-12-07 15:18:32,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142936417] [2019-12-07 15:18:32,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 15:18:32,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:32,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 15:18:32,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2019-12-07 15:18:32,089 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 25 states. [2019-12-07 15:18:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:34,020 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-12-07 15:18:34,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 15:18:34,020 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 43 [2019-12-07 15:18:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:34,021 INFO L225 Difference]: With dead ends: 142 [2019-12-07 15:18:34,021 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 15:18:34,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=353, Invalid=2953, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 15:18:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 15:18:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-12-07 15:18:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 15:18:34,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-12-07 15:18:34,024 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 43 [2019-12-07 15:18:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:34,024 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-12-07 15:18:34,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 15:18:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-12-07 15:18:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 15:18:34,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:34,025 INFO L410 BasicCegarLoop]: trace histogram [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 15:18:34,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:34,226 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 15:18:34,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1162320101, now seen corresponding path program 2 times [2019-12-07 15:18:34,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:34,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72140099] [2019-12-07 15:18:34,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:18:34,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72140099] [2019-12-07 15:18:34,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746687216] [2019-12-07 15:18:34,382 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:34,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:18:34,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:34,459 INFO L264 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 15:18:34,461 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:18:34,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:34,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2019-12-07 15:18:34,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144585851] [2019-12-07 15:18:34,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 15:18:34,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:34,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 15:18:34,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-12-07 15:18:34,585 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 23 states. [2019-12-07 15:18:34,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:34,975 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2019-12-07 15:18:34,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:18:34,975 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2019-12-07 15:18:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:34,976 INFO L225 Difference]: With dead ends: 75 [2019-12-07 15:18:34,976 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 15:18:34,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2019-12-07 15:18:34,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 15:18:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-12-07 15:18:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 15:18:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-12-07 15:18:34,977 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 51 [2019-12-07 15:18:34,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:34,978 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-12-07 15:18:34,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 15:18:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-12-07 15:18:34,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:18:34,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:34,978 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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 15:18:35,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:35,179 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 15:18:35,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:35,180 INFO L82 PathProgramCache]: Analyzing trace with hash 298120838, now seen corresponding path program 2 times [2019-12-07 15:18:35,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:35,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114702394] [2019-12-07 15:18:35,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:18:35,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114702394] [2019-12-07 15:18:35,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043290875] [2019-12-07 15:18:35,299 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:35,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:18:35,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:35,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 15:18:35,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:18:35,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:35,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2019-12-07 15:18:35,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883606025] [2019-12-07 15:18:35,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 15:18:35,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:35,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 15:18:35,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-12-07 15:18:35,453 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 21 states. [2019-12-07 15:18:35,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:35,813 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-12-07 15:18:35,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:18:35,813 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2019-12-07 15:18:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:35,813 INFO L225 Difference]: With dead ends: 71 [2019-12-07 15:18:35,813 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 15:18:35,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-12-07 15:18:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 15:18:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-12-07 15:18:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 15:18:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-12-07 15:18:35,815 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 53 [2019-12-07 15:18:35,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:35,816 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-12-07 15:18:35,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 15:18:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-12-07 15:18:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 15:18:35,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:35,816 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 15:18:36,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:36,017 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 15:18:36,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:36,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1268682297, now seen corresponding path program 2 times [2019-12-07 15:18:36,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:36,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068522909] [2019-12-07 15:18:36,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 15:18:36,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068522909] [2019-12-07 15:18:36,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504351042] [2019-12-07 15:18:36,126 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:36,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 15:18:36,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:36,183 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 15:18:36,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 15:18:36,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:18:36,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-12-07 15:18:36,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432526160] [2019-12-07 15:18:36,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:18:36,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:36,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:18:36,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:18:36,209 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 4 states. [2019-12-07 15:18:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:36,227 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-12-07 15:18:36,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:18:36,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 15:18:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:36,228 INFO L225 Difference]: With dead ends: 69 [2019-12-07 15:18:36,228 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 15:18:36,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:18:36,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 15:18:36,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-12-07 15:18:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 15:18:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2019-12-07 15:18:36,229 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 55 [2019-12-07 15:18:36,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:36,230 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2019-12-07 15:18:36,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:18:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2019-12-07 15:18:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 15:18:36,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:36,230 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2019-12-07 15:18:36,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:36,431 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 15:18:36,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:36,431 INFO L82 PathProgramCache]: Analyzing trace with hash 566748936, now seen corresponding path program 2 times [2019-12-07 15:18:36,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:36,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787779047] [2019-12-07 15:18:36,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:36,566 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 15:18:36,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787779047] [2019-12-07 15:18:36,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574741251] [2019-12-07 15:18:36,567 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:36,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 15:18:36,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:36,634 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 15:18:36,635 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 15:18:36,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:18:36,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 17 [2019-12-07 15:18:36,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583416866] [2019-12-07 15:18:36,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:18:36,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:36,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:18:36,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-07 15:18:36,679 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 5 states. [2019-12-07 15:18:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:36,714 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-12-07 15:18:36,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:18:36,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-07 15:18:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:36,715 INFO L225 Difference]: With dead ends: 66 [2019-12-07 15:18:36,715 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 15:18:36,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-07 15:18:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 15:18:36,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 15:18:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 15:18:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-12-07 15:18:36,717 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 57 [2019-12-07 15:18:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:36,717 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-12-07 15:18:36,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:18:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-12-07 15:18:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 15:18:36,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:36,718 INFO L410 BasicCegarLoop]: trace histogram [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 15:18:36,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:36,918 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 15:18:36,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash -548742648, now seen corresponding path program 3 times [2019-12-07 15:18:36,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:36,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861210761] [2019-12-07 15:18:36,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:37,208 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:18:37,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861210761] [2019-12-07 15:18:37,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217416614] [2019-12-07 15:18:37,208 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:37,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 15:18:37,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:37,296 INFO L264 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 53 conjunts are in the unsatisfiable core [2019-12-07 15:18:37,297 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:37,371 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 15:18:37,371 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:37,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:37,376 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 15:18:37,376 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 15:18:37,661 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 15:18:37,661 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:37,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:37,662 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 15:18:37,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 15:18:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:18:37,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:37,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2019-12-07 15:18:37,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132642748] [2019-12-07 15:18:37,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 15:18:37,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 15:18:37,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=752, Unknown=0, NotChecked=0, Total=812 [2019-12-07 15:18:37,674 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-12-07 15:18:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:39,676 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-12-07 15:18:39,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-07 15:18:39,677 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 59 [2019-12-07 15:18:39,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:39,677 INFO L225 Difference]: With dead ends: 178 [2019-12-07 15:18:39,677 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 15:18:39,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=401, Invalid=4291, Unknown=0, NotChecked=0, Total=4692 [2019-12-07 15:18:39,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 15:18:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2019-12-07 15:18:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 15:18:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-12-07 15:18:39,680 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 59 [2019-12-07 15:18:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:39,680 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-12-07 15:18:39,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 15:18:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-12-07 15:18:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 15:18:39,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:39,681 INFO L410 BasicCegarLoop]: trace histogram [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 15:18:39,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:39,881 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 15:18:39,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:39,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1002719566, now seen corresponding path program 4 times [2019-12-07 15:18:39,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:39,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586497623] [2019-12-07 15:18:39,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 15:18:40,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586497623] [2019-12-07 15:18:40,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250103480] [2019-12-07 15:18:40,067 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:40,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 15:18:40,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:40,144 INFO L264 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 15:18:40,145 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:40,147 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_27|], 1=[|v_#valid_35|]} [2019-12-07 15:18:40,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:18:40,150 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 15:18:40,151 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:40,158 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:40,161 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 15:18:40,162 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:40,166 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:40,167 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:18:40,167 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-12-07 15:18:40,190 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 15:18:40,190 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:40,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:40,194 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:18:40,194 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 15:18:40,213 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 15:18:40,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:40,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:40,218 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 15:18:40,218 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-12-07 15:18:40,426 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:40,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-12-07 15:18:40,427 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 15:18:40,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:40,435 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 15:18:40,435 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:23 [2019-12-07 15:18:40,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:18:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 15:18:40,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:40,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2019-12-07 15:18:40,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557097272] [2019-12-07 15:18:40,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 15:18:40,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:40,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 15:18:40,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-12-07 15:18:40,505 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 27 states. [2019-12-07 15:18:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:41,835 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-12-07 15:18:41,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 15:18:41,836 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2019-12-07 15:18:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:41,836 INFO L225 Difference]: With dead ends: 73 [2019-12-07 15:18:41,836 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 15:18:41,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 15:18:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 15:18:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2019-12-07 15:18:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 15:18:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-12-07 15:18:41,839 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 67 [2019-12-07 15:18:41,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:41,839 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-12-07 15:18:41,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 15:18:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-12-07 15:18:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 15:18:41,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:41,839 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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 15:18:42,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:42,040 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 15:18:42,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:42,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1540829359, now seen corresponding path program 3 times [2019-12-07 15:18:42,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:42,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297324132] [2019-12-07 15:18:42,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 15:18:42,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297324132] [2019-12-07 15:18:42,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201665147] [2019-12-07 15:18:42,230 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:42,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 15:18:42,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:42,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 15:18:42,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 15:18:42,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:42,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2019-12-07 15:18:42,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415918939] [2019-12-07 15:18:42,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 15:18:42,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:42,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 15:18:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2019-12-07 15:18:42,485 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 28 states. [2019-12-07 15:18:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:42,950 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-12-07 15:18:42,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 15:18:42,951 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2019-12-07 15:18:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:42,951 INFO L225 Difference]: With dead ends: 79 [2019-12-07 15:18:42,951 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 15:18:42,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 15:18:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 15:18:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-12-07 15:18:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 15:18:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-12-07 15:18:42,953 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 69 [2019-12-07 15:18:42,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:42,953 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-12-07 15:18:42,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 15:18:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-12-07 15:18:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 15:18:42,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:42,954 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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 15:18:43,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:43,155 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 15:18:43,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:43,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1876263918, now seen corresponding path program 4 times [2019-12-07 15:18:43,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:43,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516757383] [2019-12-07 15:18:43,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 44 proven. 31 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 15:18:43,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516757383] [2019-12-07 15:18:43,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624104689] [2019-12-07 15:18:43,327 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:43,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 15:18:43,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:43,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 15:18:43,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:43,413 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_36|]} [2019-12-07 15:18:43,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:18:43,417 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 15:18:43,417 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:43,422 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:43,425 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 15:18:43,426 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:43,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:43,432 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 15:18:43,432 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-12-07 15:18:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 57 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 15:18:43,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:43,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-12-07 15:18:43,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642547144] [2019-12-07 15:18:43,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 15:18:43,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:43,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 15:18:43,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-12-07 15:18:43,613 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 29 states. [2019-12-07 15:18:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:44,158 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2019-12-07 15:18:44,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 15:18:44,158 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 77 [2019-12-07 15:18:44,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:44,159 INFO L225 Difference]: With dead ends: 138 [2019-12-07 15:18:44,159 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 15:18:44,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 15:18:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 15:18:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-12-07 15:18:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 15:18:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-12-07 15:18:44,161 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 77 [2019-12-07 15:18:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:44,161 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-12-07 15:18:44,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 15:18:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-12-07 15:18:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 15:18:44,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:44,162 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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 15:18:44,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:44,363 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 15:18:44,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash 907148309, now seen corresponding path program 5 times [2019-12-07 15:18:44,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:44,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145779035] [2019-12-07 15:18:44,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:18:44,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145779035] [2019-12-07 15:18:44,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146913610] [2019-12-07 15:18:44,892 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:44,982 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-07 15:18:44,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:44,984 INFO L264 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 99 conjunts are in the unsatisfiable core [2019-12-07 15:18:44,986 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:45,127 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 15:18:45,127 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:45,132 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:45,132 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 15:18:45,132 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-12-07 15:18:46,405 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:46,405 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 15:18:46,405 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:46,416 INFO L614 ElimStorePlain]: treesize reduction 23, result has 30.3 percent of original size [2019-12-07 15:18:46,416 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 15:18:46,416 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:3 [2019-12-07 15:18:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 57 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 15:18:46,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:46,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 47 [2019-12-07 15:18:46,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523744606] [2019-12-07 15:18:46,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-07 15:18:46,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:46,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-07 15:18:46,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2013, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 15:18:46,434 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 47 states. [2019-12-07 15:18:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:48,447 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2019-12-07 15:18:48,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 15:18:48,448 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 81 [2019-12-07 15:18:48,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:48,448 INFO L225 Difference]: With dead ends: 128 [2019-12-07 15:18:48,448 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 15:18:48,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=354, Invalid=4476, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 15:18:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 15:18:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2019-12-07 15:18:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 15:18:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-12-07 15:18:48,451 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 81 [2019-12-07 15:18:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:48,452 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-12-07 15:18:48,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-07 15:18:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-12-07 15:18:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 15:18:48,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:48,452 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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 15:18:48,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:48,653 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 15:18:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash 602965464, now seen corresponding path program 6 times [2019-12-07 15:18:48,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:48,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232189018] [2019-12-07 15:18:48,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 17 proven. 71 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 15:18:48,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232189018] [2019-12-07 15:18:48,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687038242] [2019-12-07 15:18:48,854 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:48,961 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-07 15:18:48,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:48,962 INFO L264 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 15:18:48,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:48,977 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:48,977 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 15:18:48,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:48,988 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 15:18:48,989 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 15:18:48,989 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 15:18:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 15 proven. 73 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 15:18:49,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:49,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2019-12-07 15:18:49,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149669545] [2019-12-07 15:18:49,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 15:18:49,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:49,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 15:18:49,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2019-12-07 15:18:49,240 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 32 states. [2019-12-07 15:18:50,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:50,018 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2019-12-07 15:18:50,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 15:18:50,018 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 85 [2019-12-07 15:18:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:50,019 INFO L225 Difference]: With dead ends: 95 [2019-12-07 15:18:50,019 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 15:18:50,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=1652, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 15:18:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 15:18:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-12-07 15:18:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 15:18:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-12-07 15:18:50,021 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 85 [2019-12-07 15:18:50,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:50,022 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-12-07 15:18:50,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 15:18:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-12-07 15:18:50,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 15:18:50,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:50,023 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 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 15:18:50,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:50,223 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 15:18:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:50,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1491822533, now seen corresponding path program 7 times [2019-12-07 15:18:50,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:50,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57875687] [2019-12-07 15:18:50,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 74 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 15:18:50,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57875687] [2019-12-07 15:18:50,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272317053] [2019-12-07 15:18:50,476 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:50,576 INFO L264 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 15:18:50,578 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:50,579 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_37|]} [2019-12-07 15:18:50,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:18:50,582 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 15:18:50,583 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:50,588 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:50,591 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 15:18:50,592 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:50,597 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:50,597 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 15:18:50,597 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-12-07 15:18:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 91 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 15:18:50,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:50,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-12-07 15:18:50,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213769526] [2019-12-07 15:18:50,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 15:18:50,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:50,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 15:18:50,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 15:18:50,836 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 33 states. [2019-12-07 15:18:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:51,560 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-12-07 15:18:51,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 15:18:51,560 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 93 [2019-12-07 15:18:51,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:51,561 INFO L225 Difference]: With dead ends: 166 [2019-12-07 15:18:51,561 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 15:18:51,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=1732, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 15:18:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 15:18:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2019-12-07 15:18:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 15:18:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-12-07 15:18:51,563 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-12-07 15:18:51,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:51,563 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-12-07 15:18:51,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 15:18:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-12-07 15:18:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 15:18:51,564 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:51,564 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 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 15:18:51,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:51,765 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 15:18:51,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:51,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2147070526, now seen corresponding path program 8 times [2019-12-07 15:18:51,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:51,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000108542] [2019-12-07 15:18:51,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 23 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:18:52,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000108542] [2019-12-07 15:18:52,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807335509] [2019-12-07 15:18:52,402 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:52,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:18:52,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:52,493 INFO L264 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 109 conjunts are in the unsatisfiable core [2019-12-07 15:18:52,495 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:52,673 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 15:18:52,673 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:52,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:52,678 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 15:18:52,678 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-12-07 15:18:53,514 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:18:53,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:53,523 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 15:18:53,524 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:53,530 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:53,530 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 15:18:53,530 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:46, output treesize:3 [2019-12-07 15:18:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 23 proven. 100 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 15:18:53,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:53,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23] total 49 [2019-12-07 15:18:53,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555330432] [2019-12-07 15:18:53,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 15:18:53,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:53,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 15:18:53,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2196, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 15:18:53,560 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 49 states. [2019-12-07 15:18:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:56,549 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2019-12-07 15:18:56,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 15:18:56,550 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 97 [2019-12-07 15:18:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:56,551 INFO L225 Difference]: With dead ends: 152 [2019-12-07 15:18:56,551 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 15:18:56,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=367, Invalid=4889, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 15:18:56,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 15:18:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2019-12-07 15:18:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 15:18:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-12-07 15:18:56,555 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 97 [2019-12-07 15:18:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:56,555 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-12-07 15:18:56,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 15:18:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-12-07 15:18:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 15:18:56,556 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:56,556 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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 15:18:56,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:56,757 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 15:18:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash -785517055, now seen corresponding path program 9 times [2019-12-07 15:18:56,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:56,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464606304] [2019-12-07 15:18:56,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 30 proven. 110 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 15:18:57,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464606304] [2019-12-07 15:18:57,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174270424] [2019-12-07 15:18:57,004 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:57,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 15:18:57,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:57,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 15:18:57,161 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:57,171 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:57,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 15:18:57,172 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:57,182 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 15:18:57,182 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 15:18:57,182 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 15:18:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 28 proven. 112 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 15:18:57,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:57,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 35 [2019-12-07 15:18:57,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118808215] [2019-12-07 15:18:57,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 15:18:57,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:57,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 15:18:57,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 15:18:57,476 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 36 states. [2019-12-07 15:18:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:18:58,978 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2019-12-07 15:18:58,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 15:18:58,978 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 101 [2019-12-07 15:18:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:18:58,979 INFO L225 Difference]: With dead ends: 111 [2019-12-07 15:18:58,979 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 15:18:58,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=299, Invalid=2151, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 15:18:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 15:18:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-12-07 15:18:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 15:18:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-12-07 15:18:58,983 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 101 [2019-12-07 15:18:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:18:58,983 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-12-07 15:18:58,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 15:18:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-12-07 15:18:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 15:18:58,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:18:58,983 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 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 15:18:59,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:18:59,184 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 15:18:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:18:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1993854820, now seen corresponding path program 10 times [2019-12-07 15:18:59,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:18:59,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159821777] [2019-12-07 15:18:59,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:18:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:18:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 112 proven. 71 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 15:18:59,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159821777] [2019-12-07 15:18:59,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982272913] [2019-12-07 15:18:59,447 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:18:59,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 15:18:59,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:18:59,531 INFO L264 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 53 conjunts are in the unsatisfiable core [2019-12-07 15:18:59,532 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:18:59,538 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_32|], 1=[|v_#valid_38|]} [2019-12-07 15:18:59,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:18:59,542 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 15:18:59,542 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:59,547 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:59,550 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 15:18:59,550 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:18:59,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:18:59,556 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 15:18:59,556 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-12-07 15:18:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 133 proven. 50 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 15:18:59,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:18:59,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2019-12-07 15:18:59,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448225410] [2019-12-07 15:18:59,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 15:18:59,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:18:59,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 15:18:59,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 15:18:59,848 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 37 states. [2019-12-07 15:19:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:19:00,691 INFO L93 Difference]: Finished difference Result 194 states and 197 transitions. [2019-12-07 15:19:00,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 15:19:00,691 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 109 [2019-12-07 15:19:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:19:00,692 INFO L225 Difference]: With dead ends: 194 [2019-12-07 15:19:00,692 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 15:19:00,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=434, Invalid=2218, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 15:19:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 15:19:00,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-12-07 15:19:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 15:19:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-12-07 15:19:00,695 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 109 [2019-12-07 15:19:00,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:19:00,695 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-12-07 15:19:00,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 15:19:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-12-07 15:19:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 15:19:00,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:19:00,695 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 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 15:19:00,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:19:00,896 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 15:19:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:19:00,897 INFO L82 PathProgramCache]: Analyzing trace with hash 407274343, now seen corresponding path program 11 times [2019-12-07 15:19:00,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:19:00,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083475682] [2019-12-07 15:19:00,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:19:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 28 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:19:01,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083475682] [2019-12-07 15:19:01,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579635399] [2019-12-07 15:19:01,602 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:19:02,091 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-07 15:19:02,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:19:02,095 INFO L264 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 128 conjunts are in the unsatisfiable core [2019-12-07 15:19:02,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:19:02,106 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:19:02,106 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 15:19:02,106 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:19:02,117 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 15:19:02,117 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:19:02,118 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-12-07 15:19:02,313 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 15:19:02,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:19:02,317 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:19:02,317 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:19:02,317 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 15:19:03,093 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:19:03,093 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 33 treesize of output 56 [2019-12-07 15:19:03,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:19:03,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:19:03,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:19:03,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:19:03,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:19:03,117 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 15:19:03,117 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:70 [2019-12-07 15:19:03,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:19:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 28 proven. 155 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 15:19:03,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:19:03,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 24] total 56 [2019-12-07 15:19:03,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73670435] [2019-12-07 15:19:03,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-07 15:19:03,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:19:03,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-07 15:19:03,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2925, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 15:19:03,521 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 56 states. [2019-12-07 15:19:07,560 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-12-07 15:19:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:19:11,298 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2019-12-07 15:19:11,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-07 15:19:11,298 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 113 [2019-12-07 15:19:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:19:11,299 INFO L225 Difference]: With dead ends: 182 [2019-12-07 15:19:11,299 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 15:19:11,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2563 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=686, Invalid=10870, Unknown=0, NotChecked=0, Total=11556 [2019-12-07 15:19:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 15:19:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-12-07 15:19:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 15:19:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-12-07 15:19:11,302 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 113 [2019-12-07 15:19:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:19:11,302 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-12-07 15:19:11,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-07 15:19:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-12-07 15:19:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 15:19:11,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:19:11,303 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 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 15:19:11,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:19:11,504 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 15:19:11,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:19:11,504 INFO L82 PathProgramCache]: Analyzing trace with hash -460250739, now seen corresponding path program 12 times [2019-12-07 15:19:11,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:19:11,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839957277] [2019-12-07 15:19:11,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:19:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 158 proven. 97 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 15:19:11,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839957277] [2019-12-07 15:19:11,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520894139] [2019-12-07 15:19:11,765 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/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 15:19:12,095 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-07 15:19:12,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:19:12,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 75 conjunts are in the unsatisfiable core [2019-12-07 15:19:12,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:19:12,109 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:19:12,109 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 15:19:12,109 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:19:12,120 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 15:19:12,120 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 15:19:12,120 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 15:19:12,171 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 15:19:12,172 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:19:12,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:19:12,173 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:19:12,173 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 15:19:12,340 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:19:12,341 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 32 treesize of output 54 [2019-12-07 15:19:12,341 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:19:12,351 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:19:12,351 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 15:19:12,351 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:23 [2019-12-07 15:19:12,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:19:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 45 proven. 39 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-12-07 15:19:12,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:19:12,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 35 [2019-12-07 15:19:12,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185108892] [2019-12-07 15:19:12,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 15:19:12,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:19:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 15:19:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 15:19:12,457 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 35 states. [2019-12-07 15:19:14,383 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-12-07 15:19:15,355 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-12-07 15:19:16,279 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-12-07 15:19:17,350 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-12-07 15:19:18,403 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-12-07 15:19:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:19:18,890 INFO L93 Difference]: Finished difference Result 221 states and 224 transitions. [2019-12-07 15:19:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-07 15:19:18,891 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 125 [2019-12-07 15:19:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:19:18,891 INFO L225 Difference]: With dead ends: 221 [2019-12-07 15:19:18,892 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:19:18,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2731 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1254, Invalid=9048, Unknown=0, NotChecked=0, Total=10302 [2019-12-07 15:19:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:19:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:19:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:19:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:19:18,894 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2019-12-07 15:19:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:19:18,894 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:19:18,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 15:19:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:19:18,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:19:19,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:19:19,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:19:19 BoogieIcfgContainer [2019-12-07 15:19:19,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:19:19,104 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:19:19,104 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:19:19,104 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:19:19,105 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:18:22" (3/4) ... [2019-12-07 15:19:19,109 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:19:19,113 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 15:19:19,113 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 15:19:19,113 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 15:19:19,113 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-07 15:19:19,113 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-07 15:19:19,113 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 15:19:19,114 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncmp [2019-12-07 15:19:19,114 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-07 15:19:19,117 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-12-07 15:19:19,117 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 15:19:19,118 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 15:19:19,118 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 15:19:19,150 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ad2945da-24ff-486e-87d5-d701d2979b07/bin/uautomizer/witness.graphml [2019-12-07 15:19:19,150 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:19:19,151 INFO L168 Benchmark]: Toolchain (without parser) took 57216.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 939.3 MB in the beginning and 902.0 MB in the end (delta: 37.3 MB). Peak memory consumption was 337.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:19:19,151 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 957.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:19:19,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:19:19,152 INFO L168 Benchmark]: Boogie Preprocessor took 37.61 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:19:19,152 INFO L168 Benchmark]: RCFGBuilder took 320.60 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:19:19,152 INFO L168 Benchmark]: TraceAbstraction took 56507.31 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 198.2 MB). Free memory was 1.0 GB in the beginning and 905.3 MB in the end (delta: 120.6 MB). Peak memory consumption was 318.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:19:19,152 INFO L168 Benchmark]: Witness Printer took 46.60 ms. Allocated memory is still 1.3 GB. Free memory was 905.3 MB in the beginning and 902.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:19:19,153 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 957.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.61 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 320.60 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56507.31 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 198.2 MB). Free memory was 1.0 GB in the beginning and 905.3 MB in the end (delta: 120.6 MB). Peak memory consumption was 318.8 MB. Max. memory is 11.5 GB. * Witness Printer took 46.60 ms. Allocated memory is still 1.3 GB. Free memory was 905.3 MB in the beginning and 902.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: 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: 520]: 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: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: 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: 521]: 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, 78 locations, 19 error locations. Result: SAFE, OverallTime: 56.4s, OverallIterations: 44, TraceHistogramMax: 8, AutomataDifference: 34.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1527 SDtfs, 4704 SDslu, 5322 SDs, 0 SdLazy, 22529 SolverSat, 716 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2536 GetRequests, 1372 SyntacticMatches, 18 SemanticMatches, 1146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13388 ImplicationChecksByTransitivity, 29.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred 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, 189 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 3476 NumberOfCodeBlocks, 3368 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 3408 ConstructedInterpolants, 188 QuantifiedInterpolants, 2398757 SizeOfPredicates, 336 NumberOfNonLiveVariables, 6630 ConjunctsInSsa, 1081 ConjunctsInUnsatCore, 68 InterpolantComputations, 23 PerfectInterpolantSequences, 1997/3834 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...