./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/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 0b29929f70f48b1f1b1180a065dc51df3698b29b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:10:48,371 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:10:48,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:10:48,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:10:48,380 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:10:48,381 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:10:48,382 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:10:48,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:10:48,384 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:10:48,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:10:48,386 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:10:48,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:10:48,387 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:10:48,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:10:48,388 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:10:48,389 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:10:48,389 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:10:48,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:10:48,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:10:48,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:10:48,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:10:48,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:10:48,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:10:48,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:10:48,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:10:48,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:10:48,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:10:48,398 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:10:48,399 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:10:48,399 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:10:48,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:10:48,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:10:48,400 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:10:48,400 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:10:48,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:10:48,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:10:48,402 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 17:10:48,410 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:10:48,410 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:10:48,410 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:10:48,410 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:10:48,411 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 17:10:48,411 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 17:10:48,411 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 17:10:48,411 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:10:48,411 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:10:48,412 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 17:10:48,412 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:10:48,412 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:10:48,412 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:10:48,412 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 17:10:48,412 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 17:10:48,412 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 17:10:48,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:10:48,413 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:10:48,413 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:10:48,413 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:10:48,413 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:10:48,413 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:10:48,414 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:10:48,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:10:48,414 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:10:48,414 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:10:48,414 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 17:10:48,414 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:10:48,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/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 -> 0b29929f70f48b1f1b1180a065dc51df3698b29b [2018-12-08 17:10:48,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:10:48,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:10:48,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:10:48,444 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:10:48,444 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:10:48,444 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-08 17:10:48,479 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/data/b09baeaf5/c4853fb0018543b48d673feb1bf6b94b/FLAG5725cbab6 [2018-12-08 17:10:48,820 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:10:48,820 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-08 17:10:48,826 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/data/b09baeaf5/c4853fb0018543b48d673feb1bf6b94b/FLAG5725cbab6 [2018-12-08 17:10:48,835 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/data/b09baeaf5/c4853fb0018543b48d673feb1bf6b94b [2018-12-08 17:10:48,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:10:48,838 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 17:10:48,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:10:48,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:10:48,840 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:10:48,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:10:48" (1/1) ... [2018-12-08 17:10:48,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e93016c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:10:48, skipping insertion in model container [2018-12-08 17:10:48,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:10:48" (1/1) ... [2018-12-08 17:10:48,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:10:48,874 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:10:49,031 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:10:49,070 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:10:49,098 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:10:49,130 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:10:49,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:10:49 WrapperNode [2018-12-08 17:10:49,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:10:49,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:10:49,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:10:49,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:10:49,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:10:49" (1/1) ... [2018-12-08 17:10:49,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:10:49" (1/1) ... [2018-12-08 17:10:49,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:10:49" (1/1) ... [2018-12-08 17:10:49,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:10:49" (1/1) ... [2018-12-08 17:10:49,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:10:49" (1/1) ... [2018-12-08 17:10:49,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:10:49" (1/1) ... [2018-12-08 17:10:49,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:10:49" (1/1) ... [2018-12-08 17:10:49,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:10:49,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:10:49,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:10:49,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:10:49,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:10:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/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 [2018-12-08 17:10:49,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 17:10:49,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:10:49,194 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-08 17:10:49,194 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-08 17:10:49,194 INFO L138 BoogieDeclarations]: Found implementation of procedure cstpncpy [2018-12-08 17:10:49,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 17:10:49,194 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-08 17:10:49,194 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-08 17:10:49,194 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 17:10:49,194 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 17:10:49,194 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 17:10:49,194 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 17:10:49,194 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 17:10:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 17:10:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 17:10:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 17:10:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 17:10:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 17:10:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 17:10:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 17:10:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 17:10:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 17:10:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 17:10:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 17:10:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 17:10:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 17:10:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 17:10:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 17:10:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 17:10:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 17:10:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 17:10:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 17:10:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 17:10:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 17:10:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 17:10:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 17:10:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 17:10:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 17:10:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 17:10:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 17:10:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 17:10:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 17:10:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 17:10:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 17:10:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 17:10:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 17:10:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 17:10:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 17:10:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 17:10:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 17:10:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 17:10:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 17:10:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 17:10:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 17:10:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 17:10:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 17:10:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 17:10:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 17:10:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 17:10:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 17:10:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 17:10:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 17:10:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 17:10:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 17:10:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 17:10:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 17:10:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 17:10:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 17:10:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 17:10:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 17:10:49,203 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 17:10:49,203 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 17:10:49,203 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 17:10:49,203 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 17:10:49,203 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 17:10:49,203 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 17:10:49,203 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 17:10:49,203 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 17:10:49,204 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 17:10:49,204 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 17:10:49,204 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 17:10:49,204 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 17:10:49,204 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 17:10:49,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-08 17:10:49,204 INFO L130 BoogieDeclarations]: Found specification of procedure cstpncpy [2018-12-08 17:10:49,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:10:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 17:10:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 17:10:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 17:10:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 17:10:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:10:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 17:10:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 17:10:49,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:10:49,450 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:10:49,450 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-08 17:10:49,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:10:49 BoogieIcfgContainer [2018-12-08 17:10:49,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:10:49,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:10:49,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:10:49,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:10:49,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:10:48" (1/3) ... [2018-12-08 17:10:49,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa2bef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:10:49, skipping insertion in model container [2018-12-08 17:10:49,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:10:49" (2/3) ... [2018-12-08 17:10:49,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa2bef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:10:49, skipping insertion in model container [2018-12-08 17:10:49,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:10:49" (3/3) ... [2018-12-08 17:10:49,456 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-08 17:10:49,462 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:10:49,467 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-08 17:10:49,478 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-08 17:10:49,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 17:10:49,494 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:10:49,494 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 17:10:49,494 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:10:49,494 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:10:49,494 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:10:49,494 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:10:49,494 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:10:49,494 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:10:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-12-08 17:10:49,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 17:10:49,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:49,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:10:49,513 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:49,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:49,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1703752957, now seen corresponding path program 1 times [2018-12-08 17:10:49,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:49,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:49,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:49,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:49,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:49,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:49,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:10:49,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:10:49,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:10:49,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:10:49,622 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-12-08 17:10:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:49,671 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-12-08 17:10:49,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:10:49,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 17:10:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:49,677 INFO L225 Difference]: With dead ends: 60 [2018-12-08 17:10:49,678 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 17:10:49,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:10:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 17:10:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-08 17:10:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 17:10:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-12-08 17:10:49,701 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 10 [2018-12-08 17:10:49,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:49,701 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-12-08 17:10:49,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:10:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-12-08 17:10:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 17:10:49,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:49,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:10:49,702 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:49,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:49,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1703752956, now seen corresponding path program 1 times [2018-12-08 17:10:49,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:49,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:49,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:49,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:49,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:10:49,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:10:49,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:10:49,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:10:49,751 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 4 states. [2018-12-08 17:10:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:49,762 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-12-08 17:10:49,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:10:49,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-08 17:10:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:49,763 INFO L225 Difference]: With dead ends: 56 [2018-12-08 17:10:49,764 INFO L226 Difference]: Without dead ends: 56 [2018-12-08 17:10:49,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:10:49,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-08 17:10:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-08 17:10:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 17:10:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-12-08 17:10:49,767 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 10 [2018-12-08 17:10:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:49,767 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-12-08 17:10:49,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:10:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-12-08 17:10:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 17:10:49,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:49,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:10:49,768 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:49,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:49,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1419231174, now seen corresponding path program 1 times [2018-12-08 17:10:49,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:49,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:49,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:49,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:49,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:49,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:49,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:10:49,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:10:49,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:10:49,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:10:49,790 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 3 states. [2018-12-08 17:10:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:49,825 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-12-08 17:10:49,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:10:49,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 17:10:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:49,827 INFO L225 Difference]: With dead ends: 50 [2018-12-08 17:10:49,827 INFO L226 Difference]: Without dead ends: 50 [2018-12-08 17:10:49,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:10:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-08 17:10:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-08 17:10:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-08 17:10:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-12-08 17:10:49,831 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-12-08 17:10:49,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:49,831 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-08 17:10:49,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:10:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-12-08 17:10:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 17:10:49,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:49,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:10:49,832 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:49,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:49,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1419231175, now seen corresponding path program 1 times [2018-12-08 17:10:49,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:49,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:49,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:49,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:49,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:49,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:49,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:10:49,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:10:49,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:10:49,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:10:49,856 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 3 states. [2018-12-08 17:10:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:49,878 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-08 17:10:49,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:10:49,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 17:10:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:49,879 INFO L225 Difference]: With dead ends: 44 [2018-12-08 17:10:49,879 INFO L226 Difference]: Without dead ends: 44 [2018-12-08 17:10:49,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:10:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-08 17:10:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-08 17:10:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 17:10:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-08 17:10:49,883 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-12-08 17:10:49,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:49,883 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-08 17:10:49,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:10:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-08 17:10:49,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:10:49,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:49,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:10:49,884 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:49,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:49,884 INFO L82 PathProgramCache]: Analyzing trace with hash -185937938, now seen corresponding path program 1 times [2018-12-08 17:10:49,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:49,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:49,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:49,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:49,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:49,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:49,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:10:49,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:10:49,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:10:49,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:10:49,934 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-12-08 17:10:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:49,967 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-12-08 17:10:49,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:10:49,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-08 17:10:49,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:49,969 INFO L225 Difference]: With dead ends: 65 [2018-12-08 17:10:49,969 INFO L226 Difference]: Without dead ends: 65 [2018-12-08 17:10:49,970 INFO L631 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 [2018-12-08 17:10:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-08 17:10:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2018-12-08 17:10:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-08 17:10:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-12-08 17:10:49,976 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 21 [2018-12-08 17:10:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:49,976 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-12-08 17:10:49,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:10:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-12-08 17:10:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:10:49,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:49,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:10:49,977 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:49,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:49,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1197055188, now seen corresponding path program 1 times [2018-12-08 17:10:49,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:49,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:49,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:49,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:49,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:50,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:50,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:10:50,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:10:50,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:10:50,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:10:50,019 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 6 states. [2018-12-08 17:10:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:50,060 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-12-08 17:10:50,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:10:50,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-08 17:10:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:50,061 INFO L225 Difference]: With dead ends: 62 [2018-12-08 17:10:50,061 INFO L226 Difference]: Without dead ends: 58 [2018-12-08 17:10:50,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:10:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-08 17:10:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2018-12-08 17:10:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 17:10:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-08 17:10:50,063 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2018-12-08 17:10:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:50,064 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-08 17:10:50,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:10:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-08 17:10:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:10:50,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:50,064 INFO L402 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] [2018-12-08 17:10:50,064 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:50,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:50,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2041466273, now seen corresponding path program 1 times [2018-12-08 17:10:50,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:50,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:50,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:50,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:50,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:50,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:50,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 17:10:50,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:10:50,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:10:50,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:10:50,158 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 10 states. [2018-12-08 17:10:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:50,252 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-08 17:10:50,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:10:50,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-08 17:10:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:50,253 INFO L225 Difference]: With dead ends: 43 [2018-12-08 17:10:50,253 INFO L226 Difference]: Without dead ends: 43 [2018-12-08 17:10:50,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:10:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-08 17:10:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-08 17:10:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-08 17:10:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-08 17:10:50,256 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 22 [2018-12-08 17:10:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:50,256 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-08 17:10:50,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:10:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-12-08 17:10:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:10:50,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:50,257 INFO L402 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] [2018-12-08 17:10:50,257 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:50,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:50,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2041466272, now seen corresponding path program 1 times [2018-12-08 17:10:50,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:50,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:50,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:50,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:50,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:50,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:50,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 17:10:50,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:10:50,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:10:50,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:10:50,363 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 10 states. [2018-12-08 17:10:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:50,523 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-08 17:10:50,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:10:50,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-08 17:10:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:50,524 INFO L225 Difference]: With dead ends: 49 [2018-12-08 17:10:50,524 INFO L226 Difference]: Without dead ends: 49 [2018-12-08 17:10:50,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-12-08 17:10:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-08 17:10:50,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-08 17:10:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 17:10:50,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-08 17:10:50,527 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 22 [2018-12-08 17:10:50,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:50,527 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-08 17:10:50,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:10:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-12-08 17:10:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 17:10:50,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:50,528 INFO L402 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] [2018-12-08 17:10:50,528 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:50,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:50,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1139054998, now seen corresponding path program 1 times [2018-12-08 17:10:50,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:50,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:50,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:50,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:50,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:50,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:50,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 17:10:50,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:10:50,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:10:50,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:10:50,618 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 10 states. [2018-12-08 17:10:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:50,750 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-12-08 17:10:50,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:10:50,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-08 17:10:50,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:50,751 INFO L225 Difference]: With dead ends: 51 [2018-12-08 17:10:50,751 INFO L226 Difference]: Without dead ends: 51 [2018-12-08 17:10:50,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-12-08 17:10:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-08 17:10:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2018-12-08 17:10:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 17:10:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-08 17:10:50,753 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 23 [2018-12-08 17:10:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:50,753 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-08 17:10:50,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:10:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-08 17:10:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 17:10:50,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:50,754 INFO L402 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] [2018-12-08 17:10:50,754 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:50,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:50,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1139054999, now seen corresponding path program 1 times [2018-12-08 17:10:50,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:50,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:50,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:50,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:50,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:50,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:50,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 17:10:50,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:10:50,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:10:50,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:10:50,932 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 11 states. [2018-12-08 17:10:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:51,081 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-08 17:10:51,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:10:51,081 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-08 17:10:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:51,082 INFO L225 Difference]: With dead ends: 45 [2018-12-08 17:10:51,082 INFO L226 Difference]: Without dead ends: 45 [2018-12-08 17:10:51,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:10:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-08 17:10:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-08 17:10:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 17:10:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-08 17:10:51,085 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 23 [2018-12-08 17:10:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:51,085 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-08 17:10:51,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:10:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-12-08 17:10:51,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 17:10:51,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:51,086 INFO L402 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] [2018-12-08 17:10:51,086 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:51,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:51,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1585110580, now seen corresponding path program 1 times [2018-12-08 17:10:51,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:51,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:51,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:51,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:51,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:51,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:51,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:10:51,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:10:51,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:10:51,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:10:51,124 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2018-12-08 17:10:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:51,168 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-08 17:10:51,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:10:51,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-08 17:10:51,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:51,168 INFO L225 Difference]: With dead ends: 44 [2018-12-08 17:10:51,169 INFO L226 Difference]: Without dead ends: 44 [2018-12-08 17:10:51,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:10:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-08 17:10:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-08 17:10:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 17:10:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-08 17:10:51,170 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 28 [2018-12-08 17:10:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:51,171 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-08 17:10:51,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:10:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-08 17:10:51,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 17:10:51,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:51,171 INFO L402 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] [2018-12-08 17:10:51,171 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:51,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:51,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1585110579, now seen corresponding path program 1 times [2018-12-08 17:10:51,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:51,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:51,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:51,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:51,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:51,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:51,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:10:51,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:10:51,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:10:51,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:10:51,226 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-12-08 17:10:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:51,268 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-12-08 17:10:51,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:10:51,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-08 17:10:51,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:51,269 INFO L225 Difference]: With dead ends: 85 [2018-12-08 17:10:51,269 INFO L226 Difference]: Without dead ends: 85 [2018-12-08 17:10:51,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:10:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-08 17:10:51,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2018-12-08 17:10:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-08 17:10:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-12-08 17:10:51,273 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 28 [2018-12-08 17:10:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:51,273 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-12-08 17:10:51,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:10:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-12-08 17:10:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 17:10:51,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:51,274 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:10:51,274 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:51,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:51,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1564088447, now seen corresponding path program 1 times [2018-12-08 17:10:51,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:51,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:51,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:51,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:51,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:51,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:51,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:10:51,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:10:51,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:10:51,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:10:51,344 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 6 states. [2018-12-08 17:10:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:51,380 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-12-08 17:10:51,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:10:51,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-08 17:10:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:51,381 INFO L225 Difference]: With dead ends: 72 [2018-12-08 17:10:51,381 INFO L226 Difference]: Without dead ends: 72 [2018-12-08 17:10:51,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:10:51,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-08 17:10:51,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-12-08 17:10:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-08 17:10:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-12-08 17:10:51,384 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 28 [2018-12-08 17:10:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:51,384 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-12-08 17:10:51,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:10:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-12-08 17:10:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 17:10:51,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:51,384 INFO L402 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] [2018-12-08 17:10:51,384 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:51,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:51,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1162408753, now seen corresponding path program 1 times [2018-12-08 17:10:51,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:51,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:51,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:51,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:51,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 17:10:51,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 17:10:51,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 17:10:51,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:10:51,680 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 17 states. [2018-12-08 17:10:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:52,257 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-12-08 17:10:52,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 17:10:52,258 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-12-08 17:10:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:52,258 INFO L225 Difference]: With dead ends: 76 [2018-12-08 17:10:52,258 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 17:10:52,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2018-12-08 17:10:52,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 17:10:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-08 17:10:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 17:10:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-12-08 17:10:52,261 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 28 [2018-12-08 17:10:52,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:52,261 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-12-08 17:10:52,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 17:10:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-12-08 17:10:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 17:10:52,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:52,262 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:10:52,262 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:52,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:52,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1141386621, now seen corresponding path program 1 times [2018-12-08 17:10:52,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:52,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:52,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:52,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:52,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:52,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:10:52,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:10:52,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:10:52,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:10:52,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:10:52,368 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 12 states. [2018-12-08 17:10:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:52,554 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-12-08 17:10:52,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:10:52,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-08 17:10:52,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:52,554 INFO L225 Difference]: With dead ends: 130 [2018-12-08 17:10:52,555 INFO L226 Difference]: Without dead ends: 130 [2018-12-08 17:10:52,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:10:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-08 17:10:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-12-08 17:10:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-08 17:10:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2018-12-08 17:10:52,558 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 28 [2018-12-08 17:10:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:52,558 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2018-12-08 17:10:52,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:10:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2018-12-08 17:10:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 17:10:52,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:52,558 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:10:52,559 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:52,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:52,559 INFO L82 PathProgramCache]: Analyzing trace with hash -922531903, now seen corresponding path program 1 times [2018-12-08 17:10:52,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:52,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:52,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:52,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:52,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:52,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:10:52,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:10:52,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:52,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:10:52,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-08 17:10:52,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-08 17:10:52,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:52,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:52,784 INFO L267 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. [2018-12-08 17:10:52,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-08 17:10:52,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:10:52,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-08 17:10:52,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:52,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:10:52,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:10:52,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 17:10:52,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:52,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:10:52,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:33 [2018-12-08 17:10:52,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-12-08 17:10:52,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-08 17:10:52,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:52,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:52,897 INFO L267 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. [2018-12-08 17:10:52,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:33 [2018-12-08 17:10:52,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-12-08 17:10:52,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-08 17:10:52,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:52,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:52,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 17:10:52,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2018-12-08 17:10:53,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 17:10:53,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 17:10:53,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 17:10:53,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:10:53,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 17:10:53,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-12-08 17:10:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:53,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:10:53,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-12-08 17:10:53,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-08 17:10:53,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-08 17:10:53,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2018-12-08 17:10:53,224 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 24 states. [2018-12-08 17:10:53,795 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 79 [2018-12-08 17:10:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:53,999 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2018-12-08 17:10:53,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:10:53,999 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-12-08 17:10:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:54,000 INFO L225 Difference]: With dead ends: 141 [2018-12-08 17:10:54,000 INFO L226 Difference]: Without dead ends: 141 [2018-12-08 17:10:54,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2018-12-08 17:10:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-08 17:10:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-12-08 17:10:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-08 17:10:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2018-12-08 17:10:54,005 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 28 [2018-12-08 17:10:54,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:54,005 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2018-12-08 17:10:54,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-08 17:10:54,005 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2018-12-08 17:10:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 17:10:54,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:54,006 INFO L402 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] [2018-12-08 17:10:54,006 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:54,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:54,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1466282070, now seen corresponding path program 1 times [2018-12-08 17:10:54,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:54,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:54,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:54,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:54,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:10:54,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:10:54,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:54,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:10:54,326 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-08 17:10:54,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 17:10:54,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:10:54,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-08 17:10:54,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-08 17:10:54,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,353 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-08 17:10:54,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:10:54,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 17:10:54,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:10:54,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:10:54,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:10:54,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 17:10:54,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-12-08 17:10:54,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:10:54,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 17:10:54,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:10:54,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 17:10:54,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,463 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-12-08 17:10:54,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-08 17:10:54,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-08 17:10:54,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 17:10:54,535 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:10:54,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:54,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:10:54,543 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2018-12-08 17:10:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:54,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:10:54,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2018-12-08 17:10:54,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-08 17:10:54,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-08 17:10:54,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-12-08 17:10:54,802 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 29 states. [2018-12-08 17:10:55,138 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-12-08 17:10:55,457 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-12-08 17:10:56,078 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2018-12-08 17:10:56,555 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-08 17:10:57,192 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-08 17:10:57,578 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-08 17:10:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:10:57,708 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-12-08 17:10:57,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 17:10:57,709 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-08 17:10:57,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:10:57,710 INFO L225 Difference]: With dead ends: 132 [2018-12-08 17:10:57,710 INFO L226 Difference]: Without dead ends: 132 [2018-12-08 17:10:57,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=245, Invalid=1735, Unknown=0, NotChecked=0, Total=1980 [2018-12-08 17:10:57,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-08 17:10:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-12-08 17:10:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-08 17:10:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2018-12-08 17:10:57,714 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 29 [2018-12-08 17:10:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:10:57,715 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2018-12-08 17:10:57,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-08 17:10:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2018-12-08 17:10:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 17:10:57,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:10:57,716 INFO L402 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] [2018-12-08 17:10:57,716 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:10:57,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:10:57,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1002178119, now seen corresponding path program 1 times [2018-12-08 17:10:57,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:10:57,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:10:57,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:57,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:57,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:10:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:58,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:10:58,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:10:58,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:10:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:10:58,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:10:58,155 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-08 17:10:58,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 17:10:58,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:10:58,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-08 17:10:58,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-08 17:10:58,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:10:58,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2018-12-08 17:10:58,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:10:58,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:10:58,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:10:58,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 17:10:58,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 17:10:58,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-12-08 17:10:58,272 INFO L478 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 11 treesize of output 8 [2018-12-08 17:10:58,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 17:10:58,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,293 INFO L478 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 11 treesize of output 8 [2018-12-08 17:10:58,294 INFO L478 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 8 treesize of output 7 [2018-12-08 17:10:58,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-08 17:10:58,350 INFO L478 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 25 treesize of output 19 [2018-12-08 17:10:58,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-08 17:10:58,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 17:10:58,360 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:10:58,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:10:58,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:10:58,365 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-12-08 17:10:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:10:58,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:10:58,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-12-08 17:10:58,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-08 17:10:58,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-08 17:10:58,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2018-12-08 17:10:58,624 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand 33 states. [2018-12-08 17:10:59,721 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-12-08 17:11:00,007 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-12-08 17:11:01,243 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-12-08 17:11:01,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:11:01,581 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-12-08 17:11:01,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-08 17:11:01,581 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-08 17:11:01,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:11:01,582 INFO L225 Difference]: With dead ends: 175 [2018-12-08 17:11:01,582 INFO L226 Difference]: Without dead ends: 175 [2018-12-08 17:11:01,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=477, Invalid=3683, Unknown=0, NotChecked=0, Total=4160 [2018-12-08 17:11:01,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-08 17:11:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 138. [2018-12-08 17:11:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-08 17:11:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2018-12-08 17:11:01,588 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 32 [2018-12-08 17:11:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:11:01,588 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2018-12-08 17:11:01,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-08 17:11:01,588 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-12-08 17:11:01,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 17:11:01,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:11:01,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:11:01,589 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:11:01,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:11:01,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1609289062, now seen corresponding path program 1 times [2018-12-08 17:11:01,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:11:01,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:11:01,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:11:01,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:11:01,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:11:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:11:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:11:01,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:11:01,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 17:11:01,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:11:01,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:11:01,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:11:01,761 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 11 states. [2018-12-08 17:11:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:11:01,856 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2018-12-08 17:11:01,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 17:11:01,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-12-08 17:11:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:11:01,856 INFO L225 Difference]: With dead ends: 153 [2018-12-08 17:11:01,856 INFO L226 Difference]: Without dead ends: 56 [2018-12-08 17:11:01,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:11:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-08 17:11:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-12-08 17:11:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-08 17:11:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-12-08 17:11:01,858 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 32 [2018-12-08 17:11:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:11:01,858 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-12-08 17:11:01,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:11:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-12-08 17:11:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 17:11:01,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:11:01,858 INFO L402 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] [2018-12-08 17:11:01,858 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:11:01,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:11:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1731160686, now seen corresponding path program 1 times [2018-12-08 17:11:01,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:11:01,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:11:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:11:01,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:11:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:11:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:11:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:11:02,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:11:02,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:11:02,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:11:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:11:02,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:11:02,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:11:02,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-08 17:11:02,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-08 17:11:02,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,259 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-08 17:11:02,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 17:11:02,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:11:02,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2018-12-08 17:11:02,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:11:02,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:11:02,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:11:02,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 17:11:02,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 17:11:02,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-12-08 17:11:02,350 INFO L478 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 11 treesize of output 8 [2018-12-08 17:11:02,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 17:11:02,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,360 INFO L478 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 11 treesize of output 8 [2018-12-08 17:11:02,361 INFO L478 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 8 treesize of output 7 [2018-12-08 17:11:02,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-08 17:11:02,411 INFO L478 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 25 treesize of output 19 [2018-12-08 17:11:02,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-08 17:11:02,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 17:11:02,423 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:11:02,424 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:02,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:11:02,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-12-08 17:11:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:11:02,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:11:02,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2018-12-08 17:11:02,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-08 17:11:02,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-08 17:11:02,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2018-12-08 17:11:02,696 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 32 states. [2018-12-08 17:11:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:11:04,361 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-12-08 17:11:04,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-08 17:11:04,361 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-12-08 17:11:04,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:11:04,361 INFO L225 Difference]: With dead ends: 52 [2018-12-08 17:11:04,362 INFO L226 Difference]: Without dead ends: 39 [2018-12-08 17:11:04,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=345, Invalid=2517, Unknown=0, NotChecked=0, Total=2862 [2018-12-08 17:11:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-08 17:11:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-12-08 17:11:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-08 17:11:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-08 17:11:04,364 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-12-08 17:11:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:11:04,364 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-08 17:11:04,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-08 17:11:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-08 17:11:04,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 17:11:04,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:11:04,364 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-08 17:11:04,365 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:11:04,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:11:04,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1752182818, now seen corresponding path program 2 times [2018-12-08 17:11:04,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:11:04,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:11:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:11:04,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:11:04,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:11:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:11:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:11:04,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:11:04,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:11:04,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 17:11:04,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 17:11:04,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 17:11:04,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:11:04,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 17:11:04,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,732 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-08 17:11:04,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 17:11:04,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,737 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,744 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-08 17:11:04,762 INFO L478 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 16 treesize of output 13 [2018-12-08 17:11:04,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-08 17:11:04,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,770 INFO L267 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. [2018-12-08 17:11:04,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-08 17:11:04,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:11:04,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:11:04,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 17:11:04,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-08 17:11:04,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:11:04,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-12-08 17:11:04,873 INFO L478 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 11 treesize of output 8 [2018-12-08 17:11:04,875 INFO L478 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 8 treesize of output 7 [2018-12-08 17:11:04,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-08 17:11:04,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-08 17:11:04,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:11:04,903 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2018-12-08 17:11:04,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-08 17:11:04,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-08 17:11:04,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:04,978 INFO L267 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. [2018-12-08 17:11:04,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2018-12-08 17:11:05,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-08 17:11:05,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-08 17:11:05,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:05,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:05,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:11:05,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:32 [2018-12-08 17:11:05,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-08 17:11:05,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 17:11:05,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:05,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:05,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:11:05,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:46, output treesize:31 [2018-12-08 17:11:05,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-08 17:11:05,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 17:11:05,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 17:11:05,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:11:05,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 17:11:05,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:55 [2018-12-08 17:11:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:11:05,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:11:05,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-12-08 17:11:05,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-08 17:11:05,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-08 17:11:05,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2018-12-08 17:11:05,552 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-12-08 17:11:06,903 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2018-12-08 17:11:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:11:07,344 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-08 17:11:07,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 17:11:07,345 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-08 17:11:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:11:07,345 INFO L225 Difference]: With dead ends: 37 [2018-12-08 17:11:07,345 INFO L226 Difference]: Without dead ends: 37 [2018-12-08 17:11:07,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=257, Invalid=2293, Unknown=0, NotChecked=0, Total=2550 [2018-12-08 17:11:07,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-08 17:11:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-08 17:11:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-08 17:11:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-08 17:11:07,346 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-08 17:11:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:11:07,346 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-08 17:11:07,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-08 17:11:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-08 17:11:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:11:07,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:11:07,347 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-12-08 17:11:07,347 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-08 17:11:07,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:11:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1516907499, now seen corresponding path program 2 times [2018-12-08 17:11:07,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:11:07,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:11:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:11:07,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:11:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:11:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:11:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:11:07,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:11:07,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:11:07,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 17:11:07,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 17:11:07,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 17:11:07,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:11:07,723 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-08 17:11:07,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 17:11:07,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:11:07,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-08 17:11:07,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-08 17:11:07,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-08 17:11:07,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:11:07,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 17:11:07,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:11:07,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:11:07,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:11:07,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 17:11:07,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-12-08 17:11:07,859 INFO L478 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 11 treesize of output 8 [2018-12-08 17:11:07,861 INFO L478 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 8 treesize of output 7 [2018-12-08 17:11:07,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,870 INFO L478 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 11 treesize of output 8 [2018-12-08 17:11:07,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 17:11:07,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-08 17:11:07,922 INFO L478 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 25 treesize of output 19 [2018-12-08 17:11:07,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-08 17:11:07,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 17:11:07,934 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:11:07,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:11:07,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:11:07,940 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-12-08 17:11:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:11:08,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:11:08,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-12-08 17:11:08,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-08 17:11:08,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-08 17:11:08,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2018-12-08 17:11:08,223 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-08 17:11:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:11:09,451 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-08 17:11:09,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 17:11:09,451 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-08 17:11:09,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:11:09,452 INFO L225 Difference]: With dead ends: 42 [2018-12-08 17:11:09,452 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 17:11:09,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=344, Invalid=2736, Unknown=0, NotChecked=0, Total=3080 [2018-12-08 17:11:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 17:11:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 17:11:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 17:11:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 17:11:09,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-12-08 17:11:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:11:09,453 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 17:11:09,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-08 17:11:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 17:11:09,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 17:11:09,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:11:09 BoogieIcfgContainer [2018-12-08 17:11:09,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:11:09,459 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:11:09,459 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:11:09,459 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:11:09,459 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:10:49" (3/4) ... [2018-12-08 17:11:09,463 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 17:11:09,469 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 17:11:09,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-08 17:11:09,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-08 17:11:09,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstpncpy [2018-12-08 17:11:09,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 17:11:09,475 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-12-08 17:11:09,475 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-08 17:11:09,475 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 17:11:09,503 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_33bf7c25-733a-4aaf-960a-d8a9c0ffe192/bin-2019/uautomizer/witness.graphml [2018-12-08 17:11:09,503 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:11:09,503 INFO L168 Benchmark]: Toolchain (without parser) took 20665.95 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 448.3 MB). Free memory was 949.5 MB in the beginning and 1.3 GB in the end (delta: -390.4 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2018-12-08 17:11:09,504 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:11:09,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:11:09,504 INFO L168 Benchmark]: Boogie Preprocessor took 30.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:11:09,504 INFO L168 Benchmark]: RCFGBuilder took 288.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:11:09,504 INFO L168 Benchmark]: TraceAbstraction took 20007.44 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 294.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -265.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-12-08 17:11:09,504 INFO L168 Benchmark]: Witness Printer took 44.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:11:09,505 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 288.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20007.44 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 294.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -265.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Witness Printer took 44.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 569]: 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: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 67 locations, 21 error locations. SAFE Result, 19.9s OverallTime, 22 OverallIterations, 3 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 708 SDtfs, 1205 SDslu, 4124 SDs, 0 SdLazy, 4633 SolverSat, 417 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2837 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 111 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 734 NumberOfCodeBlocks, 734 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 706 ConstructedInterpolants, 116 QuantifiedInterpolants, 299665 SizeOfPredicates, 109 NumberOfNonLiveVariables, 1298 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 4/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...