./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 60847b137b78d6fc8305d5c5fcc8bf5228130e36 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:56:01,221 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:56:01,223 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:56:01,235 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:56:01,236 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:56:01,237 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:56:01,238 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:56:01,241 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:56:01,243 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:56:01,245 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:56:01,246 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:56:01,246 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:56:01,249 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:56:01,250 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:56:01,254 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:56:01,255 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:56:01,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:56:01,259 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:56:01,268 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:56:01,271 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:56:01,273 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:56:01,274 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:56:01,282 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:56:01,283 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:56:01,283 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:56:01,284 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:56:01,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:56:01,289 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:56:01,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:56:01,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:56:01,295 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:56:01,296 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:56:01,296 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:56:01,296 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:56:01,299 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:56:01,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:56:01,302 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:56:01,327 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:56:01,328 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:56:01,329 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:56:01,330 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:56:01,331 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:56:01,331 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:56:01,331 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:56:01,332 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:56:01,332 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:56:01,333 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:56:01,333 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:56:01,333 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:56:01,333 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:56:01,334 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:56:01,334 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:56:01,334 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:56:01,336 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:56:01,336 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:56:01,336 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:56:01,336 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:56:01,337 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:56:01,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:01,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:56:01,337 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:56:01,337 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:56:01,337 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:56:01,338 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 60847b137b78d6fc8305d5c5fcc8bf5228130e36 [2019-01-13 21:56:01,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:56:01,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:56:01,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:56:01,410 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:56:01,410 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:56:01,411 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:01,467 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b206711/99733843d0614f76a5e752978652a4a1/FLAG68caed4e9 [2019-01-13 21:56:01,972 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:56:01,974 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:01,991 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b206711/99733843d0614f76a5e752978652a4a1/FLAG68caed4e9 [2019-01-13 21:56:02,271 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b206711/99733843d0614f76a5e752978652a4a1 [2019-01-13 21:56:02,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:56:02,276 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:56:02,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:02,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:56:02,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:56:02,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:02" (1/1) ... [2019-01-13 21:56:02,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f58898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:02, skipping insertion in model container [2019-01-13 21:56:02,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:02" (1/1) ... [2019-01-13 21:56:02,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:56:02,350 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:56:02,684 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:02,701 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:56:02,853 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:02,903 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:56:02,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:02 WrapperNode [2019-01-13 21:56:02,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:02,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:56:02,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:56:02,906 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:56:02,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:02" (1/1) ... [2019-01-13 21:56:02,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:02" (1/1) ... [2019-01-13 21:56:02,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:02" (1/1) ... [2019-01-13 21:56:02,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:02" (1/1) ... [2019-01-13 21:56:02,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:02" (1/1) ... [2019-01-13 21:56:02,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:02" (1/1) ... [2019-01-13 21:56:02,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:02" (1/1) ... [2019-01-13 21:56:02,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:56:02,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:56:02,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:56:02,979 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:56:02,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:03,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:56:03,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:56:03,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:56:03,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:56:03,042 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2019-01-13 21:56:03,042 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:56:03,042 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:56:03,042 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:56:03,042 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:56:03,043 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:56:03,043 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:56:03,043 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:56:03,043 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:56:03,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:56:03,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:56:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:56:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:56:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:56:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:56:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:56:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:56:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:56:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:56:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:56:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:56:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:56:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:56:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:56:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:56:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:56:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:56:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:56:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:56:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:56:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:56:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:56:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:56:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:56:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:56:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:56:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:56:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:56:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:56:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:56:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:56:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:56:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:56:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:56:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:56:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:56:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:56:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:56:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:56:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:56:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:56:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:56:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:56:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:56:03,052 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:56:03,052 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:56:03,052 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:56:03,052 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:56:03,052 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:56:03,052 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:56:03,052 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:56:03,053 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:56:03,053 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:56:03,053 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:56:03,053 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:56:03,053 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:56:03,053 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:56:03,053 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:56:03,053 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:56:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:56:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:56:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:56:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:56:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:56:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:56:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:56:03,055 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:56:03,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:56:03,055 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:56:03,055 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:56:03,055 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:56:03,055 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:56:03,055 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:56:03,055 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:56:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:56:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:56:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:56:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:56:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:56:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:56:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:56:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:56:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:56:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:56:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:56:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:56:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:56:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:56:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2019-01-13 21:56:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:56:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:56:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:56:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:56:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:56:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:56:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:56:03,777 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:56:03,777 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-13 21:56:03,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:03 BoogieIcfgContainer [2019-01-13 21:56:03,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:56:03,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:56:03,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:56:03,783 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:56:03,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:56:02" (1/3) ... [2019-01-13 21:56:03,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753547e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:03, skipping insertion in model container [2019-01-13 21:56:03,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:02" (2/3) ... [2019-01-13 21:56:03,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753547e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:03, skipping insertion in model container [2019-01-13 21:56:03,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:03" (3/3) ... [2019-01-13 21:56:03,786 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:03,796 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:56:03,805 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-13 21:56:03,822 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-13 21:56:03,848 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:56:03,849 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:56:03,849 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:56:03,849 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:56:03,850 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:56:03,850 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:56:03,851 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:56:03,851 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:56:03,851 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:56:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-01-13 21:56:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:03,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:03,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:03,878 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:03,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:03,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1848846346, now seen corresponding path program 1 times [2019-01-13 21:56:03,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:03,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:03,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:03,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:03,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:04,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:04,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:04,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:04,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:04,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:04,107 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-01-13 21:56:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:04,428 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-01-13 21:56:04,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:04,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:56:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:04,440 INFO L225 Difference]: With dead ends: 52 [2019-01-13 21:56:04,440 INFO L226 Difference]: Without dead ends: 49 [2019-01-13 21:56:04,442 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 [2019-01-13 21:56:04,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-13 21:56:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-13 21:56:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-13 21:56:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-01-13 21:56:04,482 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 10 [2019-01-13 21:56:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:04,483 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-01-13 21:56:04,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-01-13 21:56:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:04,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:04,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:04,484 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:04,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1848846347, now seen corresponding path program 1 times [2019-01-13 21:56:04,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:04,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:04,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:04,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:04,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:04,670 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-13 21:56:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:04,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:04,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:04,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:04,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:04,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:04,674 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2019-01-13 21:56:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:04,744 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-01-13 21:56:04,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:04,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:56:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:04,746 INFO L225 Difference]: With dead ends: 48 [2019-01-13 21:56:04,747 INFO L226 Difference]: Without dead ends: 48 [2019-01-13 21:56:04,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-13 21:56:04,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-13 21:56:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-13 21:56:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-01-13 21:56:04,756 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 10 [2019-01-13 21:56:04,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:04,756 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-01-13 21:56:04,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-01-13 21:56:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:04,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:04,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:04,758 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:04,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:04,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1479661869, now seen corresponding path program 1 times [2019-01-13 21:56:04,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:04,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:04,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:04,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:04,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:04,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:04,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:04,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:04,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:04,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:04,849 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 3 states. [2019-01-13 21:56:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:05,031 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-01-13 21:56:05,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:05,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 21:56:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:05,034 INFO L225 Difference]: With dead ends: 47 [2019-01-13 21:56:05,034 INFO L226 Difference]: Without dead ends: 47 [2019-01-13 21:56:05,035 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 [2019-01-13 21:56:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-13 21:56:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-13 21:56:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-13 21:56:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-01-13 21:56:05,044 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 11 [2019-01-13 21:56:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:05,044 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-01-13 21:56:05,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-01-13 21:56:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:05,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:05,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:05,045 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:05,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:05,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1479661870, now seen corresponding path program 1 times [2019-01-13 21:56:05,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:05,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:05,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:05,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:05,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:05,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:05,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:05,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:05,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:05,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:05,150 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2019-01-13 21:56:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:05,173 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-01-13 21:56:05,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:05,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 21:56:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:05,175 INFO L225 Difference]: With dead ends: 46 [2019-01-13 21:56:05,175 INFO L226 Difference]: Without dead ends: 46 [2019-01-13 21:56:05,176 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 [2019-01-13 21:56:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-13 21:56:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-13 21:56:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 21:56:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-01-13 21:56:05,182 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 11 [2019-01-13 21:56:05,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:05,183 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-01-13 21:56:05,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-01-13 21:56:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:05,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:05,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:05,184 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:05,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:05,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1847391341, now seen corresponding path program 1 times [2019-01-13 21:56:05,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:05,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:05,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:05,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:05,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:05,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:05,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:05,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:05,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:05,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:05,302 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 5 states. [2019-01-13 21:56:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:05,710 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-01-13 21:56:05,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:05,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-13 21:56:05,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:05,713 INFO L225 Difference]: With dead ends: 43 [2019-01-13 21:56:05,713 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:56:05,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:56:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 21:56:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:56:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-01-13 21:56:05,719 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 18 [2019-01-13 21:56:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:05,720 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-01-13 21:56:05,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-01-13 21:56:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:05,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:05,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:05,721 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1847391340, now seen corresponding path program 1 times [2019-01-13 21:56:05,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:05,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:05,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:05,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:05,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:05,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:05,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:05,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:05,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:05,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:05,896 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 7 states. [2019-01-13 21:56:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:06,118 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-01-13 21:56:06,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:06,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-13 21:56:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:06,123 INFO L225 Difference]: With dead ends: 65 [2019-01-13 21:56:06,123 INFO L226 Difference]: Without dead ends: 65 [2019-01-13 21:56:06,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-13 21:56:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2019-01-13 21:56:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-13 21:56:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2019-01-13 21:56:06,131 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 18 [2019-01-13 21:56:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:06,132 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2019-01-13 21:56:06,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2019-01-13 21:56:06,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 21:56:06,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:06,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:06,133 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:06,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:06,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1433910531, now seen corresponding path program 1 times [2019-01-13 21:56:06,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:06,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:06,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:06,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:06,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:06,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:06,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:06,359 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 4 states. [2019-01-13 21:56:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:06,495 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-01-13 21:56:06,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:06,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-13 21:56:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:06,497 INFO L225 Difference]: With dead ends: 51 [2019-01-13 21:56:06,497 INFO L226 Difference]: Without dead ends: 44 [2019-01-13 21:56:06,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-13 21:56:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-13 21:56:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:56:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-01-13 21:56:06,502 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 19 [2019-01-13 21:56:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:06,502 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-01-13 21:56:06,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-01-13 21:56:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 21:56:06,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:06,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:06,503 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:06,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1434556706, now seen corresponding path program 1 times [2019-01-13 21:56:06,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:06,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:06,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:06,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:06,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:06,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:06,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:06,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:06,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:06,584 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 5 states. [2019-01-13 21:56:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:06,794 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-01-13 21:56:06,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:06,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-13 21:56:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:06,800 INFO L225 Difference]: With dead ends: 42 [2019-01-13 21:56:06,800 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:56:06,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:56:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-13 21:56:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 21:56:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-01-13 21:56:06,804 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 19 [2019-01-13 21:56:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:06,804 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-01-13 21:56:06,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-01-13 21:56:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 21:56:06,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:06,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:06,806 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:06,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:06,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1434556705, now seen corresponding path program 1 times [2019-01-13 21:56:06,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:06,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:06,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:06,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:06,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:06,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:06,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:06,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:06,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:06,945 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 7 states. [2019-01-13 21:56:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:07,079 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2019-01-13 21:56:07,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:07,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-01-13 21:56:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:07,081 INFO L225 Difference]: With dead ends: 46 [2019-01-13 21:56:07,082 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:56:07,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:56:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-01-13 21:56:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 21:56:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-13 21:56:07,086 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 19 [2019-01-13 21:56:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:07,086 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-13 21:56:07,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-13 21:56:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:56:07,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:07,088 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:07,088 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash -639091287, now seen corresponding path program 1 times [2019-01-13 21:56:07,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:07,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:07,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:07,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:07,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:07,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:07,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:07,145 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2019-01-13 21:56:07,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:07,168 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-01-13 21:56:07,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:07,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-13 21:56:07,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:07,170 INFO L225 Difference]: With dead ends: 43 [2019-01-13 21:56:07,170 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:56:07,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:56:07,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-13 21:56:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 21:56:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-01-13 21:56:07,174 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 23 [2019-01-13 21:56:07,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:07,174 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-01-13 21:56:07,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-01-13 21:56:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 21:56:07,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:07,176 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:07,176 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:07,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:07,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1282682171, now seen corresponding path program 1 times [2019-01-13 21:56:07,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:07,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:07,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:07,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:07,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:07,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:07,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:07,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:07,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:07,223 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2019-01-13 21:56:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:07,229 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-01-13 21:56:07,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:07,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-13 21:56:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:07,231 INFO L225 Difference]: With dead ends: 43 [2019-01-13 21:56:07,232 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:56:07,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:56:07,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-13 21:56:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 21:56:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-01-13 21:56:07,236 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 26 [2019-01-13 21:56:07,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:07,237 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-01-13 21:56:07,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-01-13 21:56:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:07,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:07,238 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:07,238 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:07,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1573721152, now seen corresponding path program 1 times [2019-01-13 21:56:07,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:07,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:07,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:07,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:07,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:07,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 21:56:07,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 21:56:07,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 21:56:07,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:07,533 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 9 states. [2019-01-13 21:56:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:07,754 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-01-13 21:56:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 21:56:07,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-01-13 21:56:07,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:07,755 INFO L225 Difference]: With dead ends: 60 [2019-01-13 21:56:07,756 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:56:07,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-13 21:56:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:56:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-13 21:56:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 21:56:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-01-13 21:56:07,765 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 28 [2019-01-13 21:56:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:07,765 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-01-13 21:56:07,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 21:56:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-01-13 21:56:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:07,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:07,766 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:07,766 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:07,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:07,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1792575870, now seen corresponding path program 1 times [2019-01-13 21:56:07,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:07,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:07,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:07,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:08,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:08,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-13 21:56:08,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:08,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:08,265 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 11 treesize of output 8 [2019-01-13 21:56:08,268 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 [2019-01-13 21:56:08,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:08,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:08,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:08,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-13 21:56:08,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-01-13 21:56:08,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2019-01-13 21:56:08,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:08,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-13 21:56:08,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:08,774 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 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-13 21:56:08,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:08,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:08,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:08,793 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-01-13 21:56:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:08,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 21:56:08,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 20 [2019-01-13 21:56:08,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 21:56:08,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 21:56:08,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-01-13 21:56:08,855 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 20 states. [2019-01-13 21:56:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:10,712 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-01-13 21:56:10,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-13 21:56:10,713 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-01-13 21:56:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:10,715 INFO L225 Difference]: With dead ends: 77 [2019-01-13 21:56:10,715 INFO L226 Difference]: Without dead ends: 60 [2019-01-13 21:56:10,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=186, Invalid=1146, Unknown=0, NotChecked=0, Total=1332 [2019-01-13 21:56:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-13 21:56:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-01-13 21:56:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-13 21:56:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-01-13 21:56:10,722 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 28 [2019-01-13 21:56:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:10,722 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-01-13 21:56:10,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 21:56:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-01-13 21:56:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 21:56:10,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:10,723 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:10,723 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash -45868173, now seen corresponding path program 1 times [2019-01-13 21:56:10,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:10,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:10,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:10,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:10,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:11,101 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-13 21:56:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:11,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:11,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-13 21:56:11,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:11,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:11,445 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 [2019-01-13 21:56:11,453 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 [2019-01-13 21:56:11,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:11,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:11,467 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. [2019-01-13 21:56:11,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-13 21:56:12,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2019-01-13 21:56:12,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2019-01-13 21:56:12,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:12,158 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 16 [2019-01-13 21:56:12,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:12,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 23 [2019-01-13 21:56:12,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:12,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:56:12,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:12,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:33 [2019-01-13 21:56:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:12,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:12,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-01-13 21:56:12,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-13 21:56:12,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-13 21:56:12,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-01-13 21:56:12,417 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 23 states. [2019-01-13 21:56:13,143 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-01-13 21:56:13,543 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-01-13 21:56:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:13,774 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-01-13 21:56:13,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 21:56:13,775 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-01-13 21:56:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:13,776 INFO L225 Difference]: With dead ends: 58 [2019-01-13 21:56:13,777 INFO L226 Difference]: Without dead ends: 54 [2019-01-13 21:56:13,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2019-01-13 21:56:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-13 21:56:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-01-13 21:56:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-13 21:56:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-01-13 21:56:13,784 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 29 [2019-01-13 21:56:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:13,787 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-01-13 21:56:13,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-13 21:56:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-01-13 21:56:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 21:56:13,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:13,788 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:13,788 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash 916932140, now seen corresponding path program 1 times [2019-01-13 21:56:13,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:13,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:13,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:13,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:13,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:14,401 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-01-13 21:56:14,557 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-13 21:56:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:14,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:14,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-13 21:56:14,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:14,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:15,023 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 21:56:15,036 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 [2019-01-13 21:56:15,076 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 [2019-01-13 21:56:15,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,112 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 [2019-01-13 21:56:15,112 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,120 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:56:15,147 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 15 treesize of output 12 [2019-01-13 21:56:15,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 21:56:15,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-13 21:56:15,246 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 28 treesize of output 29 [2019-01-13 21:56:15,250 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 [2019-01-13 21:56:15,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:15,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-13 21:56:15,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2019-01-13 21:56:15,523 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 15 treesize of output 12 [2019-01-13 21:56:15,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:15,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2019-01-13 21:56:15,537 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:15,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:15,552 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2019-01-13 21:56:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:15,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:15,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-01-13 21:56:15,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-13 21:56:15,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-13 21:56:15,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-01-13 21:56:15,738 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 21 states. [2019-01-13 21:56:16,686 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-01-13 21:56:17,341 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-01-13 21:56:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:17,509 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-13 21:56:17,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 21:56:17,510 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-01-13 21:56:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:17,511 INFO L225 Difference]: With dead ends: 51 [2019-01-13 21:56:17,511 INFO L226 Difference]: Without dead ends: 51 [2019-01-13 21:56:17,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2019-01-13 21:56:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-13 21:56:17,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-01-13 21:56:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-13 21:56:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-13 21:56:17,515 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 38 [2019-01-13 21:56:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:17,516 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-13 21:56:17,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-13 21:56:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-13 21:56:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 21:56:17,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:17,517 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:17,517 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:17,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1639874745, now seen corresponding path program 2 times [2019-01-13 21:56:17,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:17,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:17,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:17,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:17,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:18,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:18,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-13 21:56:18,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:56:18,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:56:18,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:56:18,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:18,071 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:56:18,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:56:18,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:18,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:18,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:18,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-13 21:56:18,235 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 16 treesize of output 13 [2019-01-13 21:56:18,237 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 [2019-01-13 21:56:18,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:18,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:18,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:18,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-01-13 21:56:18,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2019-01-13 21:56:18,817 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 27 treesize of output 25 [2019-01-13 21:56:18,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:18,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-01-13 21:56:18,843 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:18,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-13 21:56:18,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:18,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 27 [2019-01-13 21:56:18,889 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:18,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:56:18,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:18,936 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:49, output treesize:49 [2019-01-13 21:56:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:19,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:19,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-01-13 21:56:19,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-13 21:56:19,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-13 21:56:19,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-01-13 21:56:19,075 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 25 states. [2019-01-13 21:56:20,082 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-01-13 21:56:20,427 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-01-13 21:56:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:21,223 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-01-13 21:56:21,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 21:56:21,224 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2019-01-13 21:56:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:21,224 INFO L225 Difference]: With dead ends: 49 [2019-01-13 21:56:21,224 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:56:21,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2019-01-13 21:56:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:56:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:56:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:56:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:56:21,226 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-01-13 21:56:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:21,226 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:56:21,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-13 21:56:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:56:21,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:56:21,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:56:21 BoogieIcfgContainer [2019-01-13 21:56:21,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:56:21,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:56:21,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:56:21,233 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:56:21,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:03" (3/4) ... [2019-01-13 21:56:21,237 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:56:21,243 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:56:21,243 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:56:21,244 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:56:21,244 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:56:21,244 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncmp [2019-01-13 21:56:21,249 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-01-13 21:56:21,250 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-13 21:56:21,250 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-13 21:56:21,312 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:56:21,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:56:21,316 INFO L168 Benchmark]: Toolchain (without parser) took 19040.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -66.8 MB). Peak memory consumption was 243.6 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:21,317 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:21,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:21,318 INFO L168 Benchmark]: Boogie Preprocessor took 72.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:21,318 INFO L168 Benchmark]: RCFGBuilder took 800.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:21,318 INFO L168 Benchmark]: TraceAbstraction took 17452.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.5 MB). Peak memory consumption was 216.2 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:21,319 INFO L168 Benchmark]: Witness Printer took 80.16 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:21,324 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 628.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 800.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17452.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.5 MB). Peak memory consumption was 216.2 MB. Max. memory is 11.5 GB. * Witness Printer took 80.16 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: 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: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 15 error locations. SAFE Result, 17.3s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 565 SDtfs, 829 SDslu, 1953 SDs, 0 SdLazy, 1778 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=13, 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, 16 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 460 ConstructedInterpolants, 58 QuantifiedInterpolants, 166539 SizeOfPredicates, 44 NumberOfNonLiveVariables, 646 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 20 InterpolantComputations, 13 PerfectInterpolantSequences, 27/90 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...