./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e 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_cstrlcpy-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 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:43:56,594 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:43:56,596 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:43:56,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:43:56,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:43:56,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:43:56,614 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:43:56,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:43:56,617 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:43:56,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:43:56,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:43:56,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:43:56,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:43:56,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:43:56,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:43:56,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:43:56,625 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:43:56,627 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:43:56,629 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:43:56,631 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:43:56,632 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:43:56,633 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:43:56,636 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:43:56,636 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:43:56,637 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:43:56,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:43:56,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:43:56,640 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:43:56,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:43:56,642 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:43:56,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:43:56,643 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:43:56,643 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:43:56,643 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:43:56,645 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:43:56,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:43:56,646 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:43:56,673 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:43:56,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:43:56,675 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:43:56,678 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:43:56,679 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:43:56,680 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:43:56,680 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:43:56,681 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:43:56,681 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:43:56,681 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:43:56,681 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:43:56,681 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:43:56,683 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:43:56,683 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:43:56,683 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:43:56,683 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:43:56,683 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:43:56,683 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:43:56,684 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:43:56,684 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:43:56,684 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:43:56,684 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:43:56,684 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:43:56,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:43:56,688 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:43:56,688 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:43:56,688 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:43:56,688 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:43:56,688 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 -> 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c [2018-11-28 22:43:56,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:43:56,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:43:56,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:43:56,781 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:43:56,782 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:43:56,782 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:56,842 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15957489/1687d223b4b942ba88ad2844946b5bae/FLAG91689a3dc [2018-11-28 22:43:57,341 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:43:57,342 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:57,363 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15957489/1687d223b4b942ba88ad2844946b5bae/FLAG91689a3dc [2018-11-28 22:43:57,625 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15957489/1687d223b4b942ba88ad2844946b5bae [2018-11-28 22:43:57,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:43:57,633 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:43:57,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:57,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:43:57,638 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:43:57,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:57" (1/1) ... [2018-11-28 22:43:57,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620e9de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:57, skipping insertion in model container [2018-11-28 22:43:57,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:57" (1/1) ... [2018-11-28 22:43:57,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:43:57,717 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:43:58,108 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:58,125 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:43:58,177 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:58,319 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:43:58,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:58 WrapperNode [2018-11-28 22:43:58,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:58,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:43:58,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:43:58,322 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:43:58,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:58" (1/1) ... [2018-11-28 22:43:58,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:58" (1/1) ... [2018-11-28 22:43:58,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:58" (1/1) ... [2018-11-28 22:43:58,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:58" (1/1) ... [2018-11-28 22:43:58,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:58" (1/1) ... [2018-11-28 22:43:58,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:58" (1/1) ... [2018-11-28 22:43:58,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:58" (1/1) ... [2018-11-28 22:43:58,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:43:58,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:43:58,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:43:58,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:43:58,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:58" (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 [2018-11-28 22:43:58,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:43:58,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:43:58,475 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 22:43:58,475 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 22:43:58,475 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-11-28 22:43:58,476 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:43:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 22:43:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 22:43:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:43:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:43:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:43:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:43:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:43:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:43:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:43:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:43:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:43:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:43:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:43:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:43:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:43:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:43:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:43:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:43:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:43:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:43:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:43:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:43:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:43:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:43:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:43:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:43:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:43:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:43:58,487 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:43:58,488 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:43:58,488 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:43:58,488 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:43:58,488 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:43:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:43:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:43:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:43:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:43:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:43:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:43:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:43:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:43:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:43:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:43:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:43:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:43:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:43:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:43:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:43:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:43:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:43:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:43:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:43:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:43:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:43:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:43:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:43:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:43:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:43:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:43:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:43:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:43:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:43:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:43:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:43:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:43:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:43:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:43:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:43:58,497 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:43:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:43:58,500 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:43:58,500 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:43:58,500 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:43:58,501 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:43:58,501 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:43:58,501 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:43:58,501 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:43:58,501 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:43:58,501 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:43:58,502 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:43:58,502 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:43:58,502 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:43:58,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:43:58,502 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:43:58,502 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:43:58,502 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:43:58,502 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:43:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:43:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:43:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:43:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:43:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:43:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:43:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:43:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:43:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:43:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:43:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:43:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:43:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:43:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:43:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:43:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:43:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-11-28 22:43:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:43:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:43:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:43:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:43:58,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:43:58,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:43:58,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:43:59,185 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:43:59,186 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 22:43:59,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:59 BoogieIcfgContainer [2018-11-28 22:43:59,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:43:59,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:43:59,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:43:59,191 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:43:59,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:43:57" (1/3) ... [2018-11-28 22:43:59,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1829b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:59, skipping insertion in model container [2018-11-28 22:43:59,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:58" (2/3) ... [2018-11-28 22:43:59,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1829b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:59, skipping insertion in model container [2018-11-28 22:43:59,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:59" (3/3) ... [2018-11-28 22:43:59,196 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:59,207 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:43:59,216 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-28 22:43:59,235 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-28 22:43:59,264 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:43:59,265 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:43:59,265 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:43:59,265 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:43:59,266 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:43:59,266 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:43:59,266 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:43:59,266 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:43:59,266 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:43:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-28 22:43:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:59,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:59,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:59,300 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:43:59,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:59,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1443993176, now seen corresponding path program 1 times [2018-11-28 22:43:59,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:59,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:59,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:59,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:59,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:59,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:59,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:59,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:59,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:59,580 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-11-28 22:43:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:59,761 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-28 22:43:59,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:59,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:43:59,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:59,776 INFO L225 Difference]: With dead ends: 45 [2018-11-28 22:43:59,777 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 22:43:59,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 22:43:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 22:43:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 22:43:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-28 22:43:59,827 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 10 [2018-11-28 22:43:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:59,827 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-28 22:43:59,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-28 22:43:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:59,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:59,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:59,829 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:43:59,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:59,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1443993175, now seen corresponding path program 1 times [2018-11-28 22:43:59,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:59,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:59,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:00,070 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-11-28 22:44:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:00,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:00,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:00,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:00,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:00,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:00,075 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 4 states. [2018-11-28 22:44:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:00,133 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-28 22:44:00,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:00,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:44:00,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:00,135 INFO L225 Difference]: With dead ends: 41 [2018-11-28 22:44:00,136 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 22:44:00,137 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 [2018-11-28 22:44:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 22:44:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 22:44:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:44:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-28 22:44:00,145 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 10 [2018-11-28 22:44:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:00,145 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-28 22:44:00,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-28 22:44:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:44:00,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:00,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:00,147 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:00,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:00,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1814115442, now seen corresponding path program 1 times [2018-11-28 22:44:00,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:00,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:00,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:00,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:00,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:00,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:44:00,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:44:00,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:44:00,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:00,241 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 3 states. [2018-11-28 22:44:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:00,412 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-28 22:44:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:44:00,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 22:44:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:00,415 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:44:00,415 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 22:44:00,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 22:44:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 22:44:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:44:00,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-11-28 22:44:00,423 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 11 [2018-11-28 22:44:00,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:00,423 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-28 22:44:00,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:44:00,423 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-28 22:44:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:44:00,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:00,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:00,425 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:00,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1814115441, now seen corresponding path program 1 times [2018-11-28 22:44:00,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:00,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:00,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:00,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:00,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:00,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:00,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:00,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:00,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:00,602 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 4 states. [2018-11-28 22:44:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:00,627 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-28 22:44:00,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:00,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 22:44:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:00,630 INFO L225 Difference]: With dead ends: 39 [2018-11-28 22:44:00,630 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 22:44:00,631 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 [2018-11-28 22:44:00,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 22:44:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 22:44:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:44:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-28 22:44:00,637 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 11 [2018-11-28 22:44:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:00,637 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-28 22:44:00,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-28 22:44:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:44:00,639 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:00,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:00,640 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:00,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:00,640 INFO L82 PathProgramCache]: Analyzing trace with hash 219743670, now seen corresponding path program 1 times [2018-11-28 22:44:00,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:00,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:00,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:00,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:00,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:00,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:44:00,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:44:00,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:44:00,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:00,843 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 6 states. [2018-11-28 22:44:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:01,325 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-28 22:44:01,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:01,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-28 22:44:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:01,328 INFO L225 Difference]: With dead ends: 38 [2018-11-28 22:44:01,328 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 22:44:01,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 22:44:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-28 22:44:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 22:44:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-28 22:44:01,335 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2018-11-28 22:44:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:01,335 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-28 22:44:01,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:44:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-28 22:44:01,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:44:01,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:01,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:01,338 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:01,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash 219743671, now seen corresponding path program 1 times [2018-11-28 22:44:01,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:01,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:01,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:01,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:01,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:01,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:44:01,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:44:01,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:44:01,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:01,520 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 8 states. [2018-11-28 22:44:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:01,813 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-28 22:44:01,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:44:01,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-28 22:44:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:01,820 INFO L225 Difference]: With dead ends: 54 [2018-11-28 22:44:01,820 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 22:44:01,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:44:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 22:44:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2018-11-28 22:44:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:44:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-28 22:44:01,828 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 17 [2018-11-28 22:44:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:01,829 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-28 22:44:01,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:44:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-28 22:44:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:44:01,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:01,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:01,831 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:01,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash 220542997, now seen corresponding path program 1 times [2018-11-28 22:44:01,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:01,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:01,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:01,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:01,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:01,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:44:01,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:44:01,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:44:01,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:44:01,926 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2018-11-28 22:44:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:02,009 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-28 22:44:02,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:44:02,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-28 22:44:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:02,013 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:44:02,013 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 22:44:02,013 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 [2018-11-28 22:44:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 22:44:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 22:44:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:44:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-28 22:44:02,018 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2018-11-28 22:44:02,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:02,019 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-28 22:44:02,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:44:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-28 22:44:02,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:44:02,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:02,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:02,020 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:02,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:02,021 INFO L82 PathProgramCache]: Analyzing trace with hash 220542998, now seen corresponding path program 1 times [2018-11-28 22:44:02,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:02,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:02,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:02,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:02,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:02,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:02,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:44:02,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:44:02,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:44:02,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:44:02,301 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2018-11-28 22:44:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:02,387 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-11-28 22:44:02,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:44:02,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-28 22:44:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:02,389 INFO L225 Difference]: With dead ends: 72 [2018-11-28 22:44:02,389 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 22:44:02,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 22:44:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-11-28 22:44:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 22:44:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2018-11-28 22:44:02,396 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 17 [2018-11-28 22:44:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:02,397 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2018-11-28 22:44:02,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:44:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2018-11-28 22:44:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:44:02,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:02,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:02,398 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:02,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash -172484012, now seen corresponding path program 1 times [2018-11-28 22:44:02,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:02,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:02,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:02,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:02,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:44:02,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:44:02,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:44:02,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:44:02,573 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand 7 states. [2018-11-28 22:44:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:02,880 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2018-11-28 22:44:02,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:02,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-28 22:44:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:02,882 INFO L225 Difference]: With dead ends: 83 [2018-11-28 22:44:02,882 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 22:44:02,883 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 [2018-11-28 22:44:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 22:44:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2018-11-28 22:44:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 22:44:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2018-11-28 22:44:02,896 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 17 [2018-11-28 22:44:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:02,896 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2018-11-28 22:44:02,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:44:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2018-11-28 22:44:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:44:02,897 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:02,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:02,898 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:02,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:02,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1777880833, now seen corresponding path program 1 times [2018-11-28 22:44:02,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:02,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:02,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:02,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:02,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:03,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:03,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:44:03,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:44:03,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:44:03,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:03,018 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand 6 states. [2018-11-28 22:44:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:03,112 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2018-11-28 22:44:03,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:03,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-28 22:44:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:03,115 INFO L225 Difference]: With dead ends: 68 [2018-11-28 22:44:03,115 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 22:44:03,116 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 [2018-11-28 22:44:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 22:44:03,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-28 22:44:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 22:44:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2018-11-28 22:44:03,123 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 18 [2018-11-28 22:44:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:03,123 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2018-11-28 22:44:03,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:44:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2018-11-28 22:44:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:44:03,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:03,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:03,125 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:03,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:03,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1777880832, now seen corresponding path program 1 times [2018-11-28 22:44:03,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:03,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:03,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:03,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:03,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:03,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:03,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:44:03,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:44:03,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:44:03,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:03,282 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand 8 states. [2018-11-28 22:44:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:03,460 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2018-11-28 22:44:03,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:44:03,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 22:44:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:03,462 INFO L225 Difference]: With dead ends: 86 [2018-11-28 22:44:03,463 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 22:44:03,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:44:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 22:44:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2018-11-28 22:44:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 22:44:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2018-11-28 22:44:03,474 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 18 [2018-11-28 22:44:03,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:03,474 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2018-11-28 22:44:03,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:44:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2018-11-28 22:44:03,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:44:03,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:03,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:03,477 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:03,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1052032004, now seen corresponding path program 1 times [2018-11-28 22:44:03,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:03,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:03,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:03,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:03,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:03,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:03,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:44:03,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:44:03,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:44:03,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:03,624 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand 6 states. [2018-11-28 22:44:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:03,700 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2018-11-28 22:44:03,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:03,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-28 22:44:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:03,702 INFO L225 Difference]: With dead ends: 69 [2018-11-28 22:44:03,702 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 22:44:03,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 22:44:03,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-28 22:44:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 22:44:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2018-11-28 22:44:03,707 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 18 [2018-11-28 22:44:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:03,708 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2018-11-28 22:44:03,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:44:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2018-11-28 22:44:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:44:03,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:03,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:03,709 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:03,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:03,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1052032003, now seen corresponding path program 1 times [2018-11-28 22:44:03,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:03,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:03,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:03,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:03,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:03,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:03,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:44:03,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:44:03,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:44:03,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:03,972 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 8 states. [2018-11-28 22:44:04,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:04,185 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2018-11-28 22:44:04,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:44:04,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 22:44:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:04,187 INFO L225 Difference]: With dead ends: 81 [2018-11-28 22:44:04,187 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 22:44:04,187 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 [2018-11-28 22:44:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 22:44:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-11-28 22:44:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 22:44:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2018-11-28 22:44:04,193 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 18 [2018-11-28 22:44:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:04,193 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2018-11-28 22:44:04,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:44:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2018-11-28 22:44:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 22:44:04,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:04,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:04,195 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:04,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:04,196 INFO L82 PathProgramCache]: Analyzing trace with hash -922088297, now seen corresponding path program 1 times [2018-11-28 22:44:04,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:04,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:04,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:04,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:04,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:44:04,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:44:04,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:04,257 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand 3 states. [2018-11-28 22:44:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:04,277 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-28 22:44:04,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:44:04,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 22:44:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:04,279 INFO L225 Difference]: With dead ends: 80 [2018-11-28 22:44:04,279 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 22:44:04,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:44:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 22:44:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-11-28 22:44:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 22:44:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2018-11-28 22:44:04,288 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 20 [2018-11-28 22:44:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:04,290 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2018-11-28 22:44:04,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:44:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2018-11-28 22:44:04,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:44:04,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:04,291 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:04,297 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:04,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:04,298 INFO L82 PathProgramCache]: Analyzing trace with hash -709046688, now seen corresponding path program 1 times [2018-11-28 22:44:04,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:04,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 22:44:04,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:04,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:44:04,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:44:04,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:44:04,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:04,409 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 6 states. [2018-11-28 22:44:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:04,511 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2018-11-28 22:44:04,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:04,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 22:44:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:04,512 INFO L225 Difference]: With dead ends: 73 [2018-11-28 22:44:04,513 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 22:44:04,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:44:04,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 22:44:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-11-28 22:44:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 22:44:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-28 22:44:04,517 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-11-28 22:44:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:04,518 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-28 22:44:04,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:44:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-28 22:44:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:44:04,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:04,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:04,519 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:04,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash -567068546, now seen corresponding path program 1 times [2018-11-28 22:44:04,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:04,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:04,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:04,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:04,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:04,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:04,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:04,673 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 4 states. [2018-11-28 22:44:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:04,769 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-28 22:44:04,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:04,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-28 22:44:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:04,771 INFO L225 Difference]: With dead ends: 43 [2018-11-28 22:44:04,771 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 22:44:04,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:04,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 22:44:04,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-28 22:44:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 22:44:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-28 22:44:04,774 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 22 [2018-11-28 22:44:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:04,776 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-28 22:44:04,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-28 22:44:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:44:04,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:04,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:04,778 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:04,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:04,778 INFO L82 PathProgramCache]: Analyzing trace with hash -122260724, now seen corresponding path program 1 times [2018-11-28 22:44:04,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:04,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:04,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:04,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:05,268 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-28 22:44:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:05,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:05,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:44:05,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:44:05,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:44:05,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:44:05,431 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-11-28 22:44:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:05,540 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-28 22:44:05,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:44:05,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-28 22:44:05,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:05,542 INFO L225 Difference]: With dead ends: 55 [2018-11-28 22:44:05,542 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 22:44:05,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:44:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 22:44:05,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-11-28 22:44:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 22:44:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-28 22:44:05,545 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2018-11-28 22:44:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:05,546 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-28 22:44:05,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:44:05,546 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-28 22:44:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:44:05,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:05,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:05,547 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:05,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:05,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1402124402, now seen corresponding path program 1 times [2018-11-28 22:44:05,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:05,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:05,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:05,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:05,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:06,000 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 22:44:06,310 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 22:44:06,623 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-11-28 22:44:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:06,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:06,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:44:06,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:44:06,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:44:06,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:06,655 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 8 states. [2018-11-28 22:44:06,957 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-11-28 22:44:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:07,052 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-28 22:44:07,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:44:07,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-28 22:44:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:07,054 INFO L225 Difference]: With dead ends: 56 [2018-11-28 22:44:07,054 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 22:44:07,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:44:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 22:44:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-11-28 22:44:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 22:44:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-11-28 22:44:07,057 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-11-28 22:44:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:07,057 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-11-28 22:44:07,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:44:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-28 22:44:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:44:07,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:07,059 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:07,059 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:07,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:07,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1402089581, now seen corresponding path program 1 times [2018-11-28 22:44:07,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:07,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:07,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:07,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:07,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:07,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:07,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:44:07,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:44:07,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:44:07,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:44:07,339 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-11-28 22:44:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:07,517 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-28 22:44:07,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:44:07,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-28 22:44:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:07,519 INFO L225 Difference]: With dead ends: 84 [2018-11-28 22:44:07,519 INFO L226 Difference]: Without dead ends: 84 [2018-11-28 22:44:07,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:44:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-28 22:44:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2018-11-28 22:44:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 22:44:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-11-28 22:44:07,524 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 22 [2018-11-28 22:44:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:07,524 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-11-28 22:44:07,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:44:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-11-28 22:44:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:44:07,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:07,525 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:07,525 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:07,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:07,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1871809361, now seen corresponding path program 1 times [2018-11-28 22:44:07,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:07,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:07,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:07,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:07,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:07,909 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-11-28 22:44:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:08,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:08,108 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 [2018-11-28 22:44:08,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:08,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:08,242 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 [2018-11-28 22:44:08,271 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 [2018-11-28 22:44:08,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:08,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:08,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:08,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 22:44:08,347 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 15 treesize of output 12 [2018-11-28 22:44:08,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 22:44:08,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:08,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:08,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:08,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-28 22:44:08,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-28 22:44:08,756 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 17 treesize of output 14 [2018-11-28 22:44:08,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:08,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:08,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:08,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-11-28 22:44:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:08,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:08,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-11-28 22:44:08,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 22:44:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 22:44:08,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:44:08,865 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 17 states. [2018-11-28 22:44:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:09,785 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2018-11-28 22:44:09,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:44:09,787 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-11-28 22:44:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:09,788 INFO L225 Difference]: With dead ends: 76 [2018-11-28 22:44:09,788 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 22:44:09,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-11-28 22:44:09,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 22:44:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-11-28 22:44:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 22:44:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-11-28 22:44:09,791 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 22 [2018-11-28 22:44:09,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:09,792 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2018-11-28 22:44:09,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 22:44:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2018-11-28 22:44:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:44:09,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:09,798 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:09,798 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:09,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1706631001, now seen corresponding path program 1 times [2018-11-28 22:44:09,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:09,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:09,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:09,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:09,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 22:44:09,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:09,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:44:09,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:44:09,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:44:09,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:44:09,987 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 5 states. [2018-11-28 22:44:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:09,998 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-28 22:44:09,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:44:09,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-28 22:44:10,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:10,001 INFO L225 Difference]: With dead ends: 65 [2018-11-28 22:44:10,001 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 22:44:10,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:44:10,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 22:44:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-28 22:44:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 22:44:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-11-28 22:44:10,008 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 23 [2018-11-28 22:44:10,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:10,009 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-11-28 22:44:10,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:44:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-28 22:44:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:44:10,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:10,010 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] [2018-11-28 22:44:10,010 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:10,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:10,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2103451994, now seen corresponding path program 1 times [2018-11-28 22:44:10,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:10,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:10,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:10,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:10,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:10,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:10,311 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 [2018-11-28 22:44:10,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:10,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:10,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:44:10,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:10,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:10,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:10,433 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:10,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:10,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:10,507 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-11-28 22:44:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:10,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:10,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-11-28 22:44:10,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 22:44:10,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 22:44:10,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:44:10,750 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 17 states. [2018-11-28 22:44:12,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:12,031 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-28 22:44:12,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:44:12,035 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-28 22:44:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:12,036 INFO L225 Difference]: With dead ends: 71 [2018-11-28 22:44:12,036 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 22:44:12,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-11-28 22:44:12,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 22:44:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2018-11-28 22:44:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 22:44:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-11-28 22:44:12,039 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 23 [2018-11-28 22:44:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:12,040 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-11-28 22:44:12,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 22:44:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-28 22:44:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:44:12,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:12,041 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:12,041 INFO L423 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:12,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:12,041 INFO L82 PathProgramCache]: Analyzing trace with hash 964615599, now seen corresponding path program 1 times [2018-11-28 22:44:12,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:12,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:12,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:12,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:12,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:12,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:12,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:44:12,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:44:12,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:44:12,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:44:12,369 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 10 states. [2018-11-28 22:44:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:12,484 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-28 22:44:12,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:44:12,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-28 22:44:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:12,486 INFO L225 Difference]: With dead ends: 80 [2018-11-28 22:44:12,486 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 22:44:12,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-28 22:44:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 22:44:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-28 22:44:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 22:44:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-11-28 22:44:12,490 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 24 [2018-11-28 22:44:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:12,490 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-11-28 22:44:12,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:44:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-28 22:44:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:44:12,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:12,491 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] [2018-11-28 22:44:12,491 INFO L423 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:12,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:12,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1178180239, now seen corresponding path program 1 times [2018-11-28 22:44:12,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:12,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:12,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:12,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:12,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:12,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:12,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:44:12,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:44:12,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:44:12,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:44:12,712 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 10 states. [2018-11-28 22:44:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:13,056 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-11-28 22:44:13,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:44:13,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-28 22:44:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:13,059 INFO L225 Difference]: With dead ends: 73 [2018-11-28 22:44:13,059 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 22:44:13,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:44:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 22:44:13,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-28 22:44:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 22:44:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-11-28 22:44:13,063 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 24 [2018-11-28 22:44:13,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:13,063 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-28 22:44:13,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:44:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-28 22:44:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:44:13,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:13,064 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:13,064 INFO L423 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:13,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:13,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1029529107, now seen corresponding path program 1 times [2018-11-28 22:44:13,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:13,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:13,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:13,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:13,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:13,607 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-11-28 22:44:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:13,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:13,737 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 [2018-11-28 22:44:13,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:13,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:13,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:13,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:13,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:13,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:13,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:44:13,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:13,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:13,849 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2018-11-28 22:44:13,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 22:44:13,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-28 22:44:13,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:13,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:13,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:13,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 22:44:14,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-28 22:44:14,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:44:14,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:14,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:14,431 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. [2018-11-28 22:44:14,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-11-28 22:44:14,587 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 29 treesize of output 27 [2018-11-28 22:44:14,591 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 5 treesize of output 1 [2018-11-28 22:44:14,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:14,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 22:44:14,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:14,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:14,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:14,633 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:46 [2018-11-28 22:44:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:14,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:14,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-28 22:44:14,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 22:44:14,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 22:44:14,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-28 22:44:14,870 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 21 states. [2018-11-28 22:44:15,205 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2018-11-28 22:44:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:15,870 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-28 22:44:15,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:44:15,871 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-11-28 22:44:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:15,872 INFO L225 Difference]: With dead ends: 62 [2018-11-28 22:44:15,872 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 22:44:15,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2018-11-28 22:44:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 22:44:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2018-11-28 22:44:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 22:44:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-28 22:44:15,876 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 24 [2018-11-28 22:44:15,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:15,876 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-28 22:44:15,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 22:44:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-28 22:44:15,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 22:44:15,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:15,877 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:15,877 INFO L423 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:15,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:15,877 INFO L82 PathProgramCache]: Analyzing trace with hash -404670552, now seen corresponding path program 1 times [2018-11-28 22:44:15,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:15,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:15,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:15,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:15,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:16,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:16,119 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 [2018-11-28 22:44:16,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:16,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:16,167 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 [2018-11-28 22:44:16,293 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 [2018-11-28 22:44:16,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:16,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:16,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:16,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 22:44:16,344 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 15 treesize of output 12 [2018-11-28 22:44:16,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 22:44:16,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:16,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:16,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:16,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-28 22:44:16,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-28 22:44:16,434 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 17 treesize of output 14 [2018-11-28 22:44:16,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:16,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:16,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:16,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-11-28 22:44:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:16,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:16,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-11-28 22:44:16,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 22:44:16,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 22:44:16,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:44:16,519 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 17 states. [2018-11-28 22:44:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:17,085 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-28 22:44:17,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:44:17,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-11-28 22:44:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:17,088 INFO L225 Difference]: With dead ends: 64 [2018-11-28 22:44:17,088 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 22:44:17,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-11-28 22:44:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 22:44:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-11-28 22:44:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 22:44:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-28 22:44:17,092 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 26 [2018-11-28 22:44:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:17,093 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-28 22:44:17,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 22:44:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-28 22:44:17,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:44:17,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:17,094 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:17,094 INFO L423 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:17,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:17,097 INFO L82 PathProgramCache]: Analyzing trace with hash -340170128, now seen corresponding path program 2 times [2018-11-28 22:44:17,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:17,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:17,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:17,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:17,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:17,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:17,477 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 [2018-11-28 22:44:17,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:44:17,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:44:17,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:17,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:17,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:17,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:17,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:17,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:17,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:44:17,569 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:17,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:17,581 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 22:44:17,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 22:44:17,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 22:44:17,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:17,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:17,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:17,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 22:44:17,709 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 23 treesize of output 24 [2018-11-28 22:44:17,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:44:17,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:17,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:17,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:17,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-11-28 22:44:17,932 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 28 treesize of output 26 [2018-11-28 22:44:17,935 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 5 treesize of output 1 [2018-11-28 22:44:17,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:17,952 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 17 treesize of output 14 [2018-11-28 22:44:17,952 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:17,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:17,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:17,971 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-11-28 22:44:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:18,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:18,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 22:44:18,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 22:44:18,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 22:44:18,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-11-28 22:44:18,045 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 22 states. [2018-11-28 22:44:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:19,114 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-28 22:44:19,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:44:19,116 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-11-28 22:44:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:19,116 INFO L225 Difference]: With dead ends: 63 [2018-11-28 22:44:19,117 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 22:44:19,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 22:44:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 22:44:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 22:44:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 22:44:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-28 22:44:19,120 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 27 [2018-11-28 22:44:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:19,121 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-28 22:44:19,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 22:44:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-28 22:44:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:44:19,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:19,122 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] [2018-11-28 22:44:19,122 INFO L423 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:19,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:19,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1553161650, now seen corresponding path program 1 times [2018-11-28 22:44:19,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:19,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:19,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:19,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:44:19,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:19,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:19,436 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 [2018-11-28 22:44:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:19,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 22:44:19,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:44:19,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2018-11-28 22:44:19,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 22:44:19,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 22:44:19,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:44:19,609 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 13 states. [2018-11-28 22:44:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:20,293 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-28 22:44:20,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 22:44:20,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-28 22:44:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:20,296 INFO L225 Difference]: With dead ends: 55 [2018-11-28 22:44:20,296 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 22:44:20,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2018-11-28 22:44:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 22:44:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-11-28 22:44:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 22:44:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-28 22:44:20,299 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 27 [2018-11-28 22:44:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:20,300 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-28 22:44:20,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 22:44:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-28 22:44:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:44:20,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:20,300 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:20,301 INFO L423 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:20,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:20,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1553196471, now seen corresponding path program 2 times [2018-11-28 22:44:20,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:20,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:20,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:20,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:20,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:20,740 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-11-28 22:44:21,012 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-11-28 22:44:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:21,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:21,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:21,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:44:21,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:44:21,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:21,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:21,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:44:21,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:21,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:21,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:21,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:21,418 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:21,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:21,425 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 22:44:21,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 22:44:21,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 22:44:21,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:21,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:21,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:21,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 22:44:21,740 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 23 treesize of output 24 [2018-11-28 22:44:21,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:44:21,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:21,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:21,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:21,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-11-28 22:44:21,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-28 22:44:21,842 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 17 treesize of output 14 [2018-11-28 22:44:21,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:21,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:21,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:21,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-11-28 22:44:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:21,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:21,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 22:44:21,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 22:44:21,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 22:44:21,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-11-28 22:44:21,930 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 22 states. [2018-11-28 22:44:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:23,063 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-28 22:44:23,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:44:23,065 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-11-28 22:44:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:23,066 INFO L225 Difference]: With dead ends: 49 [2018-11-28 22:44:23,066 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 22:44:23,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 22:44:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 22:44:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-28 22:44:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 22:44:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-11-28 22:44:23,069 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 27 [2018-11-28 22:44:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:23,069 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-28 22:44:23,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 22:44:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-11-28 22:44:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:44:23,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:23,070 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:23,070 INFO L423 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:23,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash 904450304, now seen corresponding path program 2 times [2018-11-28 22:44:23,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:23,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:23,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:23,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:44:23,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:23,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:23,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:23,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:44:23,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:44:23,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:23,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:23,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:23,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:23,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:23,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:23,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:44:23,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:23,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:23,401 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-11-28 22:44:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:23,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:23,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-11-28 22:44:23,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 22:44:23,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 22:44:23,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-28 22:44:23,701 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 18 states. [2018-11-28 22:44:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:24,279 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-28 22:44:24,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:44:24,288 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-11-28 22:44:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:24,289 INFO L225 Difference]: With dead ends: 55 [2018-11-28 22:44:24,289 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 22:44:24,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-11-28 22:44:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 22:44:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-11-28 22:44:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 22:44:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-28 22:44:24,293 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 28 [2018-11-28 22:44:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:24,293 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-28 22:44:24,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 22:44:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-28 22:44:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:44:24,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:24,294 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:24,294 INFO L423 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:24,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:24,294 INFO L82 PathProgramCache]: Analyzing trace with hash 432781013, now seen corresponding path program 1 times [2018-11-28 22:44:24,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:24,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:24,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:44:24,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:24,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:24,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:24,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:24,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:24,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:44:24,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:24,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:24,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:24,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:24,937 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:24,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:24,948 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 22:44:24,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 22:44:24,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 22:44:24,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:24,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:24,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:24,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 22:44:25,136 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 23 treesize of output 24 [2018-11-28 22:44:25,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:44:25,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:25,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:25,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:25,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-28 22:44:25,194 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 23 treesize of output 24 [2018-11-28 22:44:25,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:44:25,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:25,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:25,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:25,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-11-28 22:44:25,366 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 28 treesize of output 26 [2018-11-28 22:44:25,370 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 5 treesize of output 1 [2018-11-28 22:44:25,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:25,386 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 17 treesize of output 14 [2018-11-28 22:44:25,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:25,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:25,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:25,406 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-11-28 22:44:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:25,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:25,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-28 22:44:25,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 22:44:25,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 22:44:25,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-11-28 22:44:25,506 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 24 states. [2018-11-28 22:44:26,786 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2018-11-28 22:44:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:26,819 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-28 22:44:26,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 22:44:26,821 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-11-28 22:44:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:26,822 INFO L225 Difference]: With dead ends: 54 [2018-11-28 22:44:26,822 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 22:44:26,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=216, Invalid=1424, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 22:44:26,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 22:44:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 22:44:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 22:44:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-28 22:44:26,826 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 29 [2018-11-28 22:44:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:26,826 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-28 22:44:26,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 22:44:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-28 22:44:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 22:44:26,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:26,830 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:26,830 INFO L423 AbstractCegarLoop]: === Iteration 32 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:26,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:26,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2109992718, now seen corresponding path program 2 times [2018-11-28 22:44:26,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:26,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:26,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:27,224 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-11-28 22:44:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:27,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:27,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:27,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:44:27,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:44:27,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:27,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:27,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:44:27,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:27,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:27,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:27,594 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:27,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:27,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:27,609 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 22:44:27,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 22:44:27,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 22:44:27,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:27,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:27,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:27,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 22:44:27,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 23 treesize of output 24 [2018-11-28 22:44:27,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:44:27,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:27,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:27,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:27,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-11-28 22:44:27,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-28 22:44:27,938 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 17 treesize of output 14 [2018-11-28 22:44:27,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:27,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:27,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:27,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-11-28 22:44:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:28,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:28,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 22:44:28,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 22:44:28,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 22:44:28,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-11-28 22:44:28,027 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 22 states. [2018-11-28 22:44:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:28,868 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-28 22:44:28,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:44:28,870 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-11-28 22:44:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:28,871 INFO L225 Difference]: With dead ends: 43 [2018-11-28 22:44:28,871 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 22:44:28,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 22:44:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 22:44:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-28 22:44:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 22:44:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-28 22:44:28,874 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 31 [2018-11-28 22:44:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:28,874 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-28 22:44:28,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 22:44:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-28 22:44:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 22:44:28,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:28,876 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:28,876 INFO L423 AbstractCegarLoop]: === Iteration 33 === [cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:44:28,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:28,877 INFO L82 PathProgramCache]: Analyzing trace with hash -570734874, now seen corresponding path program 3 times [2018-11-28 22:44:28,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:28,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:28,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:28,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:44:28,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 22:44:29,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:29,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:44:29,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 22:44:29,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 22:44:29,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:29,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:29,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:44:29,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:29,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:44:29,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:44:29,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:29,553 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:29,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:29,566 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-11-28 22:44:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:29,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:29,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-11-28 22:44:29,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 22:44:29,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 22:44:29,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-11-28 22:44:29,952 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2018-11-28 22:44:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:31,190 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-28 22:44:31,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 22:44:31,192 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-11-28 22:44:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:31,192 INFO L225 Difference]: With dead ends: 45 [2018-11-28 22:44:31,192 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:44:31,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 22:44:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:44:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:44:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:44:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:44:31,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-11-28 22:44:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:31,197 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:44:31,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 22:44:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:44:31,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:44:31,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:44:31 BoogieIcfgContainer [2018-11-28 22:44:31,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:44:31,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:44:31,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:44:31,203 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:44:31,204 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:59" (3/4) ... [2018-11-28 22:44:31,210 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:44:31,218 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:44:31,218 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrlcpy [2018-11-28 22:44:31,218 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 22:44:31,218 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 22:44:31,218 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:44:31,224 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-28 22:44:31,224 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 22:44:31,224 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 22:44:31,271 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:44:31,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:44:31,273 INFO L168 Benchmark]: Toolchain (without parser) took 33640.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 400.6 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -265.3 MB). Peak memory consumption was 135.2 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:31,273 INFO L168 Benchmark]: CDTParser took 0.59 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. [2018-11-28 22:44:31,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:31,276 INFO L168 Benchmark]: Boogie Preprocessor took 74.42 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:31,277 INFO L168 Benchmark]: RCFGBuilder took 789.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:31,277 INFO L168 Benchmark]: TraceAbstraction took 32015.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -139.5 MB). Peak memory consumption was 123.2 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:31,277 INFO L168 Benchmark]: Witness Printer took 68.74 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: 691.1 kB). Peak memory consumption was 691.1 kB. Max. memory is 11.5 GB. [2018-11-28 22:44:31,282 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.59 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 687.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.42 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 789.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32015.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -139.5 MB). Peak memory consumption was 123.2 MB. Max. memory is 11.5 GB. * Witness Printer took 68.74 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: 691.1 kB). Peak memory consumption was 691.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 555]: 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: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: 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: 555]: 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: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 52 locations, 13 error locations. SAFE Result, 31.9s OverallTime, 33 OverallIterations, 4 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 953 SDtfs, 1331 SDslu, 4147 SDs, 0 SdLazy, 4110 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 241 SyntacticMatches, 10 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=14, 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, 33 MinimizatonAttempts, 170 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 993 NumberOfCodeBlocks, 993 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 949 ConstructedInterpolants, 30 QuantifiedInterpolants, 233369 SizeOfPredicates, 161 NumberOfNonLiveVariables, 1907 ConjunctsInSsa, 489 ConjunctsInUnsatCore, 44 InterpolantComputations, 23 PerfectInterpolantSequences, 20/183 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...