./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstpcpy-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_cstpcpy-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 2995aa83f0315dcda376bb0d80edf8fb8acf3951 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-14 18:07:56,105 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:07:56,108 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:07:56,119 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:07:56,119 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:07:56,121 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:07:56,122 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:07:56,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:07:56,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:07:56,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:07:56,128 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:07:56,128 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:07:56,129 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:07:56,131 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:07:56,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:07:56,133 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:07:56,134 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:07:56,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:07:56,138 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:07:56,140 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:07:56,141 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:07:56,142 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:07:56,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:07:56,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:07:56,145 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:07:56,145 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:07:56,147 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:07:56,148 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:07:56,149 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:07:56,150 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:07:56,150 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:07:56,151 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:07:56,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:07:56,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:07:56,153 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:07:56,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:07:56,154 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:07:56,172 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:07:56,172 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:07:56,173 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:07:56,174 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:07:56,175 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:07:56,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:07:56,175 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:07:56,175 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:07:56,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:07:56,176 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:07:56,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:07:56,176 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:07:56,176 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:07:56,176 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:07:56,176 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:07:56,177 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:07:56,179 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:07:56,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:07:56,180 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:07:56,180 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:07:56,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:07:56,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:07:56,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:07:56,181 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:07:56,181 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:07:56,181 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 -> 2995aa83f0315dcda376bb0d80edf8fb8acf3951 [2019-01-14 18:07:56,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:07:56,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:07:56,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:07:56,260 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:07:56,260 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:07:56,261 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:56,323 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1d068b7/0099490fd8e1475384bbfe27219a6ba1/FLAGd82cbfd42 [2019-01-14 18:07:56,859 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:07:56,860 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:56,877 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1d068b7/0099490fd8e1475384bbfe27219a6ba1/FLAGd82cbfd42 [2019-01-14 18:07:57,155 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1d068b7/0099490fd8e1475384bbfe27219a6ba1 [2019-01-14 18:07:57,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:07:57,161 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:07:57,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:07:57,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:07:57,168 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:07:57,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:07:57" (1/1) ... [2019-01-14 18:07:57,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c58d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:57, skipping insertion in model container [2019-01-14 18:07:57,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:07:57" (1/1) ... [2019-01-14 18:07:57,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:07:57,250 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:07:57,663 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:07:57,682 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:07:57,804 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:07:57,857 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:07:57,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:57 WrapperNode [2019-01-14 18:07:57,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:07:57,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:07:57,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:07:57,859 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:07:57,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:57" (1/1) ... [2019-01-14 18:07:57,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:57" (1/1) ... [2019-01-14 18:07:57,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:57" (1/1) ... [2019-01-14 18:07:57,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:57" (1/1) ... [2019-01-14 18:07:57,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:57" (1/1) ... [2019-01-14 18:07:57,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:57" (1/1) ... [2019-01-14 18:07:57,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:57" (1/1) ... [2019-01-14 18:07:57,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:07:57,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:07:57,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:07:57,917 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:07:57,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:57" (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-14 18:07:57,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:07:57,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:07:57,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 18:07:57,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 18:07:57,978 INFO L138 BoogieDeclarations]: Found implementation of procedure cstpcpy [2019-01-14 18:07:57,978 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:07:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 18:07:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 18:07:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:07:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:07:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:07:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:07:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:07:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:07:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:07:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:07:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:07:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:07:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:07:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:07:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:07:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:07:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:07:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:07:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:07:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:07:57,983 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:07:57,983 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:07:57,983 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:07:57,983 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:07:57,983 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:07:57,983 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:07:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:07:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:07:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:07:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:07:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:07:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:07:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:07:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:07:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:07:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:07:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:07:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:07:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:07:57,986 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:07:57,986 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:07:57,986 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:07:57,986 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:07:57,986 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:07:57,986 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:07:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:07:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:07:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:07:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:07:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:07:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:07:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:07:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:07:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:07:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:07:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:07:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:07:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:07:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:07:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:07:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:07:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:07:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:07:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:07:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:07:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:07:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:07:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:07:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:07:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:07:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:07:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:07:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:07:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:07:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:07:57,996 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:07:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:07:57,998 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:07:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:07:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:07:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:07:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:07:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:07:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:07:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:07:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:07:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:07:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:07:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:07:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:07:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:07:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:07:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:07:58,004 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:07:58,004 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:07:58,004 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:07:58,004 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:07:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:07:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:07:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:07:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:07:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:07:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:07:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure cstpcpy [2019-01-14 18:07:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 18:07:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 18:07:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:07:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:07:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:07:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:07:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:07:58,604 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:07:58,604 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-14 18:07:58,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:58 BoogieIcfgContainer [2019-01-14 18:07:58,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:07:58,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:07:58,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:07:58,609 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:07:58,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:07:57" (1/3) ... [2019-01-14 18:07:58,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fa0c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:07:58, skipping insertion in model container [2019-01-14 18:07:58,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:57" (2/3) ... [2019-01-14 18:07:58,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fa0c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:07:58, skipping insertion in model container [2019-01-14 18:07:58,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:58" (3/3) ... [2019-01-14 18:07:58,613 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:58,623 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:07:58,631 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-01-14 18:07:58,648 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-01-14 18:07:58,677 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:07:58,678 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:07:58,678 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:07:58,678 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:07:58,679 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:07:58,679 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:07:58,679 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:07:58,679 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:07:58,679 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:07:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-01-14 18:07:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:58,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:58,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:58,716 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:07:58,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:58,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1166122888, now seen corresponding path program 1 times [2019-01-14 18:07:58,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:58,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:58,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:58,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:58,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:58,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:58,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:07:58,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:58,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:58,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:58,914 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2019-01-14 18:07:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:59,055 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-01-14 18:07:59,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:59,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:07:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:59,066 INFO L225 Difference]: With dead ends: 35 [2019-01-14 18:07:59,066 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 18:07:59,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:07:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 18:07:59,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-01-14 18:07:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 18:07:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-14 18:07:59,109 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2019-01-14 18:07:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:59,109 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-14 18:07:59,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-14 18:07:59,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:59,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:59,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:59,111 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:07:59,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:59,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1166122862, now seen corresponding path program 1 times [2019-01-14 18:07:59,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:59,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:59,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:59,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:59,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:59,192 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-14 18:07:59,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:59,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:07:59,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:07:59,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:07:59,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:59,194 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2019-01-14 18:07:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:59,240 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-14 18:07:59,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:07:59,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:07:59,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:59,243 INFO L225 Difference]: With dead ends: 28 [2019-01-14 18:07:59,243 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 18:07:59,244 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-14 18:07:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 18:07:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 18:07:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 18:07:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-01-14 18:07:59,250 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2019-01-14 18:07:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:59,251 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-01-14 18:07:59,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:07:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-01-14 18:07:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:59,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:59,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:59,253 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:07:59,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:59,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1166122861, now seen corresponding path program 1 times [2019-01-14 18:07:59,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:59,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:59,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:59,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:59,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:59,339 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-14 18:07:59,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:59,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:59,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:59,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:59,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:59,341 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2019-01-14 18:07:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:59,416 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-01-14 18:07:59,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:59,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:07:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:59,418 INFO L225 Difference]: With dead ends: 29 [2019-01-14 18:07:59,418 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 18:07:59,419 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-14 18:07:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 18:07:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-01-14 18:07:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 18:07:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-01-14 18:07:59,423 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2019-01-14 18:07:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:59,424 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-01-14 18:07:59,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-01-14 18:07:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:59,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:59,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:59,425 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:07:59,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:59,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1166120966, now seen corresponding path program 1 times [2019-01-14 18:07:59,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:59,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:59,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:59,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:59,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:59,510 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-14 18:07:59,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:59,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:07:59,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:07:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:07:59,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:59,514 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2019-01-14 18:07:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:59,573 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-01-14 18:07:59,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:07:59,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:07:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:59,575 INFO L225 Difference]: With dead ends: 28 [2019-01-14 18:07:59,575 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 18:07:59,575 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-14 18:07:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 18:07:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-14 18:07:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 18:07:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-14 18:07:59,580 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2019-01-14 18:07:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:59,580 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-14 18:07:59,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:07:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-14 18:07:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 18:07:59,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:59,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:59,581 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:07:59,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:59,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2024299467, now seen corresponding path program 1 times [2019-01-14 18:07:59,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:59,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:59,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:59,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:59,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:59,717 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-14 18:07:59,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:59,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:07:59,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:07:59,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:07:59,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:07:59,719 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2019-01-14 18:07:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:59,800 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-01-14 18:07:59,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:07:59,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 18:07:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:59,802 INFO L225 Difference]: With dead ends: 25 [2019-01-14 18:07:59,802 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 18:07:59,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:07:59,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 18:07:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 18:07:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 18:07:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-01-14 18:07:59,807 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2019-01-14 18:07:59,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:59,807 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-14 18:07:59,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:07:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-01-14 18:07:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 18:07:59,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:59,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:59,809 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:07:59,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:59,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2024299468, now seen corresponding path program 1 times [2019-01-14 18:07:59,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:59,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:59,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:59,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:59,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:00,074 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-14 18:08:00,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:00,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:08:00,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:08:00,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:08:00,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:08:00,075 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2019-01-14 18:08:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:00,334 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-14 18:08:00,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:08:00,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-14 18:08:00,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:00,338 INFO L225 Difference]: With dead ends: 34 [2019-01-14 18:08:00,338 INFO L226 Difference]: Without dead ends: 34 [2019-01-14 18:08:00,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:08:00,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-14 18:08:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2019-01-14 18:08:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 18:08:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-14 18:08:00,343 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2019-01-14 18:08:00,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:00,344 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-14 18:08:00,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:08:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-14 18:08:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 18:08:00,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:00,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:00,345 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:00,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:00,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1671225958, now seen corresponding path program 1 times [2019-01-14 18:08:00,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:00,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:00,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:00,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:00,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:00,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:00,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:08:00,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:08:00,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:08:00,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:08:00,483 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2019-01-14 18:08:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:00,597 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-01-14 18:08:00,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:08:00,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-14 18:08:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:00,598 INFO L225 Difference]: With dead ends: 25 [2019-01-14 18:08:00,598 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 18:08:00,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-14 18:08:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 18:08:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 18:08:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 18:08:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-01-14 18:08:00,602 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2019-01-14 18:08:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:00,603 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-14 18:08:00,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:08:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-01-14 18:08:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 18:08:00,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:00,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:00,604 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:00,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1671225957, now seen corresponding path program 1 times [2019-01-14 18:08:00,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:00,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:00,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:00,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:00,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:00,705 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-14 18:08:00,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:00,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:08:00,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:08:00,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:08:00,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:08:00,707 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2019-01-14 18:08:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:00,870 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-14 18:08:00,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:08:00,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-14 18:08:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:00,871 INFO L225 Difference]: With dead ends: 31 [2019-01-14 18:08:00,871 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 18:08:00,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:08:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 18:08:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-01-14 18:08:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 18:08:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-14 18:08:00,876 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 14 [2019-01-14 18:08:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:00,876 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-14 18:08:00,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:08:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-14 18:08:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 18:08:00,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:00,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:00,878 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:00,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:00,879 INFO L82 PathProgramCache]: Analyzing trace with hash -231607577, now seen corresponding path program 1 times [2019-01-14 18:08:00,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:00,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:00,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:00,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:00,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:01,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:01,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:08:01,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:08:01,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:08:01,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:08:01,082 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2019-01-14 18:08:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:01,200 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-14 18:08:01,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:08:01,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-14 18:08:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:01,202 INFO L225 Difference]: With dead ends: 39 [2019-01-14 18:08:01,202 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 18:08:01,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:08:01,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 18:08:01,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-14 18:08:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 18:08:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-01-14 18:08:01,207 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 17 [2019-01-14 18:08:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:01,207 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-01-14 18:08:01,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:08:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-01-14 18:08:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 18:08:01,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:01,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:01,209 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:01,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:01,209 INFO L82 PathProgramCache]: Analyzing trace with hash -624634587, now seen corresponding path program 1 times [2019-01-14 18:08:01,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:01,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:01,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:01,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:01,564 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-14 18:08:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:01,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:01,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 18:08:01,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:08:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:08:01,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:08:01,611 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2019-01-14 18:08:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:01,763 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-14 18:08:01,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:08:01,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-14 18:08:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:01,766 INFO L225 Difference]: With dead ends: 60 [2019-01-14 18:08:01,766 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 18:08:01,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-14 18:08:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 18:08:01,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2019-01-14 18:08:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 18:08:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-01-14 18:08:01,772 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 17 [2019-01-14 18:08:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:01,772 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-01-14 18:08:01,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:08:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-01-14 18:08:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 18:08:01,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:01,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:01,774 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:01,774 INFO L82 PathProgramCache]: Analyzing trace with hash 76429991, now seen corresponding path program 1 times [2019-01-14 18:08:01,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:01,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:01,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:01,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:01,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:02,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:02,174 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-14 18:08:02,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:02,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:02,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-14 18:08:02,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 18:08:02,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:02,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:02,333 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-14 18:08:02,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-14 18:08:02,575 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 18 treesize of output 14 [2019-01-14 18:08:02,593 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 14 treesize of output 11 [2019-01-14 18:08:02,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:02,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:02,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:02,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2019-01-14 18:08:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:02,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:02,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-01-14 18:08:02,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 18:08:02,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 18:08:02,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-01-14 18:08:02,790 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 15 states. [2019-01-14 18:08:03,026 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-01-14 18:08:03,304 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-01-14 18:08:03,466 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-01-14 18:08:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:03,808 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2019-01-14 18:08:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 18:08:03,809 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-01-14 18:08:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:03,810 INFO L225 Difference]: With dead ends: 50 [2019-01-14 18:08:03,810 INFO L226 Difference]: Without dead ends: 50 [2019-01-14 18:08:03,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-01-14 18:08:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-14 18:08:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2019-01-14 18:08:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 18:08:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-14 18:08:03,815 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 17 [2019-01-14 18:08:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:03,816 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-14 18:08:03,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 18:08:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-14 18:08:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:08:03,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:03,817 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:03,817 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:03,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:03,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1925637600, now seen corresponding path program 1 times [2019-01-14 18:08:03,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:03,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:03,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:03,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:03,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:03,944 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-14 18:08:03,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:03,944 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-14 18:08:03,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:03,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:04,019 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-14 18:08:04,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:04,034 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-14 18:08:04,039 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-14 18:08:04,040 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:04,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:04,069 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-14 18:08:04,070 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:15 [2019-01-14 18:08:04,281 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-14 18:08:04,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:04,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-01-14 18:08:04,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 18:08:04,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 18:08:04,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-01-14 18:08:04,311 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 15 states. [2019-01-14 18:08:05,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:05,006 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2019-01-14 18:08:05,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:08:05,007 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-01-14 18:08:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:05,008 INFO L225 Difference]: With dead ends: 48 [2019-01-14 18:08:05,009 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 18:08:05,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-01-14 18:08:05,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 18:08:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2019-01-14 18:08:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 18:08:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-14 18:08:05,014 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-01-14 18:08:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:05,014 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-14 18:08:05,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 18:08:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-14 18:08:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 18:08:05,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:05,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:05,015 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash 2138055530, now seen corresponding path program 1 times [2019-01-14 18:08:05,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:05,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:05,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:05,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:05,236 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-14 18:08:05,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:05,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:08:05,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:08:05,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:08:05,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:05,238 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2019-01-14 18:08:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:05,339 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-01-14 18:08:05,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:08:05,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-14 18:08:05,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:05,342 INFO L225 Difference]: With dead ends: 38 [2019-01-14 18:08:05,342 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 18:08:05,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 18:08:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-14 18:08:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 18:08:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-14 18:08:05,345 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-14 18:08:05,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:05,346 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-14 18:08:05,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:08:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-14 18:08:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 18:08:05,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:05,349 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:05,349 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpcpyErr0REQUIRES_VIOLATION, cstpcpyErr1REQUIRES_VIOLATION, cstpcpyErr2REQUIRES_VIOLATION, cstpcpyErr3REQUIRES_VIOLATION]=== [2019-01-14 18:08:05,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:05,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1208413250, now seen corresponding path program 2 times [2019-01-14 18:08:05,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:05,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:05,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:05,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:06,162 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2019-01-14 18:08:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:06,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:06,177 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-14 18:08:06,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:08:06,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:08:06,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:08:06,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:06,256 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-14 18:08:06,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:06,266 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-14 18:08:06,283 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-14 18:08:06,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:06,287 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:06,340 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-14 18:08:06,341 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2019-01-14 18:08:06,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:08:06,411 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-14 18:08:06,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:06,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:06,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:06,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-01-14 18:08:06,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2019-01-14 18:08:06,670 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-14 18:08:06,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:06,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:06,693 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-14 18:08:06,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2019-01-14 18:08:06,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-14 18:08:06,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:08:06,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:06,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:06,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:06,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2019-01-14 18:08:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:06,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:06,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-01-14 18:08:06,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:08:06,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:08:06,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:08:06,994 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 17 states. [2019-01-14 18:08:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:07,831 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-14 18:08:07,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 18:08:07,833 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-01-14 18:08:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:07,833 INFO L225 Difference]: With dead ends: 24 [2019-01-14 18:08:07,834 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 18:08:07,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2019-01-14 18:08:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 18:08:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 18:08:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 18:08:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 18:08:07,835 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-01-14 18:08:07,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:07,835 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 18:08:07,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:08:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 18:08:07,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 18:08:07,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:08:07 BoogieIcfgContainer [2019-01-14 18:08:07,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:08:07,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:08:07,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:08:07,841 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:08:07,841 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:58" (3/4) ... [2019-01-14 18:08:07,845 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 18:08:07,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 18:08:07,851 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 18:08:07,852 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 18:08:07,852 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 18:08:07,852 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstpcpy [2019-01-14 18:08:07,856 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-14 18:08:07,856 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-14 18:08:07,856 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 18:08:07,916 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 18:08:07,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:08:07,920 INFO L168 Benchmark]: Toolchain (without parser) took 10760.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 952.7 MB in the beginning and 853.6 MB in the end (delta: 99.1 MB). Peak memory consumption was 310.4 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:07,921 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-14 18:08:07,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:07,925 INFO L168 Benchmark]: Boogie Preprocessor took 58.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:08:07,925 INFO L168 Benchmark]: RCFGBuilder took 688.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:07,925 INFO L168 Benchmark]: TraceAbstraction took 9234.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 861.0 MB in the end (delta: 219.9 MB). Peak memory consumption was 285.5 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:07,926 INFO L168 Benchmark]: Witness Printer took 78.20 ms. Allocated memory is still 1.2 GB. Free memory was 861.0 MB in the beginning and 853.6 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:07,933 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 695.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 688.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9234.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 861.0 MB in the end (delta: 219.9 MB). Peak memory consumption was 285.5 MB. Max. memory is 11.5 GB. * Witness Printer took 78.20 ms. Allocated memory is still 1.2 GB. Free memory was 861.0 MB in the beginning and 853.6 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 7 error locations. SAFE Result, 9.1s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 287 SDtfs, 316 SDslu, 876 SDs, 0 SdLazy, 725 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 243 ConstructedInterpolants, 10 QuantifiedInterpolants, 26690 SizeOfPredicates, 28 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 2/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...