./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-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_d77cf890-aaa1-4bfc-a426-123810574f99/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/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 bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:29:44,222 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:29:44,223 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:29:44,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:29:44,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:29:44,230 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:29:44,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:29:44,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:29:44,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:29:44,234 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:29:44,235 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:29:44,235 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:29:44,236 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:29:44,236 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:29:44,237 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:29:44,238 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:29:44,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:29:44,240 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:29:44,241 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:29:44,242 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:29:44,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:29:44,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:29:44,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:29:44,246 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:29:44,246 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:29:44,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:29:44,247 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:29:44,248 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:29:44,248 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:29:44,249 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:29:44,249 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:29:44,250 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:29:44,250 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:29:44,250 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:29:44,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:29:44,251 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:29:44,252 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 01:29:44,261 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:29:44,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:29:44,262 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:29:44,262 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:29:44,262 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:29:44,262 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:29:44,262 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:29:44,263 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:29:44,263 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:29:44,263 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:29:44,263 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:29:44,263 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:29:44,263 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:29:44,264 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:29:44,264 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:29:44,264 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:29:44,264 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:29:44,264 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:29:44,264 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:29:44,265 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:29:44,265 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:29:44,265 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:29:44,265 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:29:44,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:29:44,265 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:29:44,265 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:29:44,266 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:29:44,266 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:29:44,266 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_d77cf890-aaa1-4bfc-a426-123810574f99/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 -> bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 [2018-12-09 01:29:44,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:29:44,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:29:44,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:29:44,296 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:29:44,296 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:29:44,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 01:29:44,332 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/bin-2019/uautomizer/data/fddfc3992/b95bf395d8324e54962d3d9a4a229dbb/FLAG1a65d0d61 [2018-12-09 01:29:44,775 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:29:44,775 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 01:29:44,782 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/bin-2019/uautomizer/data/fddfc3992/b95bf395d8324e54962d3d9a4a229dbb/FLAG1a65d0d61 [2018-12-09 01:29:44,790 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/bin-2019/uautomizer/data/fddfc3992/b95bf395d8324e54962d3d9a4a229dbb [2018-12-09 01:29:44,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:29:44,792 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 01:29:44,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:29:44,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:29:44,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:29:44,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:29:44" (1/1) ... [2018-12-09 01:29:44,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e809d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:29:44, skipping insertion in model container [2018-12-09 01:29:44,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:29:44" (1/1) ... [2018-12-09 01:29:44,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:29:44,819 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:29:44,959 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:29:44,966 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:29:45,028 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:29:45,047 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:29:45,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:29:45 WrapperNode [2018-12-09 01:29:45,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:29:45,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:29:45,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:29:45,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:29:45,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:29:45" (1/1) ... [2018-12-09 01:29:45,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:29:45" (1/1) ... [2018-12-09 01:29:45,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:29:45" (1/1) ... [2018-12-09 01:29:45,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:29:45" (1/1) ... [2018-12-09 01:29:45,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:29:45" (1/1) ... [2018-12-09 01:29:45,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:29:45" (1/1) ... [2018-12-09 01:29:45,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:29:45" (1/1) ... [2018-12-09 01:29:45,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:29:45,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:29:45,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:29:45,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:29:45,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:29:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/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-09 01:29:45,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:29:45,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:29:45,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 01:29:45,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 01:29:45,109 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-12-09 01:29:45,109 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:29:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 01:29:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 01:29:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 01:29:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 01:29:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 01:29:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 01:29:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 01:29:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 01:29:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 01:29:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 01:29:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 01:29:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 01:29:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 01:29:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 01:29:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 01:29:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 01:29:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 01:29:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 01:29:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 01:29:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 01:29:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 01:29:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 01:29:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 01:29:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 01:29:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 01:29:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 01:29:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 01:29:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 01:29:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-12-09 01:29:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:29:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:29:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:29:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:29:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:29:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:29:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:29:45,321 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:29:45,321 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 01:29:45,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:29:45 BoogieIcfgContainer [2018-12-09 01:29:45,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:29:45,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:29:45,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:29:45,324 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:29:45,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:29:44" (1/3) ... [2018-12-09 01:29:45,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b78746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:29:45, skipping insertion in model container [2018-12-09 01:29:45,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:29:45" (2/3) ... [2018-12-09 01:29:45,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b78746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:29:45, skipping insertion in model container [2018-12-09 01:29:45,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:29:45" (3/3) ... [2018-12-09 01:29:45,326 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 01:29:45,331 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:29:45,336 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-09 01:29:45,346 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-09 01:29:45,362 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:29:45,362 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:29:45,362 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:29:45,362 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:29:45,362 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:29:45,362 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:29:45,363 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:29:45,363 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:29:45,363 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:29:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-12-09 01:29:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 01:29:45,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:45,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:29:45,379 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:45,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash 412779915, now seen corresponding path program 1 times [2018-12-09 01:29:45,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:45,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:45,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:45,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:45,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:45,481 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-09 01:29:45,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:45,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:29:45,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:29:45,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:29:45,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:29:45,494 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-12-09 01:29:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:45,533 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-09 01:29:45,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:29:45,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 01:29:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:45,539 INFO L225 Difference]: With dead ends: 39 [2018-12-09 01:29:45,539 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 01:29:45,540 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-09 01:29:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 01:29:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 01:29:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 01:29:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-09 01:29:45,561 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2018-12-09 01:29:45,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:45,561 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-09 01:29:45,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:29:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-09 01:29:45,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 01:29:45,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:45,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:29:45,562 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:45,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:45,562 INFO L82 PathProgramCache]: Analyzing trace with hash 412779916, now seen corresponding path program 1 times [2018-12-09 01:29:45,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:45,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:45,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:45,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:45,598 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-09 01:29:45,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:45,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:29:45,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:29:45,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:29:45,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:29:45,599 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 4 states. [2018-12-09 01:29:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:45,612 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-09 01:29:45,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:29:45,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 01:29:45,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:45,613 INFO L225 Difference]: With dead ends: 35 [2018-12-09 01:29:45,613 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 01:29:45,613 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-09 01:29:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 01:29:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-09 01:29:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 01:29:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-12-09 01:29:45,616 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 10 [2018-12-09 01:29:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:45,616 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-12-09 01:29:45,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:29:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-12-09 01:29:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:29:45,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:45,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:29:45,616 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:45,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:45,617 INFO L82 PathProgramCache]: Analyzing trace with hash 472169900, now seen corresponding path program 1 times [2018-12-09 01:29:45,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:45,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:45,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:45,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:45,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:45,666 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-09 01:29:45,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:45,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:29:45,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:29:45,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:29:45,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:29:45,667 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 7 states. [2018-12-09 01:29:45,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:45,731 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-12-09 01:29:45,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:29:45,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-09 01:29:45,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:45,733 INFO L225 Difference]: With dead ends: 37 [2018-12-09 01:29:45,734 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 01:29:45,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:29:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 01:29:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-12-09 01:29:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 01:29:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-09 01:29:45,738 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 15 [2018-12-09 01:29:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:45,738 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-09 01:29:45,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:29:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-09 01:29:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:29:45,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:45,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:29:45,739 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:45,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:45,739 INFO L82 PathProgramCache]: Analyzing trace with hash 472169901, now seen corresponding path program 1 times [2018-12-09 01:29:45,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:45,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:45,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:45,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:45,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:45,824 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-09 01:29:45,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:45,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:29:45,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:29:45,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:29:45,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:29:45,825 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 9 states. [2018-12-09 01:29:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:45,898 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-12-09 01:29:45,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:29:45,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-12-09 01:29:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:45,899 INFO L225 Difference]: With dead ends: 40 [2018-12-09 01:29:45,899 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 01:29:45,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:29:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 01:29:45,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-12-09 01:29:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 01:29:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-09 01:29:45,903 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 15 [2018-12-09 01:29:45,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:45,903 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-09 01:29:45,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:29:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-09 01:29:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 01:29:45,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:45,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:29:45,905 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:45,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:45,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1752364997, now seen corresponding path program 1 times [2018-12-09 01:29:45,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:45,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:45,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:45,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:45,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:45,962 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-09 01:29:45,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:45,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:29:45,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:29:45,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:29:45,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:29:45,963 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2018-12-09 01:29:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:46,031 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-12-09 01:29:46,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:29:46,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-09 01:29:46,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:46,032 INFO L225 Difference]: With dead ends: 38 [2018-12-09 01:29:46,032 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 01:29:46,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:29:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 01:29:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-12-09 01:29:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 01:29:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-12-09 01:29:46,034 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2018-12-09 01:29:46,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:46,035 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-12-09 01:29:46,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:29:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-12-09 01:29:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 01:29:46,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:46,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:29:46,035 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:46,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1752364998, now seen corresponding path program 1 times [2018-12-09 01:29:46,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:46,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:46,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:46,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:46,094 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-09 01:29:46,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:46,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:29:46,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:29:46,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:29:46,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:29:46,095 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 8 states. [2018-12-09 01:29:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:46,162 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-09 01:29:46,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:29:46,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-09 01:29:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:46,163 INFO L225 Difference]: With dead ends: 37 [2018-12-09 01:29:46,163 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 01:29:46,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:29:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 01:29:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-09 01:29:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 01:29:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-09 01:29:46,166 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2018-12-09 01:29:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:46,166 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-09 01:29:46,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:29:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-09 01:29:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 01:29:46,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:46,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:29:46,167 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:46,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:46,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1695369597, now seen corresponding path program 1 times [2018-12-09 01:29:46,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:46,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:46,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:46,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:46,195 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-09 01:29:46,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:46,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:29:46,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:29:46,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:29:46,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:29:46,196 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2018-12-09 01:29:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:46,217 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-12-09 01:29:46,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:29:46,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 01:29:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:46,219 INFO L225 Difference]: With dead ends: 48 [2018-12-09 01:29:46,219 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 01:29:46,220 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-09 01:29:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 01:29:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-12-09 01:29:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 01:29:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-09 01:29:46,227 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 18 [2018-12-09 01:29:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:46,227 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-09 01:29:46,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:29:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-09 01:29:46,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 01:29:46,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:46,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:29:46,229 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:46,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1898533121, now seen corresponding path program 1 times [2018-12-09 01:29:46,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:46,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:46,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:46,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:46,274 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-09 01:29:46,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:46,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:29:46,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:29:46,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:29:46,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:29:46,275 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 4 states. [2018-12-09 01:29:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:46,310 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-12-09 01:29:46,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:29:46,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 01:29:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:46,311 INFO L225 Difference]: With dead ends: 41 [2018-12-09 01:29:46,311 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 01:29:46,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:29:46,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 01:29:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-12-09 01:29:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 01:29:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-09 01:29:46,313 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-12-09 01:29:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:46,313 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-09 01:29:46,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:29:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-09 01:29:46,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:29:46,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:46,313 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] [2018-12-09 01:29:46,313 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:46,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:46,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2098008373, now seen corresponding path program 1 times [2018-12-09 01:29:46,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:46,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:46,351 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-09 01:29:46,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:46,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:29:46,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:29:46,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:29:46,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:29:46,352 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-12-09 01:29:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:46,389 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-12-09 01:29:46,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:29:46,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 01:29:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:46,390 INFO L225 Difference]: With dead ends: 29 [2018-12-09 01:29:46,390 INFO L226 Difference]: Without dead ends: 29 [2018-12-09 01:29:46,390 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-09 01:29:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-09 01:29:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-09 01:29:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 01:29:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-09 01:29:46,392 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2018-12-09 01:29:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:46,393 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-09 01:29:46,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:29:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-09 01:29:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:29:46,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:46,394 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] [2018-12-09 01:29:46,394 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:46,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:46,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2098008372, now seen corresponding path program 1 times [2018-12-09 01:29:46,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:46,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:46,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:46,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:46,492 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-09 01:29:46,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:46,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:29:46,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:29:46,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:29:46,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:29:46,493 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2018-12-09 01:29:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:46,540 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-12-09 01:29:46,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:29:46,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-09 01:29:46,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:46,541 INFO L225 Difference]: With dead ends: 63 [2018-12-09 01:29:46,541 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 01:29:46,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:29:46,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 01:29:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2018-12-09 01:29:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 01:29:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-09 01:29:46,544 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2018-12-09 01:29:46,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:46,544 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-09 01:29:46,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:29:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-09 01:29:46,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:29:46,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:46,545 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] [2018-12-09 01:29:46,545 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:46,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:46,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1610152910, now seen corresponding path program 1 times [2018-12-09 01:29:46,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:46,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:46,640 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-09 01:29:46,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:46,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 01:29:46,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 01:29:46,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 01:29:46,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:29:46,641 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2018-12-09 01:29:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:46,776 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-09 01:29:46,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:29:46,776 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-09 01:29:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:46,776 INFO L225 Difference]: With dead ends: 44 [2018-12-09 01:29:46,776 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 01:29:46,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:29:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 01:29:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-12-09 01:29:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 01:29:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-12-09 01:29:46,779 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-12-09 01:29:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:46,780 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-09 01:29:46,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 01:29:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-12-09 01:29:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 01:29:46,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:46,780 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] [2018-12-09 01:29:46,780 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:46,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:46,781 INFO L82 PathProgramCache]: Analyzing trace with hash -595711829, now seen corresponding path program 1 times [2018-12-09 01:29:46,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:46,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:46,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:46,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:46,858 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-09 01:29:46,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:46,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:29:46,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:29:46,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:29:46,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:29:46,859 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-12-09 01:29:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:46,891 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-12-09 01:29:46,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:29:46,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-09 01:29:46,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:46,892 INFO L225 Difference]: With dead ends: 44 [2018-12-09 01:29:46,892 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 01:29:46,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:29:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 01:29:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 01:29:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 01:29:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-09 01:29:46,895 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2018-12-09 01:29:46,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:46,895 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-09 01:29:46,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:29:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-09 01:29:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 01:29:46,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:46,895 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] [2018-12-09 01:29:46,896 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:46,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:46,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1606829079, now seen corresponding path program 1 times [2018-12-09 01:29:46,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:46,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:46,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:46,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:46,990 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-09 01:29:46,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:29:46,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 01:29:46,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:29:46,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:29:46,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:29:46,991 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 10 states. [2018-12-09 01:29:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:47,090 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-12-09 01:29:47,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:29:47,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-09 01:29:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:47,091 INFO L225 Difference]: With dead ends: 51 [2018-12-09 01:29:47,091 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 01:29:47,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:29:47,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 01:29:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-12-09 01:29:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 01:29:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-12-09 01:29:47,094 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 21 [2018-12-09 01:29:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:47,094 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-12-09 01:29:47,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:29:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-12-09 01:29:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 01:29:47,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:47,095 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] [2018-12-09 01:29:47,095 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:47,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:47,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1408274539, now seen corresponding path program 1 times [2018-12-09 01:29:47,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:47,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:47,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:47,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:47,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:47,226 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-09 01:29:47,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:29:47,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/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-09 01:29:47,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:47,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:29:47,289 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-09 01:29:47,291 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-09 01:29:47,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:47,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:47,298 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-09 01:29:47,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 01:29:47,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, 0 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-09 01:29:47,428 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-09 01:29:47,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:29:47,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:29:47,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:29:47,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-09 01:29:47,471 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-09 01:29:47,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:29:47,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-12-09 01:29:47,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 01:29:47,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 01:29:47,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-12-09 01:29:47,487 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 18 states. [2018-12-09 01:29:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:50,189 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-12-09 01:29:50,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:29:50,189 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-09 01:29:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:50,189 INFO L225 Difference]: With dead ends: 50 [2018-12-09 01:29:50,189 INFO L226 Difference]: Without dead ends: 50 [2018-12-09 01:29:50,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-12-09 01:29:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-09 01:29:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-12-09 01:29:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 01:29:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-12-09 01:29:50,191 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 21 [2018-12-09 01:29:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:50,191 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-12-09 01:29:50,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 01:29:50,192 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-12-09 01:29:50,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 01:29:50,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:50,192 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] [2018-12-09 01:29:50,192 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:50,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:50,192 INFO L82 PathProgramCache]: Analyzing trace with hash 706837704, now seen corresponding path program 1 times [2018-12-09 01:29:50,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:50,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:50,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:50,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:50,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:50,290 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-09 01:29:50,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:29:50,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/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-09 01:29:50,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:50,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:29:50,321 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-09 01:29:50,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:50,325 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-09 01:29:50,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-09 01:29:50,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:50,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:50,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:50,340 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 01:29:50,469 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-09 01:29:50,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:29:50,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-12-09 01:29:50,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 01:29:50,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 01:29:50,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2018-12-09 01:29:50,484 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 21 states. [2018-12-09 01:29:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:50,780 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-09 01:29:50,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:29:50,781 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2018-12-09 01:29:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:50,781 INFO L225 Difference]: With dead ends: 49 [2018-12-09 01:29:50,781 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 01:29:50,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-12-09 01:29:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 01:29:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-09 01:29:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 01:29:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-12-09 01:29:50,783 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 22 [2018-12-09 01:29:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:50,783 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-12-09 01:29:50,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 01:29:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-12-09 01:29:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:29:50,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:50,784 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] [2018-12-09 01:29:50,784 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:50,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2142368762, now seen corresponding path program 1 times [2018-12-09 01:29:50,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:50,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:50,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:50,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:50,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:50,905 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-09 01:29:50,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:29:50,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/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-09 01:29:50,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:50,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:29:50,938 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-09 01:29:50,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:50,945 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-09 01:29:50,947 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-09 01:29:50,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:50,950 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:50,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:50,954 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 01:29:51,073 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-09 01:29:51,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:29:51,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-12-09 01:29:51,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 01:29:51,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 01:29:51,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-12-09 01:29:51,089 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 20 states. [2018-12-09 01:29:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:51,616 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-12-09 01:29:51,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 01:29:51,616 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-09 01:29:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:51,617 INFO L225 Difference]: With dead ends: 57 [2018-12-09 01:29:51,617 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 01:29:51,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 01:29:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 01:29:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-09 01:29:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 01:29:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-09 01:29:51,618 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2018-12-09 01:29:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:51,618 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-09 01:29:51,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 01:29:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-09 01:29:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 01:29:51,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:51,619 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] [2018-12-09 01:29:51,619 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:51,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:51,619 INFO L82 PathProgramCache]: Analyzing trace with hash 267592398, now seen corresponding path program 1 times [2018-12-09 01:29:51,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:51,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:51,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:51,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:51,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:51,739 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-09 01:29:51,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:29:51,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/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-09 01:29:51,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:51,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:29:51,774 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-09 01:29:51,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:51,781 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-09 01:29:51,784 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-09 01:29:51,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:51,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:51,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:51,805 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 01:29:51,926 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-09 01:29:51,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:29:51,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-12-09 01:29:51,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 01:29:51,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 01:29:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-12-09 01:29:51,942 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 20 states. [2018-12-09 01:29:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:52,404 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-09 01:29:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 01:29:52,404 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-12-09 01:29:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:52,404 INFO L225 Difference]: With dead ends: 38 [2018-12-09 01:29:52,404 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 01:29:52,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 01:29:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 01:29:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-09 01:29:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 01:29:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-09 01:29:52,406 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-12-09 01:29:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:52,406 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-09 01:29:52,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 01:29:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-09 01:29:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 01:29:52,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:52,406 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] [2018-12-09 01:29:52,407 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:52,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:52,407 INFO L82 PathProgramCache]: Analyzing trace with hash -276531991, now seen corresponding path program 2 times [2018-12-09 01:29:52,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:52,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:52,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:52,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:29:52,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:52,618 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-09 01:29:52,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:29:52,619 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/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-09 01:29:52,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:29:52,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:29:52,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:29:52,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:29:52,652 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-09 01:29:52,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:52,656 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-09 01:29:52,658 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-09 01:29:52,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:52,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:52,667 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-09 01:29:52,667 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-09 01:29:52,682 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-09 01:29:52,683 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-09 01:29:52,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:52,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:52,689 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-09 01:29:52,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-12-09 01:29:52,825 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 24 treesize of output 25 [2018-12-09 01:29:52,827 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-09 01:29:52,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:52,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:52,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:52,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-12-09 01:29:52,897 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 22 treesize of output 18 [2018-12-09 01:29:52,902 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-09 01:29:52,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:29:52,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:29:52,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:29:52,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-12-09 01:29:52,945 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-09 01:29:52,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:29:52,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-12-09 01:29:52,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 01:29:52,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 01:29:52,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2018-12-09 01:29:52,961 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 24 states. [2018-12-09 01:29:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:53,607 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-09 01:29:53,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 01:29:53,608 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2018-12-09 01:29:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:53,608 INFO L225 Difference]: With dead ends: 30 [2018-12-09 01:29:53,608 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 01:29:53,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 01:29:53,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 01:29:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-09 01:29:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 01:29:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-09 01:29:53,610 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-09 01:29:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:53,610 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-09 01:29:53,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 01:29:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-09 01:29:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 01:29:53,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:29:53,611 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] [2018-12-09 01:29:53,611 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 01:29:53,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:29:53,612 INFO L82 PathProgramCache]: Analyzing trace with hash 17442826, now seen corresponding path program 2 times [2018-12-09 01:29:53,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:29:53,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:29:53,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:53,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:29:53,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:29:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:29:53,774 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-09 01:29:53,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:29:53,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/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-09 01:29:53,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:29:53,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:29:53,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:29:53,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:29:53,815 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-09 01:29:53,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:53,820 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-09 01:29:53,824 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-09 01:29:53,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:53,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:53,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:53,831 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 01:29:53,982 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-09 01:29:53,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:29:53,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-12-09 01:29:53,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 01:29:53,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 01:29:53,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-12-09 01:29:53,997 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2018-12-09 01:29:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:29:54,474 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-09 01:29:54,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 01:29:54,475 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-12-09 01:29:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:29:54,475 INFO L225 Difference]: With dead ends: 35 [2018-12-09 01:29:54,475 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 01:29:54,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 01:29:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 01:29:54,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 01:29:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 01:29:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 01:29:54,476 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-12-09 01:29:54,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:29:54,476 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:29:54,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 01:29:54,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:29:54,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 01:29:54,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:29:54 BoogieIcfgContainer [2018-12-09 01:29:54,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:29:54,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:29:54,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:29:54,479 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:29:54,479 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:29:45" (3/4) ... [2018-12-09 01:29:54,482 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 01:29:54,486 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncpy [2018-12-09 01:29:54,486 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 01:29:54,486 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-09 01:29:54,486 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-09 01:29:54,486 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 01:29:54,488 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-12-09 01:29:54,489 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 01:29:54,489 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 01:29:54,516 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d77cf890-aaa1-4bfc-a426-123810574f99/bin-2019/uautomizer/witness.graphml [2018-12-09 01:29:54,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:29:54,517 INFO L168 Benchmark]: Toolchain (without parser) took 9725.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 951.7 MB in the beginning and 1.0 GB in the end (delta: -56.6 MB). Peak memory consumption was 118.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:29:54,518 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:29:54,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -138.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:29:54,518 INFO L168 Benchmark]: Boogie Preprocessor took 29.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:29:54,518 INFO L168 Benchmark]: RCFGBuilder took 244.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:29:54,519 INFO L168 Benchmark]: TraceAbstraction took 9157.02 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 31.8 MB). Peak memory consumption was 105.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:29:54,519 INFO L168 Benchmark]: Witness Printer took 37.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:29:54,520 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -138.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 244.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9157.02 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 31.8 MB). Peak memory consumption was 105.7 MB. Max. memory is 11.5 GB. * Witness Printer took 37.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: 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: 547]: 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: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 46 locations, 9 error locations. SAFE Result, 9.1s OverallTime, 19 OverallIterations, 3 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 455 SDtfs, 674 SDslu, 2190 SDs, 0 SdLazy, 2185 SolverSat, 169 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=15, 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, 19 MinimizatonAttempts, 60 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 491 ConstructedInterpolants, 21 QuantifiedInterpolants, 103417 SizeOfPredicates, 82 NumberOfNonLiveVariables, 976 ConjunctsInSsa, 290 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 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...