./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_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/openbsd_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 b2d654b7b73105d319f19561f723c76c3f2a6a70 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:39,572 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:56:39,574 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:56:39,588 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:56:39,589 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:56:39,590 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:56:39,591 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:56:39,593 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:56:39,595 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:56:39,596 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:56:39,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:56:39,597 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:56:39,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:56:39,600 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:56:39,601 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:56:39,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:56:39,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:56:39,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:56:39,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:56:39,609 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:56:39,610 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:56:39,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:56:39,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:56:39,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:56:39,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:56:39,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:56:39,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:56:39,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:56:39,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:56:39,621 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:56:39,621 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:56:39,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:56:39,622 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:56:39,622 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:56:39,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:56:39,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:56:39,624 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:39,650 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:56:39,651 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:56:39,653 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:56:39,654 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:56:39,654 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:56:39,654 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:56:39,655 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:56:39,655 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:56:39,655 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:56:39,655 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:56:39,655 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:56:39,655 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:56:39,656 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:56:39,656 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:56:39,656 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:56:39,656 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:56:39,656 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:56:39,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:56:39,657 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:56:39,659 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:56:39,659 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:56:39,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:39,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:56:39,660 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:56:39,661 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:56:39,661 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:56:39,661 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 -> b2d654b7b73105d319f19561f723c76c3f2a6a70 [2019-01-13 21:56:39,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:56:39,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:56:39,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:56:39,746 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:56:39,746 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:56:39,747 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:39,803 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9a15555/68375f9c2aae4479901e0207c04fd933/FLAG737de7827 [2019-01-13 21:56:40,368 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:56:40,369 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:40,387 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9a15555/68375f9c2aae4479901e0207c04fd933/FLAG737de7827 [2019-01-13 21:56:40,584 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9a15555/68375f9c2aae4479901e0207c04fd933 [2019-01-13 21:56:40,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:56:40,589 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:56:40,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:40,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:56:40,594 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:56:40,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:40" (1/1) ... [2019-01-13 21:56:40,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0317a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:40, skipping insertion in model container [2019-01-13 21:56:40,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:40" (1/1) ... [2019-01-13 21:56:40,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:56:40,666 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:56:40,990 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:41,006 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:56:41,061 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:41,121 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:56:41,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:41 WrapperNode [2019-01-13 21:56:41,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:41,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:56:41,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:56:41,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:56:41,203 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:41" (1/1) ... [2019-01-13 21:56:41,203 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:41" (1/1) ... [2019-01-13 21:56:41,218 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:41" (1/1) ... [2019-01-13 21:56:41,218 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:41" (1/1) ... [2019-01-13 21:56:41,241 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:41" (1/1) ... [2019-01-13 21:56:41,246 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:41" (1/1) ... [2019-01-13 21:56:41,249 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:41" (1/1) ... [2019-01-13 21:56:41,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:56:41,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:56:41,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:56:41,256 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:56:41,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:41" (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:41,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:56:41,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:56:41,315 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:56:41,315 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:56:41,316 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2019-01-13 21:56:41,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:56:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:56:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:56:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:56:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:56:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:56:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:56:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:56:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:56:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:56:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:56:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:56:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:56:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:56:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:56:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:56:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:56:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:56:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:56:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:56:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:56:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:56:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:56:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:56:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:56:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:56:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:56:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:56:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:56:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:56:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:56:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:56:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:56:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:56:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:56:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:56:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:56:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:56:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:56:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:56:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:56:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:56:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:56:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:56:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:56:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:56:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:56:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:56:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:56:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:56:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:56:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:56:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:56:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:56:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:56:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:56:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:56:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:56:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:56:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:56:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:56:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:56:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:56:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:56:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:56:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:56:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:56:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:56:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:56:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:56:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:56:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:56:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:56:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:56:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:56:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:56:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:56:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:56:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:56:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:56:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:56:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:56:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:56:41,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:56:41,330 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:56:41,330 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:56:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:56:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:56:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:56:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:56:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:56:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:56:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:56:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:56:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:56:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:56:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:56:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:56:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:56:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:56:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:56:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:56:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:56:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:56:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2019-01-13 21:56:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:56:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:56:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:56:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:56:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:56:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:56:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:56:42,060 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:56:42,061 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-13 21:56:42,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:42 BoogieIcfgContainer [2019-01-13 21:56:42,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:56:42,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:56:42,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:56:42,067 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:56:42,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:56:40" (1/3) ... [2019-01-13 21:56:42,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d61083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:42, skipping insertion in model container [2019-01-13 21:56:42,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:41" (2/3) ... [2019-01-13 21:56:42,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d61083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:42, skipping insertion in model container [2019-01-13 21:56:42,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:42" (3/3) ... [2019-01-13 21:56:42,070 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:42,080 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:56:42,088 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-13 21:56:42,103 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-13 21:56:42,128 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:56:42,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:56:42,129 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:56:42,129 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:56:42,129 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:56:42,129 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:56:42,129 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:56:42,130 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:56:42,130 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:56:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-01-13 21:56:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:42,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:42,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:42,155 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:42,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash 364110360, now seen corresponding path program 1 times [2019-01-13 21:56:42,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:42,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:42,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:42,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:42,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:42,355 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:42,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:42,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:42,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:42,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:42,376 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-01-13 21:56:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:42,561 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-13 21:56:42,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:42,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:56:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:42,576 INFO L225 Difference]: With dead ends: 49 [2019-01-13 21:56:42,577 INFO L226 Difference]: Without dead ends: 46 [2019-01-13 21:56:42,579 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:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-13 21:56:42,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-13 21:56:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 21:56:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-01-13 21:56:42,623 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 10 [2019-01-13 21:56:42,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:42,623 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-01-13 21:56:42,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-01-13 21:56:42,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:42,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:42,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:42,625 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:42,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:42,625 INFO L82 PathProgramCache]: Analyzing trace with hash 364110361, now seen corresponding path program 1 times [2019-01-13 21:56:42,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:42,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:42,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:42,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:42,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:42,802 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:42,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:42,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:42,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:42,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:42,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:42,805 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 4 states. [2019-01-13 21:56:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:42,842 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-01-13 21:56:42,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:42,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:56:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:42,844 INFO L225 Difference]: With dead ends: 45 [2019-01-13 21:56:42,844 INFO L226 Difference]: Without dead ends: 45 [2019-01-13 21:56:42,845 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:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-13 21:56:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-13 21:56:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 21:56:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-01-13 21:56:42,852 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2019-01-13 21:56:42,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:42,852 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-01-13 21:56:42,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-01-13 21:56:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:42,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:42,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:42,854 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:42,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:42,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1597480737, now seen corresponding path program 1 times [2019-01-13 21:56:42,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:42,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:42,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:42,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:42,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:42,940 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:42,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:42,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:42,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:42,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:42,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:42,942 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 3 states. [2019-01-13 21:56:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:42,984 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-01-13 21:56:42,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:42,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 21:56:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:42,986 INFO L225 Difference]: With dead ends: 44 [2019-01-13 21:56:42,986 INFO L226 Difference]: Without dead ends: 44 [2019-01-13 21:56:42,986 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:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-13 21:56:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-13 21:56:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:56:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-01-13 21:56:42,993 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 11 [2019-01-13 21:56:42,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:42,993 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-01-13 21:56:42,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-01-13 21:56:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:42,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:42,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:42,994 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1597480736, now seen corresponding path program 1 times [2019-01-13 21:56:42,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:42,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:42,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:42,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:42,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:43,099 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:43,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:43,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:43,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:43,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:43,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:43,101 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2019-01-13 21:56:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:43,135 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-01-13 21:56:43,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:43,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 21:56:43,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:43,137 INFO L225 Difference]: With dead ends: 43 [2019-01-13 21:56:43,137 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:56:43,139 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:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:56:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 21:56:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:56:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-13 21:56:43,151 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2019-01-13 21:56:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:43,152 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-13 21:56:43,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-01-13 21:56:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 21:56:43,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:43,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:43,158 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:43,158 INFO L82 PathProgramCache]: Analyzing trace with hash -373360435, now seen corresponding path program 1 times [2019-01-13 21:56:43,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:43,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:43,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:43,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:43,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:43,254 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:43,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:43,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:43,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:43,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:43,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:43,259 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 5 states. [2019-01-13 21:56:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:43,636 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-01-13 21:56:43,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:43,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-13 21:56:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:43,638 INFO L225 Difference]: With dead ends: 41 [2019-01-13 21:56:43,638 INFO L226 Difference]: Without dead ends: 41 [2019-01-13 21:56:43,638 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:43,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-13 21:56:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-13 21:56:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 21:56:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-01-13 21:56:43,644 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 16 [2019-01-13 21:56:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:43,644 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-01-13 21:56:43,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-01-13 21:56:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 21:56:43,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:43,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:43,646 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:43,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:43,646 INFO L82 PathProgramCache]: Analyzing trace with hash -373360434, now seen corresponding path program 1 times [2019-01-13 21:56:43,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:43,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:43,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:43,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:43,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:43,819 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:43,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:43,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:43,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:43,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:43,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:43,821 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 7 states. [2019-01-13 21:56:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:44,015 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-01-13 21:56:44,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:44,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-13 21:56:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:44,020 INFO L225 Difference]: With dead ends: 55 [2019-01-13 21:56:44,020 INFO L226 Difference]: Without dead ends: 55 [2019-01-13 21:56:44,021 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:44,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-13 21:56:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2019-01-13 21:56:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 21:56:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-01-13 21:56:44,028 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2019-01-13 21:56:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:44,028 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-01-13 21:56:44,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-01-13 21:56:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:44,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:44,029 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:44,029 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:44,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:44,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1977875214, now seen corresponding path program 1 times [2019-01-13 21:56:44,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:44,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:44,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:44,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:44,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:44,146 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:44,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:44,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:44,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:44,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:44,149 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 6 states. [2019-01-13 21:56:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:44,297 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-01-13 21:56:44,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:44,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-13 21:56:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:44,301 INFO L225 Difference]: With dead ends: 45 [2019-01-13 21:56:44,301 INFO L226 Difference]: Without dead ends: 45 [2019-01-13 21:56:44,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:44,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-13 21:56:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-13 21:56:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 21:56:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-01-13 21:56:44,306 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 18 [2019-01-13 21:56:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:44,306 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-01-13 21:56:44,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-01-13 21:56:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:44,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:44,307 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:44,308 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:44,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:44,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1977875215, now seen corresponding path program 1 times [2019-01-13 21:56:44,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:44,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:44,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:44,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:44,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:44,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:44,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:56:44,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:44,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:44,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:44,589 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 8 states. [2019-01-13 21:56:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:44,766 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-01-13 21:56:44,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:44,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-13 21:56:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:44,770 INFO L225 Difference]: With dead ends: 47 [2019-01-13 21:56:44,770 INFO L226 Difference]: Without dead ends: 47 [2019-01-13 21:56:44,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-13 21:56:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-01-13 21:56:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 21:56:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-01-13 21:56:44,775 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2019-01-13 21:56:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:44,775 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-01-13 21:56:44,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-01-13 21:56:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 21:56:44,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:44,776 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:44,777 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:44,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:44,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1184835937, now seen corresponding path program 1 times [2019-01-13 21:56:44,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:44,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:44,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:44,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:44,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:44,879 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:44,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:44,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:44,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:44,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:44,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:44,881 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 4 states. [2019-01-13 21:56:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:45,001 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-01-13 21:56:45,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:45,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-13 21:56:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:45,003 INFO L225 Difference]: With dead ends: 44 [2019-01-13 21:56:45,003 INFO L226 Difference]: Without dead ends: 38 [2019-01-13 21:56:45,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-13 21:56:45,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-13 21:56:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-13 21:56:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-01-13 21:56:45,008 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 19 [2019-01-13 21:56:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:45,008 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-01-13 21:56:45,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-01-13 21:56:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:45,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:45,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:45,010 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:45,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1932430609, now seen corresponding path program 1 times [2019-01-13 21:56:45,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:45,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:45,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:45,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:45,100 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:45,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:45,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:45,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:45,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:45,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:45,101 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2019-01-13 21:56:45,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:45,312 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-13 21:56:45,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:45,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-13 21:56:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:45,314 INFO L225 Difference]: With dead ends: 37 [2019-01-13 21:56:45,314 INFO L226 Difference]: Without dead ends: 37 [2019-01-13 21:56:45,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-13 21:56:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-13 21:56:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-13 21:56:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-01-13 21:56:45,318 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 20 [2019-01-13 21:56:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:45,318 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-01-13 21:56:45,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:45,319 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-01-13 21:56:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:45,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:45,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:45,320 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:45,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:45,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1932430608, now seen corresponding path program 1 times [2019-01-13 21:56:45,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:45,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:45,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:45,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:45,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:45,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:45,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:45,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:45,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:45,483 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 7 states. [2019-01-13 21:56:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:45,591 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-13 21:56:45,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:45,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-01-13 21:56:45,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:45,595 INFO L225 Difference]: With dead ends: 42 [2019-01-13 21:56:45,595 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:56:45,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:56:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-01-13 21:56:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-13 21:56:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-01-13 21:56:45,601 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2019-01-13 21:56:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:45,601 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-01-13 21:56:45,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-01-13 21:56:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 21:56:45,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:45,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:45,602 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:45,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1640219440, now seen corresponding path program 1 times [2019-01-13 21:56:45,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:45,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:45,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:45,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:45,667 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:45,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:45,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:45,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:45,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:45,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:45,668 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2019-01-13 21:56:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:45,876 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-13 21:56:45,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:45,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-13 21:56:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:45,878 INFO L225 Difference]: With dead ends: 37 [2019-01-13 21:56:45,878 INFO L226 Difference]: Without dead ends: 37 [2019-01-13 21:56:45,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:45,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-13 21:56:45,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-13 21:56:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-13 21:56:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-01-13 21:56:45,882 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2019-01-13 21:56:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:45,882 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-01-13 21:56:45,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-01-13 21:56:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 21:56:45,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:45,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:45,884 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:45,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:45,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1640219439, now seen corresponding path program 1 times [2019-01-13 21:56:45,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:45,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:45,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:46,082 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:46,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:46,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 21:56:46,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 21:56:46,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 21:56:46,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:46,083 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 10 states. [2019-01-13 21:56:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:46,293 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-01-13 21:56:46,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 21:56:46,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-01-13 21:56:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:46,295 INFO L225 Difference]: With dead ends: 45 [2019-01-13 21:56:46,296 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:56:46,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-13 21:56:46,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:56:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2019-01-13 21:56:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-13 21:56:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-01-13 21:56:46,301 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2019-01-13 21:56:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:46,301 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-01-13 21:56:46,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 21:56:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-01-13 21:56:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:56:46,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:46,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:46,302 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:46,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:46,303 INFO L82 PathProgramCache]: Analyzing trace with hash 268491889, now seen corresponding path program 1 times [2019-01-13 21:56:46,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:46,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:46,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:46,793 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2019-01-13 21:56:47,153 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2019-01-13 21:56:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:47,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:47,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 21:56:47,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 21:56:47,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 21:56:47,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:47,349 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2019-01-13 21:56:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:47,547 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-01-13 21:56:47,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 21:56:47,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-01-13 21:56:47,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:47,549 INFO L225 Difference]: With dead ends: 50 [2019-01-13 21:56:47,549 INFO L226 Difference]: Without dead ends: 36 [2019-01-13 21:56:47,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-13 21:56:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-13 21:56:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-13 21:56:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-13 21:56:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-13 21:56:47,552 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 24 [2019-01-13 21:56:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:47,552 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-13 21:56:47,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 21:56:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-13 21:56:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:56:47,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:47,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:47,554 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1725652817, now seen corresponding path program 1 times [2019-01-13 21:56:47,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:47,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:47,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:47,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:47,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:47,777 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 10 [2019-01-13 21:56:47,968 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-01-13 21:56:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:48,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:48,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 21:56:48,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 21:56:48,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 21:56:48,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:56:48,117 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2019-01-13 21:56:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:48,479 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-13 21:56:48,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 21:56:48,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-01-13 21:56:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:48,482 INFO L225 Difference]: With dead ends: 49 [2019-01-13 21:56:48,482 INFO L226 Difference]: Without dead ends: 36 [2019-01-13 21:56:48,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-01-13 21:56:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-13 21:56:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-13 21:56:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-13 21:56:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-13 21:56:48,485 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 24 [2019-01-13 21:56:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:48,485 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-13 21:56:48,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 21:56:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-13 21:56:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:56:48,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:48,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:48,487 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:48,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:48,487 INFO L82 PathProgramCache]: Analyzing trace with hash 980966577, now seen corresponding path program 1 times [2019-01-13 21:56:48,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:48,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:48,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:48,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:48,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:48,901 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-13 21:56:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:49,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:49,063 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:49,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:49,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:49,293 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:49,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-13 21:56:49,686 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 14 treesize of output 11 [2019-01-13 21:56:49,701 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:49,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,732 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:49,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-13 21:56:49,861 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 25 treesize of output 26 [2019-01-13 21:56:49,868 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:49,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:49,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-13 21:56:50,318 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 30 treesize of output 28 [2019-01-13 21:56:50,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:56:50,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:50,348 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 8 treesize of output 1 [2019-01-13 21:56:50,349 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:50,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:50,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:50,383 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2019-01-13 21:56:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:50,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:50,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-01-13 21:56:50,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 21:56:50,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 21:56:50,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-01-13 21:56:50,567 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 17 states. [2019-01-13 21:56:51,029 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 [2019-01-13 21:56:51,402 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-01-13 21:56:51,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:51,803 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-13 21:56:51,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:56:51,804 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-01-13 21:56:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:51,805 INFO L225 Difference]: With dead ends: 48 [2019-01-13 21:56:51,806 INFO L226 Difference]: Without dead ends: 48 [2019-01-13 21:56:51,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-01-13 21:56:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-13 21:56:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-01-13 21:56:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:56:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-01-13 21:56:51,810 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 24 [2019-01-13 21:56:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:51,810 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-01-13 21:56:51,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 21:56:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-01-13 21:56:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 21:56:51,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:51,811 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:51,812 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:51,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:51,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2111042098, now seen corresponding path program 1 times [2019-01-13 21:56:51,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:51,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:51,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:51,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:51,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:52,457 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:52,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:52,457 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:52,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:52,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:52,526 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:52,529 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:52,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:52,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:52,541 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:52,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-13 21:56:53,053 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:53,170 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:53,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:53,229 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:53,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,240 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:53,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,551 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 25 [2019-01-13 21:56:53,552 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:53,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:56:53,601 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:53,601 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2019-01-13 21:56:53,658 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:53,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:53,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-01-13 21:56:53,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 21:56:53,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 21:56:53,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-01-13 21:56:53,678 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 22 states. [2019-01-13 21:56:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:55,073 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-01-13 21:56:55,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 21:56:55,075 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-01-13 21:56:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:55,076 INFO L225 Difference]: With dead ends: 44 [2019-01-13 21:56:55,076 INFO L226 Difference]: Without dead ends: 44 [2019-01-13 21:56:55,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2019-01-13 21:56:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-13 21:56:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-13 21:56:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:56:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-13 21:56:55,081 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 26 [2019-01-13 21:56:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:55,081 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-13 21:56:55,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 21:56:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-13 21:56:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:55,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:55,082 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:55,082 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:55,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1486892371, now seen corresponding path program 1 times [2019-01-13 21:56:55,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:55,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:55,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:55,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:55,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:55,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:55,178 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:55,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:55,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:55,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:55,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-13 21:56:55,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:55,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:55,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:55,250 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 6 states. [2019-01-13 21:56:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:55,338 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-13 21:56:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:55,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-13 21:56:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:55,341 INFO L225 Difference]: With dead ends: 42 [2019-01-13 21:56:55,341 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:56:55,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:55,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:56:55,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-01-13 21:56:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:56:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-13 21:56:55,344 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 28 [2019-01-13 21:56:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:55,344 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-13 21:56:55,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-13 21:56:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 21:56:55,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:55,346 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:55,349 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1320818060, now seen corresponding path program 1 times [2019-01-13 21:56:55,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:55,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:55,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:55,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:55,620 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:55,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:55,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:55,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 21:56:55,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2019-01-13 21:56:55,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 21:56:55,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 21:56:55,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-13 21:56:55,848 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 13 states. [2019-01-13 21:56:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:56,108 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-13 21:56:56,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:56:56,109 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-01-13 21:56:56,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:56,110 INFO L225 Difference]: With dead ends: 39 [2019-01-13 21:56:56,111 INFO L226 Difference]: Without dead ends: 36 [2019-01-13 21:56:56,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-01-13 21:56:56,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-13 21:56:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-13 21:56:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-13 21:56:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-13 21:56:56,117 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-01-13 21:56:56,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:56,117 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-13 21:56:56,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 21:56:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-13 21:56:56,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 21:56:56,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:56,125 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:56,125 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:56:56,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:56,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2024428204, now seen corresponding path program 2 times [2019-01-13 21:56:56,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:56,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:56,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:56,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:56,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:56,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:56,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:56,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:56:56,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:56:56,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:56:56,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:56,623 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:56,628 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:56,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,653 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:56,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,661 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:56:56,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:56:56,694 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:56,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,709 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:56,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-13 21:56:56,759 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 29 treesize of output 30 [2019-01-13 21:56:56,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:56:56,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:56,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2019-01-13 21:56:57,198 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 34 treesize of output 32 [2019-01-13 21:56:57,201 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:57,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:57,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-13 21:56:57,222 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:57,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:57,246 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:57,247 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2019-01-13 21:56:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:57,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:57,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2019-01-13 21:56:57,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-13 21:56:57,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-13 21:56:57,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-01-13 21:56:57,389 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 23 states. [2019-01-13 21:56:57,972 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-01-13 21:56:58,833 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-01-13 21:57:01,299 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-01-13 21:57:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:01,646 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-13 21:57:01,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 21:57:01,647 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2019-01-13 21:57:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:01,648 INFO L225 Difference]: With dead ends: 38 [2019-01-13 21:57:01,648 INFO L226 Difference]: Without dead ends: 38 [2019-01-13 21:57:01,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2019-01-13 21:57:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-13 21:57:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-01-13 21:57:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-13 21:57:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-13 21:57:01,651 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-01-13 21:57:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:01,651 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-13 21:57:01,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-13 21:57:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-13 21:57:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 21:57:01,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:01,652 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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:57:01,653 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION]=== [2019-01-13 21:57:01,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:01,653 INFO L82 PathProgramCache]: Analyzing trace with hash 144680469, now seen corresponding path program 2 times [2019-01-13 21:57:01,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:01,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:01,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:01,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:57:01,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:02,152 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-13 21:57:02,529 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-01-13 21:57:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:03,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:03,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:03,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:57:03,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:57:03,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:57:03,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:03,312 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:57:03,346 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:57:03,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:03,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:03,375 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:57:03,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-13 21:57:03,402 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:57:03,404 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:57:03,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:03,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:03,411 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:57:03,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-01-13 21:57:03,939 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 33 treesize of output 33 [2019-01-13 21:57:03,959 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 25 treesize of output 29 [2019-01-13 21:57:03,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:03,994 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 29 treesize of output 22 [2019-01-13 21:57:03,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:04,021 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 22 treesize of output 20 [2019-01-13 21:57:04,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:04,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:57:04,068 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:57:04,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2019-01-13 21:57:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:04,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:04,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2019-01-13 21:57:04,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-13 21:57:04,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-13 21:57:04,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2019-01-13 21:57:04,161 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-01-13 21:57:04,850 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-01-13 21:57:05,562 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-01-13 21:57:05,857 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-01-13 21:57:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:06,531 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-13 21:57:06,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 21:57:06,532 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-01-13 21:57:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:06,533 INFO L225 Difference]: With dead ends: 37 [2019-01-13 21:57:06,533 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:57:06,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=246, Invalid=1824, Unknown=0, NotChecked=0, Total=2070 [2019-01-13 21:57:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:57:06,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:57:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:57:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:57:06,535 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2019-01-13 21:57:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:06,535 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:57:06,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-13 21:57:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:57:06,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:57:06,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:57:06 BoogieIcfgContainer [2019-01-13 21:57:06,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:57:06,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:57:06,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:57:06,541 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:57:06,541 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:42" (3/4) ... [2019-01-13 21:57:06,544 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:57:06,550 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:57:06,550 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:57:06,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:57:06,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:57:06,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncmp [2019-01-13 21:57:06,556 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-01-13 21:57:06,557 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-13 21:57:06,557 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 21:57:06,623 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:57:06,624 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:57:06,625 INFO L168 Benchmark]: Toolchain (without parser) took 26036.11 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.3 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -249.6 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:06,625 INFO L168 Benchmark]: CDTParser took 0.17 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:57:06,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.55 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:06,626 INFO L168 Benchmark]: Boogie Preprocessor took 133.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -197.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:06,627 INFO L168 Benchmark]: RCFGBuilder took 806.60 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.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:06,627 INFO L168 Benchmark]: TraceAbstraction took 24476.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -129.8 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:06,630 INFO L168 Benchmark]: Witness Printer took 83.08 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:06,634 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.17 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 531.55 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -197.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 806.60 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.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24476.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -129.8 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * Witness Printer took 83.08 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 56 locations, 15 error locations. SAFE Result, 24.4s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 592 SDtfs, 821 SDslu, 2143 SDs, 0 SdLazy, 2042 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, 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.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 30 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 582 ConstructedInterpolants, 54 QuantifiedInterpolants, 154482 SizeOfPredicates, 56 NumberOfNonLiveVariables, 999 ConjunctsInSsa, 183 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 25/76 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...