./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstpncpy-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 0b29929f70f48b1f1b1180a065dc51df3698b29b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:56:23,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:56:23,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:56:23,908 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:56:23,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:56:23,911 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:56:23,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:56:23,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:56:23,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:56:23,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:56:23,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:56:23,921 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:56:23,921 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:56:23,922 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:56:23,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:56:23,924 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:56:23,925 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:56:23,927 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:56:23,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:56:23,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:56:23,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:56:23,933 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:56:23,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:56:23,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:56:23,936 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:56:23,937 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:56:23,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:56:23,939 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:56:23,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:56:23,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:56:23,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:56:23,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:56:23,943 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:56:23,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:56:23,944 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:56:23,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:56:23,945 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:56:23,963 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:56:23,963 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:56:23,965 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:56:23,965 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:56:23,965 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:56:23,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:56:23,965 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:56:23,966 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:56:23,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:56:23,966 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:56:23,966 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:56:23,966 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:56:23,966 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:56:23,967 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:56:23,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:56:23,967 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:56:23,967 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:56:23,967 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:56:23,968 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:56:23,968 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:56:23,968 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:56:23,968 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:23,968 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:56:23,968 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:56:23,969 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:56:23,969 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:56:23,969 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 -> 0b29929f70f48b1f1b1180a065dc51df3698b29b [2019-01-13 21:56:24,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:56:24,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:56:24,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:56:24,059 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:56:24,059 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:56:24,060 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:24,124 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82aeef0b7/d3ea0d3cc5e244d1a91d70ae1686f8e9/FLAGae4dfda33 [2019-01-13 21:56:24,650 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:56:24,651 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:24,669 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82aeef0b7/d3ea0d3cc5e244d1a91d70ae1686f8e9/FLAGae4dfda33 [2019-01-13 21:56:24,907 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82aeef0b7/d3ea0d3cc5e244d1a91d70ae1686f8e9 [2019-01-13 21:56:24,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:56:24,911 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:56:24,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:24,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:56:24,916 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:56:24,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:24" (1/1) ... [2019-01-13 21:56:24,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19df2242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:24, skipping insertion in model container [2019-01-13 21:56:24,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:24" (1/1) ... [2019-01-13 21:56:24,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:56:24,982 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:56:25,376 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:25,393 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:56:25,536 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:25,590 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:56:25,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:25 WrapperNode [2019-01-13 21:56:25,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:25,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:56:25,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:56:25,591 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:56:25,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:25" (1/1) ... [2019-01-13 21:56:25,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:25" (1/1) ... [2019-01-13 21:56:25,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:25" (1/1) ... [2019-01-13 21:56:25,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:25" (1/1) ... [2019-01-13 21:56:25,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:25" (1/1) ... [2019-01-13 21:56:25,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:25" (1/1) ... [2019-01-13 21:56:25,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:25" (1/1) ... [2019-01-13 21:56:25,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:56:25,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:56:25,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:56:25,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:56:25,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:25,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:56:25,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:56:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:56:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:56:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure cstpncpy [2019-01-13 21:56:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:56:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:56:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:56:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:56:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:56:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:56:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:56:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:56:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:56:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:56:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:56:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:56:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:56:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:56:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:56:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:56:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:56:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:56:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:56:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:56:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:56:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:56:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:56:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:56:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:56:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:56:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:56:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:56:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:56:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:56:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:56:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:56:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:56:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:56:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:56:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:56:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:56:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:56:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:56:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:56:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:56:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:56:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:56:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:56:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:56:25,732 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:56:25,732 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:56:25,732 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:56:25,732 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:56:25,732 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:56:25,732 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:56:25,733 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:56:25,733 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:56:25,733 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:56:25,733 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:56:25,733 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:56:25,733 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:56:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:56:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:56:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:56:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:56:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:56:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:56:25,734 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:56:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:56:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:56:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:56:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:56:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:56:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:56:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:56:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:56:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:56:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:56:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:56:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:56:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:56:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:56:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:56:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:56:25,737 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:56:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:56:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:56:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:56:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:56:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:56:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:56:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:56:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:56:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:56:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:56:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:56:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:56:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:56:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:56:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:56:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:56:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:56:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:56:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:56:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:56:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:56:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:56:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:56:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure cstpncpy [2019-01-13 21:56:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:56:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 21:56:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 21:56:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:56:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:56:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:56:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:56:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:56:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:56:26,553 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:56:26,554 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 21:56:26,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:26 BoogieIcfgContainer [2019-01-13 21:56:26,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:56:26,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:56:26,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:56:26,560 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:56:26,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:56:24" (1/3) ... [2019-01-13 21:56:26,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1c9215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:26, skipping insertion in model container [2019-01-13 21:56:26,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:25" (2/3) ... [2019-01-13 21:56:26,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1c9215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:26, skipping insertion in model container [2019-01-13 21:56:26,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:26" (3/3) ... [2019-01-13 21:56:26,564 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:26,574 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:56:26,582 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-01-13 21:56:26,600 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-01-13 21:56:26,626 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:56:26,627 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:56:26,627 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:56:26,627 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:56:26,627 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:56:26,628 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:56:26,628 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:56:26,628 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:56:26,628 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:56:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-01-13 21:56:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:26,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:26,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:26,658 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:26,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:26,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1703752957, now seen corresponding path program 1 times [2019-01-13 21:56:26,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:26,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:26,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:26,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:26,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:26,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:26,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:26,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:26,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:26,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:26,896 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2019-01-13 21:56:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:27,142 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-01-13 21:56:27,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:27,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:56:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:27,156 INFO L225 Difference]: With dead ends: 60 [2019-01-13 21:56:27,156 INFO L226 Difference]: Without dead ends: 57 [2019-01-13 21:56:27,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-13 21:56:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-13 21:56:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-13 21:56:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2019-01-13 21:56:27,200 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 10 [2019-01-13 21:56:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:27,201 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2019-01-13 21:56:27,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2019-01-13 21:56:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:27,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:27,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:27,202 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:27,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1703752956, now seen corresponding path program 1 times [2019-01-13 21:56:27,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:27,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:27,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:27,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:27,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:27,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:27,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:27,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:27,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:27,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:27,302 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 4 states. [2019-01-13 21:56:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:27,333 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-01-13 21:56:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:27,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:56:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:27,337 INFO L225 Difference]: With dead ends: 56 [2019-01-13 21:56:27,337 INFO L226 Difference]: Without dead ends: 56 [2019-01-13 21:56:27,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-13 21:56:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-13 21:56:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-13 21:56:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-01-13 21:56:27,347 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 10 [2019-01-13 21:56:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:27,347 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-01-13 21:56:27,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-01-13 21:56:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 21:56:27,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:27,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:27,348 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:27,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:27,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1419231174, now seen corresponding path program 1 times [2019-01-13 21:56:27,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:27,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:27,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:27,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:27,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:27,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:27,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:27,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:27,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:27,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:27,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:27,425 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 3 states. [2019-01-13 21:56:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:27,537 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2019-01-13 21:56:27,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:27,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-13 21:56:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:27,540 INFO L225 Difference]: With dead ends: 50 [2019-01-13 21:56:27,540 INFO L226 Difference]: Without dead ends: 50 [2019-01-13 21:56:27,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-13 21:56:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-13 21:56:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-13 21:56:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-01-13 21:56:27,547 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2019-01-13 21:56:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:27,547 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-01-13 21:56:27,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-01-13 21:56:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 21:56:27,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:27,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:27,549 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:27,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1419231175, now seen corresponding path program 1 times [2019-01-13 21:56:27,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:27,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:27,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:27,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:27,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:27,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:27,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:27,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:27,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:27,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:27,626 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 3 states. [2019-01-13 21:56:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:27,864 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-01-13 21:56:27,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:27,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-13 21:56:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:27,866 INFO L225 Difference]: With dead ends: 44 [2019-01-13 21:56:27,866 INFO L226 Difference]: Without dead ends: 44 [2019-01-13 21:56:27,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-13 21:56:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-13 21:56:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:56:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-01-13 21:56:27,874 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2019-01-13 21:56:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:27,875 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-01-13 21:56:27,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-01-13 21:56:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 21:56:27,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:27,877 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] [2019-01-13 21:56:27,878 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:27,879 INFO L82 PathProgramCache]: Analyzing trace with hash -185937938, now seen corresponding path program 1 times [2019-01-13 21:56:27,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:27,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:27,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:27,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:27,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:28,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:28,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:28,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:28,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:28,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:28,043 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2019-01-13 21:56:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:28,156 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-01-13 21:56:28,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:28,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-13 21:56:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:28,165 INFO L225 Difference]: With dead ends: 65 [2019-01-13 21:56:28,166 INFO L226 Difference]: Without dead ends: 65 [2019-01-13 21:56:28,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-13 21:56:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2019-01-13 21:56:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-13 21:56:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-01-13 21:56:28,180 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 21 [2019-01-13 21:56:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:28,180 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-01-13 21:56:28,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-01-13 21:56:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 21:56:28,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:28,182 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] [2019-01-13 21:56:28,182 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:28,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:28,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1197055188, now seen corresponding path program 1 times [2019-01-13 21:56:28,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:28,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:28,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:28,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:28,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:28,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:28,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:28,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:28,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:28,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:28,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:28,335 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 6 states. [2019-01-13 21:56:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:28,439 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-01-13 21:56:28,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:28,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-13 21:56:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:28,441 INFO L225 Difference]: With dead ends: 62 [2019-01-13 21:56:28,441 INFO L226 Difference]: Without dead ends: 58 [2019-01-13 21:56:28,442 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 [2019-01-13 21:56:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-13 21:56:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2019-01-13 21:56:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:56:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-01-13 21:56:28,446 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2019-01-13 21:56:28,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:28,447 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-01-13 21:56:28,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-01-13 21:56:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 21:56:28,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:28,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:28,448 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:28,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2041466273, now seen corresponding path program 1 times [2019-01-13 21:56:28,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:28,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:28,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:28,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:28,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:28,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:28,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 21:56:28,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 21:56:28,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 21:56:28,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:28,747 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 10 states. [2019-01-13 21:56:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:29,020 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-01-13 21:56:29,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:56:29,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-01-13 21:56:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:29,022 INFO L225 Difference]: With dead ends: 43 [2019-01-13 21:56:29,022 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:56:29,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-13 21:56:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:56:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 21:56:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:56:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-01-13 21:56:29,028 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 22 [2019-01-13 21:56:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:29,029 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-01-13 21:56:29,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 21:56:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-01-13 21:56:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 21:56:29,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:29,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:29,030 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:29,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2041466272, now seen corresponding path program 1 times [2019-01-13 21:56:29,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:29,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:29,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:29,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:29,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:29,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:29,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 21:56:29,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 21:56:29,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 21:56:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:29,384 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 10 states. [2019-01-13 21:56:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:29,790 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-13 21:56:29,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 21:56:29,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-01-13 21:56:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:29,792 INFO L225 Difference]: With dead ends: 49 [2019-01-13 21:56:29,792 INFO L226 Difference]: Without dead ends: 49 [2019-01-13 21:56:29,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-13 21:56:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-13 21:56:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2019-01-13 21:56:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 21:56:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-01-13 21:56:29,797 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 22 [2019-01-13 21:56:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:29,798 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-01-13 21:56:29,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 21:56:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-01-13 21:56:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:56:29,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:29,799 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] [2019-01-13 21:56:29,799 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:29,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1139054998, now seen corresponding path program 1 times [2019-01-13 21:56:29,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:29,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:29,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:29,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:29,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:30,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:30,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 21:56:30,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 21:56:30,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 21:56:30,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:30,017 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 9 states. [2019-01-13 21:56:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:30,387 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-01-13 21:56:30,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 21:56:30,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-01-13 21:56:30,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:30,389 INFO L225 Difference]: With dead ends: 51 [2019-01-13 21:56:30,389 INFO L226 Difference]: Without dead ends: 51 [2019-01-13 21:56:30,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-01-13 21:56:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-13 21:56:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2019-01-13 21:56:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:56:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-01-13 21:56:30,394 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 23 [2019-01-13 21:56:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:30,395 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-01-13 21:56:30,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 21:56:30,395 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-01-13 21:56:30,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:56:30,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:30,396 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] [2019-01-13 21:56:30,396 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:30,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:30,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1139054999, now seen corresponding path program 1 times [2019-01-13 21:56:30,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:30,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:30,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:30,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:30,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:30,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:30,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 21:56:30,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 21:56:30,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 21:56:30,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:56:30,831 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 11 states. [2019-01-13 21:56:31,280 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-13 21:56:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:31,380 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-13 21:56:31,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 21:56:31,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-01-13 21:56:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:31,383 INFO L225 Difference]: With dead ends: 45 [2019-01-13 21:56:31,383 INFO L226 Difference]: Without dead ends: 45 [2019-01-13 21:56:31,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-01-13 21:56:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-13 21:56:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-13 21:56:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 21:56:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-01-13 21:56:31,389 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 23 [2019-01-13 21:56:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:31,389 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-01-13 21:56:31,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 21:56:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-01-13 21:56:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:31,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:31,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:31,391 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:31,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:31,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1585110580, now seen corresponding path program 1 times [2019-01-13 21:56:31,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:31,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:31,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:31,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:31,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:31,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:31,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:31,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:31,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:31,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:31,576 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-01-13 21:56:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:31,767 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-01-13 21:56:31,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:31,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-01-13 21:56:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:31,770 INFO L225 Difference]: With dead ends: 44 [2019-01-13 21:56:31,770 INFO L226 Difference]: Without dead ends: 44 [2019-01-13 21:56:31,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-13 21:56:31,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-13 21:56:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:56:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-01-13 21:56:31,777 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 28 [2019-01-13 21:56:31,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:31,778 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-01-13 21:56:31,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-01-13 21:56:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:31,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:31,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:31,779 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:31,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:31,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1585110579, now seen corresponding path program 1 times [2019-01-13 21:56:31,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:31,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:31,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:31,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:31,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:32,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:32,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:32,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:32,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:32,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:32,350 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2019-01-13 21:56:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:32,449 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2019-01-13 21:56:32,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:32,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-13 21:56:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:32,451 INFO L225 Difference]: With dead ends: 85 [2019-01-13 21:56:32,451 INFO L226 Difference]: Without dead ends: 85 [2019-01-13 21:56:32,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-13 21:56:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2019-01-13 21:56:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-13 21:56:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2019-01-13 21:56:32,458 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 28 [2019-01-13 21:56:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:32,459 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-01-13 21:56:32,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2019-01-13 21:56:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:32,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:32,460 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:32,460 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:32,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1564088447, now seen corresponding path program 1 times [2019-01-13 21:56:32,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:32,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:32,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:33,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:33,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:33,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:33,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:33,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:33,025 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 6 states. [2019-01-13 21:56:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:33,124 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-01-13 21:56:33,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:33,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-13 21:56:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:33,127 INFO L225 Difference]: With dead ends: 72 [2019-01-13 21:56:33,127 INFO L226 Difference]: Without dead ends: 72 [2019-01-13 21:56:33,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-13 21:56:33,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-01-13 21:56:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-13 21:56:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-01-13 21:56:33,132 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 28 [2019-01-13 21:56:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:33,132 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-01-13 21:56:33,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-01-13 21:56:33,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:33,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:33,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:33,134 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:33,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:33,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1162408753, now seen corresponding path program 1 times [2019-01-13 21:56:33,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:33,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:33,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:33,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:33,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:33,563 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-13 21:56:33,798 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-13 21:56:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:34,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:34,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-13 21:56:34,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 21:56:34,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 21:56:34,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-01-13 21:56:34,355 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 17 states. [2019-01-13 21:56:34,748 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-13 21:56:35,048 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-01-13 21:56:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:35,876 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-01-13 21:56:35,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 21:56:35,878 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-01-13 21:56:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:35,879 INFO L225 Difference]: With dead ends: 76 [2019-01-13 21:56:35,879 INFO L226 Difference]: Without dead ends: 76 [2019-01-13 21:56:35,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-01-13 21:56:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-13 21:56:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-01-13 21:56:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-13 21:56:35,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-01-13 21:56:35,887 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 28 [2019-01-13 21:56:35,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:35,887 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-01-13 21:56:35,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 21:56:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-01-13 21:56:35,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:35,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:35,889 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:35,889 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:35,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:35,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1141386621, now seen corresponding path program 1 times [2019-01-13 21:56:35,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:35,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:35,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:35,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:35,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:36,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:36,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 21:56:36,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 21:56:36,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 21:56:36,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:56:36,241 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 12 states. [2019-01-13 21:56:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:36,643 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2019-01-13 21:56:36,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:56:36,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-01-13 21:56:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:36,647 INFO L225 Difference]: With dead ends: 130 [2019-01-13 21:56:36,647 INFO L226 Difference]: Without dead ends: 130 [2019-01-13 21:56:36,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-01-13 21:56:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-13 21:56:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-01-13 21:56:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-13 21:56:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2019-01-13 21:56:36,654 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 28 [2019-01-13 21:56:36,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:36,655 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2019-01-13 21:56:36,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 21:56:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2019-01-13 21:56:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:36,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:36,657 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:36,657 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:36,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:36,657 INFO L82 PathProgramCache]: Analyzing trace with hash -922531903, now seen corresponding path program 1 times [2019-01-13 21:56:36,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:36,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:36,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:36,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:36,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:36,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:36,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:37,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:37,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:56:37,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:56:37,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:37,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:37,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:56:37,197 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 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 21:56:37,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:37,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:37,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:56:37,280 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:40 [2019-01-13 21:56:37,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:56:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:56:37,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:37,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:37,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:37,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-01-13 21:56:37,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:37,564 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 24 treesize of output 27 [2019-01-13 21:56:37,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:37,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:37,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:37,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 21:56:37,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:37,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:37,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-01-13 21:56:37,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-13 21:56:37,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-13 21:56:37,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:37,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:37,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:37,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-01-13 21:56:37,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-13 21:56:37,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-13 21:56:37,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:37,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:37,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:37,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:33 [2019-01-13 21:56:38,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-13 21:56:38,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-13 21:56:38,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:38,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:38,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-13 21:56:38,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:64 [2019-01-13 21:56:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:38,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:38,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-01-13 21:56:38,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-13 21:56:38,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-13 21:56:38,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2019-01-13 21:56:38,582 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 25 states. [2019-01-13 21:56:38,954 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2019-01-13 21:56:39,259 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-01-13 21:56:39,915 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2019-01-13 21:56:40,199 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 72 [2019-01-13 21:56:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:40,676 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2019-01-13 21:56:40,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 21:56:40,677 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2019-01-13 21:56:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:40,679 INFO L225 Difference]: With dead ends: 141 [2019-01-13 21:56:40,680 INFO L226 Difference]: Without dead ends: 141 [2019-01-13 21:56:40,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2019-01-13 21:56:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-13 21:56:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-01-13 21:56:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-13 21:56:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2019-01-13 21:56:40,687 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 28 [2019-01-13 21:56:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:40,688 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2019-01-13 21:56:40,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-13 21:56:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2019-01-13 21:56:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 21:56:40,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:40,690 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] [2019-01-13 21:56:40,690 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:40,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:40,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1466282070, now seen corresponding path program 1 times [2019-01-13 21:56:40,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:40,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:40,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:40,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:40,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:41,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:41,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:41,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:41,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:41,745 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-13 21:56:41,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:56:41,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:56:41,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:41,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-13 21:56:41,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 21:56:41,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2019-01-13 21:56:41,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:41,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:56:41,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:41,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:41,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:41,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:56:41,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:41,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2019-01-13 21:56:42,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 21:56:42,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:56:42,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:42,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:42,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 21:56:42,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:56:42,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:42,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:42,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:42,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2019-01-13 21:56:42,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2019-01-13 21:56:42,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2019-01-13 21:56:42,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:42,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:42,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-13 21:56:42,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:56:42,183 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:42,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:42,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:42,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2019-01-13 21:56:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:43,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:43,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2019-01-13 21:56:43,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-13 21:56:43,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-13 21:56:43,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2019-01-13 21:56:43,084 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 29 states. [2019-01-13 21:56:44,064 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-01-13 21:56:44,243 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-01-13 21:56:44,415 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-01-13 21:56:45,177 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-01-13 21:56:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:45,902 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2019-01-13 21:56:45,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 21:56:45,909 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-13 21:56:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:45,911 INFO L225 Difference]: With dead ends: 132 [2019-01-13 21:56:45,911 INFO L226 Difference]: Without dead ends: 132 [2019-01-13 21:56:45,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=245, Invalid=1735, Unknown=0, NotChecked=0, Total=1980 [2019-01-13 21:56:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-13 21:56:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-01-13 21:56:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-13 21:56:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2019-01-13 21:56:45,921 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 29 [2019-01-13 21:56:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:45,921 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2019-01-13 21:56:45,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-13 21:56:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2019-01-13 21:56:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 21:56:45,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:45,925 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:45,928 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1002178119, now seen corresponding path program 1 times [2019-01-13 21:56:45,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:45,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:47,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:47,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:47,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:47,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:47,372 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 21:56:47,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:56:47,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:56:47,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:56:47,386 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,437 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-01-13 21:56:47,462 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2019-01-13 21:56:47,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:47,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:47,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:32 [2019-01-13 21:56:47,525 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 28 treesize of output 25 [2019-01-13 21:56:47,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:56:47,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,560 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 38 treesize of output 35 [2019-01-13 21:56:47,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:56:47,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,606 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 34 treesize of output 31 [2019-01-13 21:56:47,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:56:47,609 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,620 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,647 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 24 treesize of output 21 [2019-01-13 21:56:47,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:56:47,652 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,659 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:47,704 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:67, output treesize:52 [2019-01-13 21:56:47,840 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 45 treesize of output 39 [2019-01-13 21:56:47,852 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 20 treesize of output 11 [2019-01-13 21:56:47,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,939 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 30 treesize of output 26 [2019-01-13 21:56:47,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:56:47,947 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:47,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:48,060 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 34 treesize of output 30 [2019-01-13 21:56:48,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:56:48,064 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:48,072 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:48,092 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 23 treesize of output 19 [2019-01-13 21:56:48,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:56:48,096 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:48,101 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:48,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:56:48,119 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:80, output treesize:29 [2019-01-13 21:56:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:48,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:48,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 30 [2019-01-13 21:56:48,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-13 21:56:48,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-13 21:56:48,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2019-01-13 21:56:48,837 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand 31 states. [2019-01-13 21:56:49,377 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-01-13 21:56:49,549 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-01-13 21:56:49,731 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-01-13 21:56:50,138 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-01-13 21:56:50,314 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-13 21:56:50,554 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-01-13 21:56:51,276 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-13 21:56:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:51,878 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2019-01-13 21:56:51,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-13 21:56:51,879 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-01-13 21:56:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:51,880 INFO L225 Difference]: With dead ends: 149 [2019-01-13 21:56:51,880 INFO L226 Difference]: Without dead ends: 149 [2019-01-13 21:56:51,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=213, Invalid=1949, Unknown=0, NotChecked=0, Total=2162 [2019-01-13 21:56:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-13 21:56:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 139. [2019-01-13 21:56:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-13 21:56:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2019-01-13 21:56:51,888 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 32 [2019-01-13 21:56:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:51,888 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2019-01-13 21:56:51,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-13 21:56:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2019-01-13 21:56:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 21:56:51,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:51,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:51,892 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:51,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:51,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1609289062, now seen corresponding path program 1 times [2019-01-13 21:56:51,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:51,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:51,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:51,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:51,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:52,148 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2019-01-13 21:56:52,452 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2019-01-13 21:56:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:52,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:52,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:52,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:52,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:52,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:52,476 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand 7 states. [2019-01-13 21:56:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:52,652 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2019-01-13 21:56:52,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:52,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-01-13 21:56:52,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:52,654 INFO L225 Difference]: With dead ends: 138 [2019-01-13 21:56:52,654 INFO L226 Difference]: Without dead ends: 80 [2019-01-13 21:56:52,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-13 21:56:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2019-01-13 21:56:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-13 21:56:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-01-13 21:56:52,660 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 32 [2019-01-13 21:56:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:52,660 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-01-13 21:56:52,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-01-13 21:56:52,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 21:56:52,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:52,664 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:52,664 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:52,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:52,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1731160686, now seen corresponding path program 1 times [2019-01-13 21:56:52,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:52,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:52,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:52,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:52,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:53,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:53,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:53,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:53,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:53,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:56:53,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:56:53,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:56:53,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,785 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-01-13 21:56:53,801 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2019-01-13 21:56:53,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:53,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:53,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:32 [2019-01-13 21:56:53,872 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 28 treesize of output 25 [2019-01-13 21:56:53,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:56:53,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,906 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 24 treesize of output 21 [2019-01-13 21:56:53,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:56:53,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,945 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 38 treesize of output 35 [2019-01-13 21:56:53,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:56:53,947 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,958 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2019-01-13 21:56:53,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 8 treesize of output 7 [2019-01-13 21:56:53,989 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:53,998 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:54,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:54,018 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:67, output treesize:52 [2019-01-13 21:56:54,114 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 45 treesize of output 39 [2019-01-13 21:56:54,117 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 20 treesize of output 11 [2019-01-13 21:56:54,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:54,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:54,153 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 30 treesize of output 26 [2019-01-13 21:56:54,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:56:54,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:54,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:54,188 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 34 treesize of output 30 [2019-01-13 21:56:54,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:56:54,193 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:54,203 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:54,222 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 23 treesize of output 19 [2019-01-13 21:56:54,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:56:54,242 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:54,246 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:54,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:56:54,262 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:80, output treesize:29 [2019-01-13 21:56:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:54,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:54,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2019-01-13 21:56:54,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-13 21:56:54,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-13 21:56:54,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2019-01-13 21:56:54,978 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 30 states. [2019-01-13 21:56:55,641 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-13 21:56:55,876 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-01-13 21:56:56,060 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-01-13 21:56:56,246 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-01-13 21:56:56,672 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-01-13 21:56:57,007 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-01-13 21:56:57,727 WARN L181 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-01-13 21:56:58,196 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-13 21:56:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:58,797 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-13 21:56:58,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 21:56:58,798 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2019-01-13 21:56:58,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:58,799 INFO L225 Difference]: With dead ends: 75 [2019-01-13 21:56:58,800 INFO L226 Difference]: Without dead ends: 75 [2019-01-13 21:56:58,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=204, Invalid=1866, Unknown=0, NotChecked=0, Total=2070 [2019-01-13 21:56:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-13 21:56:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2019-01-13 21:56:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-13 21:56:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-01-13 21:56:58,806 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 34 [2019-01-13 21:56:58,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:58,809 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-01-13 21:56:58,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-13 21:56:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-01-13 21:56:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 21:56:58,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:58,810 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:58,810 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:56:58,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1752182818, now seen corresponding path program 2 times [2019-01-13 21:56:58,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:58,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:58,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:58,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:58,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:59,146 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2019-01-13 21:56:59,598 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-13 21:57:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:00,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:00,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:00,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:57:00,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:57:00,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:57:00,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:00,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:00,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-13 21:57:00,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 21:57:00,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:00,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:00,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,353 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2019-01-13 21:57:00,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:57:00,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 21:57:00,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-01-13 21:57:00,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:00,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:00,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:00,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:57:00,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-13 21:57:00,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-01-13 21:57:00,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 21:57:00,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:00,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2019-01-13 21:57:00,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-13 21:57:00,654 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:37 [2019-01-13 21:57:00,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-13 21:57:00,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2019-01-13 21:57:00,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:29 [2019-01-13 21:57:00,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2019-01-13 21:57:00,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-13 21:57:00,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:00,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:01,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:01,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2019-01-13 21:57:01,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 [2019-01-13 21:57:01,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:01,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:01,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:01,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:01,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:24 [2019-01-13 21:57:01,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-13 21:57:01,724 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 [2019-01-13 21:57:01,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:01,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:01,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-13 21:57:01,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:50 [2019-01-13 21:57:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:02,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:02,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2019-01-13 21:57:02,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-13 21:57:02,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-13 21:57:02,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2019-01-13 21:57:02,220 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 34 states. [2019-01-13 21:57:03,109 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-01-13 21:57:03,454 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-01-13 21:57:03,961 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-01-13 21:57:04,163 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-01-13 21:57:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:04,783 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-01-13 21:57:04,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 21:57:04,784 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-13 21:57:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:04,785 INFO L225 Difference]: With dead ends: 77 [2019-01-13 21:57:04,786 INFO L226 Difference]: Without dead ends: 77 [2019-01-13 21:57:04,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=266, Invalid=2284, Unknown=0, NotChecked=0, Total=2550 [2019-01-13 21:57:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-13 21:57:04,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2019-01-13 21:57:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-13 21:57:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-01-13 21:57:04,791 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 34 [2019-01-13 21:57:04,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:04,793 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-01-13 21:57:04,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-13 21:57:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-01-13 21:57:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 21:57:04,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:04,794 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:04,795 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:57:04,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:04,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1516907499, now seen corresponding path program 2 times [2019-01-13 21:57:04,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:04,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:04,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:04,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:57:04,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:05,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:05,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:05,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:57:05,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:57:05,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:57:05,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:05,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:05,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-13 21:57:05,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 21:57:05,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:05,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:05,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2019-01-13 21:57:05,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:05,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:05,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:06,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:06,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:06,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:57:06,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2019-01-13 21:57:06,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 21:57:06,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:06,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 21:57:06,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:06,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2019-01-13 21:57:06,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2019-01-13 21:57:06,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2019-01-13 21:57:06,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-13 21:57:06,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:57:06,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:06,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2019-01-13 21:57:07,439 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-13 21:57:08,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:08,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:08,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2019-01-13 21:57:08,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-13 21:57:08,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-13 21:57:08,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2019-01-13 21:57:08,189 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 34 states. [2019-01-13 21:57:09,266 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-01-13 21:57:10,539 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-01-13 21:57:10,815 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-01-13 21:57:11,010 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-01-13 21:57:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:11,608 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-01-13 21:57:11,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-13 21:57:11,612 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2019-01-13 21:57:11,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:11,614 INFO L225 Difference]: With dead ends: 84 [2019-01-13 21:57:11,614 INFO L226 Difference]: Without dead ends: 84 [2019-01-13 21:57:11,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=396, Invalid=3026, Unknown=0, NotChecked=0, Total=3422 [2019-01-13 21:57:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-13 21:57:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2019-01-13 21:57:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-13 21:57:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-01-13 21:57:11,620 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 35 [2019-01-13 21:57:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:11,620 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-01-13 21:57:11,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-13 21:57:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-01-13 21:57:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 21:57:11,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:11,625 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:11,625 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:57:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:11,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1446478783, now seen corresponding path program 2 times [2019-01-13 21:57:11,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:11,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:11,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:11,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:57:11,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:12,249 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 21:57:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:12,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:12,908 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 [2019-01-13 21:57:12,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:57:12,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:57:12,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:57:12,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:13,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:13,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:13,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:13,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-13 21:57:13,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 21:57:13,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:13,071 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2019-01-13 21:57:13,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:13,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:13,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:13,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:13,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:13,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:57:13,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2019-01-13 21:57:13,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 21:57:13,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:13,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 21:57:13,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:13,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,256 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-01-13 21:57:13,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-01-13 21:57:13,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2019-01-13 21:57:13,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-13 21:57:13,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:57:13,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:13,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:13,376 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-01-13 21:57:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:13,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:13,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 37 [2019-01-13 21:57:13,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-13 21:57:13,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-13 21:57:13,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2019-01-13 21:57:13,933 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 38 states. [2019-01-13 21:57:17,033 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-01-13 21:57:17,992 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-01-13 21:57:18,728 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-13 21:57:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:18,791 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2019-01-13 21:57:18,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-13 21:57:18,793 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 36 [2019-01-13 21:57:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:18,795 INFO L225 Difference]: With dead ends: 115 [2019-01-13 21:57:18,795 INFO L226 Difference]: Without dead ends: 115 [2019-01-13 21:57:18,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=770, Invalid=5710, Unknown=0, NotChecked=0, Total=6480 [2019-01-13 21:57:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-13 21:57:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2019-01-13 21:57:18,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-13 21:57:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-01-13 21:57:18,801 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 36 [2019-01-13 21:57:18,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:18,801 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-01-13 21:57:18,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-13 21:57:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-01-13 21:57:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-13 21:57:18,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:18,802 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:18,802 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:57:18,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:18,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1988806159, now seen corresponding path program 2 times [2019-01-13 21:57:18,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:18,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:18,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:18,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:57:18,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:19,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:19,710 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 [2019-01-13 21:57:19,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:57:19,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:57:19,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:57:19,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:19,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:19,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:19,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:19,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:19,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:19,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-13 21:57:19,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 21:57:19,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:19,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:19,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:19,910 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2019-01-13 21:57:19,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:19,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:19,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:19,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:57:19,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:20,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:20,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:20,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:20,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2019-01-13 21:57:20,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 21:57:20,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:20,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:20,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:20,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 21:57:20,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:20,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:20,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:20,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:20,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-01-13 21:57:20,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-01-13 21:57:20,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2019-01-13 21:57:20,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:20,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:20,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-13 21:57:20,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:57:20,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:20,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:20,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:20,201 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-01-13 21:57:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:20,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:20,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 35 [2019-01-13 21:57:20,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-13 21:57:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-13 21:57:20,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2019-01-13 21:57:20,816 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 36 states. [2019-01-13 21:57:22,881 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-01-13 21:57:23,638 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-01-13 21:57:23,917 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-01-13 21:57:24,297 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-01-13 21:57:24,732 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-01-13 21:57:25,585 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-01-13 21:57:25,915 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-13 21:57:25,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:25,935 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2019-01-13 21:57:25,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-13 21:57:25,936 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-01-13 21:57:25,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:25,937 INFO L225 Difference]: With dead ends: 135 [2019-01-13 21:57:25,938 INFO L226 Difference]: Without dead ends: 135 [2019-01-13 21:57:25,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=761, Invalid=5559, Unknown=0, NotChecked=0, Total=6320 [2019-01-13 21:57:25,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-13 21:57:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 112. [2019-01-13 21:57:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-13 21:57:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2019-01-13 21:57:25,944 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 40 [2019-01-13 21:57:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:25,944 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2019-01-13 21:57:25,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-13 21:57:25,944 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2019-01-13 21:57:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 21:57:25,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:25,948 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:25,949 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:57:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:25,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2078367329, now seen corresponding path program 3 times [2019-01-13 21:57:25,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:25,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:25,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:25,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:57:25,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:26,268 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-13 21:57:26,526 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-13 21:57:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 47 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:27,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:27,421 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 [2019-01-13 21:57:27,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 21:57:27,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-13 21:57:27,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:57:27,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:27,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:27,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-13 21:57:27,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 21:57:27,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:27,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:27,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:27,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2019-01-13 21:57:27,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:27,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:27,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:27,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:57:27,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:27,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2019-01-13 21:57:27,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 21:57:27,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:27,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 21:57:27,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:27,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-01-13 21:57:27,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-01-13 21:57:27,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2019-01-13 21:57:27,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:27,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:28,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-13 21:57:28,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:57:28,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:28,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:28,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:28,012 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-01-13 21:57:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:28,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:28,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 52 [2019-01-13 21:57:28,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-13 21:57:28,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-13 21:57:28,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=2495, Unknown=0, NotChecked=0, Total=2756 [2019-01-13 21:57:28,970 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 53 states. [2019-01-13 21:57:29,649 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-01-13 21:57:30,651 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-01-13 21:57:35,968 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-01-13 21:57:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:36,153 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2019-01-13 21:57:36,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-13 21:57:36,155 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-01-13 21:57:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:36,157 INFO L225 Difference]: With dead ends: 139 [2019-01-13 21:57:36,157 INFO L226 Difference]: Without dead ends: 68 [2019-01-13 21:57:36,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3610 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1401, Invalid=11481, Unknown=0, NotChecked=0, Total=12882 [2019-01-13 21:57:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-13 21:57:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-01-13 21:57:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-13 21:57:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-13 21:57:36,164 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 52 [2019-01-13 21:57:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:36,164 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-13 21:57:36,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-13 21:57:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-13 21:57:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 21:57:36,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:36,165 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 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] [2019-01-13 21:57:36,165 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION]=== [2019-01-13 21:57:36,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:36,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1750076141, now seen corresponding path program 3 times [2019-01-13 21:57:36,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:36,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:36,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:36,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:57:36,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:36,534 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-13 21:57:36,782 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-13 21:57:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 59 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:37,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:37,681 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 [2019-01-13 21:57:37,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 21:57:38,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-13 21:57:38,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:57:38,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:38,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:57:38,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:38,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:38,084 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,100 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2019-01-13 21:57:38,174 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 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:38,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:38,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:38,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:35 [2019-01-13 21:57:38,246 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 32 treesize of output 29 [2019-01-13 21:57:38,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:38,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,292 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 28 treesize of output 25 [2019-01-13 21:57:38,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:38,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,331 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 37 treesize of output 34 [2019-01-13 21:57:38,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:38,334 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,346 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,373 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 33 treesize of output 30 [2019-01-13 21:57:38,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:57:38,376 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,384 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:38,405 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:70, output treesize:55 [2019-01-13 21:57:38,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-01-13 21:57:38,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:57:38,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,550 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 44 treesize of output 38 [2019-01-13 21:57:38,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2019-01-13 21:57:38,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,583 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 29 treesize of output 25 [2019-01-13 21:57:38,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:57:38,586 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,593 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2019-01-13 21:57:38,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:57:38,616 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,622 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:38,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:57:38,637 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:83, output treesize:32 [2019-01-13 21:57:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:39,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:39,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 52 [2019-01-13 21:57:39,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-13 21:57:39,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-13 21:57:39,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2019-01-13 21:57:39,972 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 53 states. [2019-01-13 21:57:40,432 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-01-13 21:57:40,684 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-01-13 21:57:40,909 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-01-13 21:57:41,244 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-01-13 21:57:41,433 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-01-13 21:57:41,599 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-01-13 21:57:41,793 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-01-13 21:57:42,333 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-01-13 21:57:42,891 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-01-13 21:57:43,437 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-01-13 21:57:44,001 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-01-13 21:57:44,571 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2019-01-13 21:57:45,123 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-01-13 21:57:46,138 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-01-13 21:57:46,295 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-01-13 21:57:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:46,583 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-13 21:57:46,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-13 21:57:46,583 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 64 [2019-01-13 21:57:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:46,584 INFO L225 Difference]: With dead ends: 75 [2019-01-13 21:57:46,584 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:57:46,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1969 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=593, Invalid=7239, Unknown=0, NotChecked=0, Total=7832 [2019-01-13 21:57:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:57:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:57:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:57:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:57:46,587 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2019-01-13 21:57:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:46,588 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:57:46,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-13 21:57:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:57:46,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:57:46,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:57:46 BoogieIcfgContainer [2019-01-13 21:57:46,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:57:46,594 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:57:46,594 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:57:46,594 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:57:46,595 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:26" (3/4) ... [2019-01-13 21:57:46,598 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:57:46,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:57:46,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:57:46,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:57:46,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstpncpy [2019-01-13 21:57:46,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:57:46,612 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-01-13 21:57:46,612 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-13 21:57:46,612 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-13 21:57:46,658 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:57:46,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:57:46,659 INFO L168 Benchmark]: Toolchain (without parser) took 81748.63 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 555.7 MB). Free memory was 951.3 MB in the beginning and 858.6 MB in the end (delta: 92.8 MB). Peak memory consumption was 648.5 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:46,659 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:57:46,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:46,662 INFO L168 Benchmark]: Boogie Preprocessor took 70.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:57:46,662 INFO L168 Benchmark]: RCFGBuilder took 893.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:46,662 INFO L168 Benchmark]: TraceAbstraction took 80036.98 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 436.7 MB). Free memory was 1.0 GB in the beginning and 858.6 MB in the end (delta: 187.5 MB). Peak memory consumption was 624.2 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:46,662 INFO L168 Benchmark]: Witness Printer took 64.21 ms. Allocated memory is still 1.6 GB. Free memory was 858.6 MB in the beginning and 858.6 MB in the end (delta: 67.7 kB). Peak memory consumption was 67.7 kB. Max. memory is 11.5 GB. [2019-01-13 21:57:46,664 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 678.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 893.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 80036.98 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 436.7 MB). Free memory was 1.0 GB in the beginning and 858.6 MB in the end (delta: 187.5 MB). Peak memory consumption was 624.2 MB. Max. memory is 11.5 GB. * Witness Printer took 64.21 ms. Allocated memory is still 1.6 GB. Free memory was 858.6 MB in the beginning and 858.6 MB in the end (delta: 67.7 kB). Peak memory consumption was 67.7 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 67 locations, 21 error locations. SAFE Result, 79.9s OverallTime, 26 OverallIterations, 7 TraceHistogramMax, 46.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 831 SDtfs, 2066 SDslu, 6871 SDs, 0 SdLazy, 9732 SolverSat, 865 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1015 GetRequests, 251 SyntacticMatches, 7 SemanticMatches, 757 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10899 ImplicationChecksByTransitivity, 56.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 155 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 30.8s InterpolantComputationTime, 1118 NumberOfCodeBlocks, 1118 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1082 ConstructedInterpolants, 235 QuantifiedInterpolants, 753058 SizeOfPredicates, 211 NumberOfNonLiveVariables, 2552 ConjunctsInSsa, 764 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 110/504 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...