./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrcspn-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/cstrcspn-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 022e5e55adeb2213dd3e7a54e30f105429bff667 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:55:58,292 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:55:58,294 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:55:58,306 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:55:58,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:55:58,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:55:58,310 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:55:58,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:55:58,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:55:58,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:55:58,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:55:58,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:55:58,318 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:55:58,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:55:58,320 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:55:58,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:55:58,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:55:58,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:55:58,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:55:58,328 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:55:58,329 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:55:58,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:55:58,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:55:58,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:55:58,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:55:58,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:55:58,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:55:58,338 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:55:58,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:55:58,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:55:58,341 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:55:58,341 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:55:58,342 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:55:58,342 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:55:58,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:55:58,345 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:55:58,345 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:55:58,376 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:55:58,376 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:55:58,380 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:55:58,383 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:55:58,384 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:55:58,384 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:55:58,384 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:55:58,385 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:55:58,385 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:55:58,385 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:55:58,385 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:55:58,385 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:55:58,386 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:55:58,386 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:55:58,386 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:55:58,386 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:55:58,386 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:55:58,386 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:55:58,388 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:55:58,389 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:55:58,389 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:55:58,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:55:58,389 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:55:58,389 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:55:58,389 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:55:58,390 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:55:58,392 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 -> 022e5e55adeb2213dd3e7a54e30f105429bff667 [2019-01-13 21:55:58,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:55:58,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:55:58,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:55:58,462 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:55:58,463 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:55:58,464 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:55:58,533 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf684393/e48e10d70d364237a2aa854e2266bd88/FLAGcb8830001 [2019-01-13 21:55:59,029 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:55:59,030 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:55:59,055 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf684393/e48e10d70d364237a2aa854e2266bd88/FLAGcb8830001 [2019-01-13 21:55:59,303 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf684393/e48e10d70d364237a2aa854e2266bd88 [2019-01-13 21:55:59,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:55:59,308 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:55:59,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:55:59,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:55:59,312 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:55:59,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:55:59" (1/1) ... [2019-01-13 21:55:59,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533ce5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:59, skipping insertion in model container [2019-01-13 21:55:59,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:55:59" (1/1) ... [2019-01-13 21:55:59,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:55:59,373 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:55:59,718 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:55:59,729 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:55:59,863 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:55:59,912 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:55:59,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:59 WrapperNode [2019-01-13 21:55:59,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:55:59,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:55:59,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:55:59,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:55:59,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:59" (1/1) ... [2019-01-13 21:55:59,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:59" (1/1) ... [2019-01-13 21:55:59,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:59" (1/1) ... [2019-01-13 21:55:59,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:59" (1/1) ... [2019-01-13 21:55:59,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:59" (1/1) ... [2019-01-13 21:55:59,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:59" (1/1) ... [2019-01-13 21:55:59,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:59" (1/1) ... [2019-01-13 21:56:00,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:56:00,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:56:00,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:56:00,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:56:00,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:00,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:56:00,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:56:00,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:56:00,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:56:00,065 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2019-01-13 21:56:00,065 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:56:00,065 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:56:00,065 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:56:00,066 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:56:00,066 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:56:00,066 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:56:00,066 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:56:00,066 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:56:00,066 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:56:00,067 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:56:00,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:56:00,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:56:00,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:56:00,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:56:00,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:56:00,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:56:00,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:56:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:56:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:56:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:56:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:56:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:56:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:56:00,070 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:56:00,071 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:56:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:56:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:56:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:56:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:56:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:56:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:56:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:56:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:56:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:56:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:56:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:56:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:56:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:56:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:56:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:56:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:56:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:56:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:56:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:56:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:56:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:56:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:56:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:56:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:56:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:56:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:56:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:56:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:56:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:56:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:56:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:56:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:56:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:56:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:56:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:56:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:56:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:56:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:56:00,080 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:56:00,081 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:56:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:56:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:56:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:56:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:56:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:56:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:56:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:56:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:56:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:56:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:56:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:56:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:56:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:56:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:56:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:56:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:56:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:56:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:56:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:56:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:56:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:56:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:56:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:56:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:56:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:56:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:56:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:56:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:56:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:56:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:56:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:56:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:56:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:56:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:56:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:56:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:56:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:56:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:56:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:56:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2019-01-13 21:56:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:56:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:56:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:56:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:56:00,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:56:00,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:56:00,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:56:00,815 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:56:00,816 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 21:56:00,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:00 BoogieIcfgContainer [2019-01-13 21:56:00,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:56:00,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:56:00,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:56:00,822 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:56:00,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:55:59" (1/3) ... [2019-01-13 21:56:00,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec64856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:00, skipping insertion in model container [2019-01-13 21:56:00,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:55:59" (2/3) ... [2019-01-13 21:56:00,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec64856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:00, skipping insertion in model container [2019-01-13 21:56:00,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:00" (3/3) ... [2019-01-13 21:56:00,826 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:00,837 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:56:00,846 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-13 21:56:00,863 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-13 21:56:00,888 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:56:00,888 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:56:00,888 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:56:00,889 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:56:00,889 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:56:00,889 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:56:00,889 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:56:00,889 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:56:00,890 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:56:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-01-13 21:56:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:00,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:00,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:00,921 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:00,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:00,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097680, now seen corresponding path program 1 times [2019-01-13 21:56:00,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:00,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:00,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:00,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:00,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:01,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:01,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:01,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:01,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:01,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:01,141 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-01-13 21:56:01,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:01,241 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2019-01-13 21:56:01,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:01,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:56:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:01,251 INFO L225 Difference]: With dead ends: 48 [2019-01-13 21:56:01,252 INFO L226 Difference]: Without dead ends: 45 [2019-01-13 21:56:01,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-13 21:56:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-13 21:56:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 21:56:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-01-13 21:56:01,291 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2019-01-13 21:56:01,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:01,292 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-01-13 21:56:01,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-01-13 21:56:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:01,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:01,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:01,293 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:01,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097681, now seen corresponding path program 1 times [2019-01-13 21:56:01,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:01,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:01,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:01,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:01,622 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-13 21:56:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:01,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:01,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:01,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:01,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:01,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:01,627 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2019-01-13 21:56:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:01,723 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-01-13 21:56:01,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:01,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:56:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:01,726 INFO L225 Difference]: With dead ends: 44 [2019-01-13 21:56:01,726 INFO L226 Difference]: Without dead ends: 44 [2019-01-13 21:56:01,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-13 21:56:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-13 21:56:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:56:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-01-13 21:56:01,735 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2019-01-13 21:56:01,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:01,735 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-01-13 21:56:01,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-01-13 21:56:01,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:01,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:01,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:01,736 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:01,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:01,739 INFO L82 PathProgramCache]: Analyzing trace with hash 774453223, now seen corresponding path program 1 times [2019-01-13 21:56:01,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:01,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:01,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:01,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:01,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:01,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:01,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:01,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:01,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:01,827 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2019-01-13 21:56:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:01,918 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-01-13 21:56:01,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:01,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 21:56:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:01,920 INFO L225 Difference]: With dead ends: 43 [2019-01-13 21:56:01,920 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:56:01,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:01,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:56:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 21:56:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:56:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-13 21:56:01,926 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2019-01-13 21:56:01,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:01,926 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-13 21:56:01,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-01-13 21:56:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:01,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:01,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:01,929 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:01,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash 774453224, now seen corresponding path program 1 times [2019-01-13 21:56:01,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:01,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:01,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:01,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:02,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:02,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:02,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:02,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:02,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:02,040 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2019-01-13 21:56:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:02,065 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-01-13 21:56:02,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:02,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 21:56:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:02,067 INFO L225 Difference]: With dead ends: 42 [2019-01-13 21:56:02,067 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:56:02,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:56:02,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-13 21:56:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 21:56:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-01-13 21:56:02,073 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2019-01-13 21:56:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:02,073 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-01-13 21:56:02,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-01-13 21:56:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:56:02,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:02,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:02,074 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:02,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:02,075 INFO L82 PathProgramCache]: Analyzing trace with hash -828291080, now seen corresponding path program 1 times [2019-01-13 21:56:02,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:02,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:02,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:02,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:02,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:02,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:02,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:02,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:02,161 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2019-01-13 21:56:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:02,564 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-01-13 21:56:02,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:02,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-13 21:56:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:02,566 INFO L225 Difference]: With dead ends: 40 [2019-01-13 21:56:02,566 INFO L226 Difference]: Without dead ends: 40 [2019-01-13 21:56:02,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-13 21:56:02,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-13 21:56:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:56:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-13 21:56:02,572 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2019-01-13 21:56:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:02,572 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-13 21:56:02,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-01-13 21:56:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:56:02,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:02,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:02,573 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:02,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:02,575 INFO L82 PathProgramCache]: Analyzing trace with hash -828291079, now seen corresponding path program 1 times [2019-01-13 21:56:02,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:02,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:02,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:02,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:02,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:02,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:02,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:02,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:02,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:02,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:02,747 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2019-01-13 21:56:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:02,973 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-01-13 21:56:02,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:02,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-13 21:56:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:02,979 INFO L225 Difference]: With dead ends: 62 [2019-01-13 21:56:02,979 INFO L226 Difference]: Without dead ends: 62 [2019-01-13 21:56:02,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-13 21:56:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2019-01-13 21:56:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:56:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-01-13 21:56:02,991 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2019-01-13 21:56:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:02,991 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-01-13 21:56:02,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-01-13 21:56:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:02,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:02,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:02,993 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1940862338, now seen corresponding path program 1 times [2019-01-13 21:56:02,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:02,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:02,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:02,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:03,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:03,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:03,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:03,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:03,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:03,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:03,107 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2019-01-13 21:56:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:03,238 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-01-13 21:56:03,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:03,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-13 21:56:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:03,240 INFO L225 Difference]: With dead ends: 43 [2019-01-13 21:56:03,241 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:56:03,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:56:03,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-01-13 21:56:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:56:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-01-13 21:56:03,247 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2019-01-13 21:56:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:03,247 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-13 21:56:03,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-01-13 21:56:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:03,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:03,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:03,249 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:03,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:03,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1940862337, now seen corresponding path program 1 times [2019-01-13 21:56:03,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:03,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:03,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:03,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:03,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:03,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:03,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:56:03,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:03,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:03,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:03,543 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2019-01-13 21:56:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:03,735 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2019-01-13 21:56:03,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:03,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-13 21:56:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:03,737 INFO L225 Difference]: With dead ends: 55 [2019-01-13 21:56:03,738 INFO L226 Difference]: Without dead ends: 55 [2019-01-13 21:56:03,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-13 21:56:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2019-01-13 21:56:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-13 21:56:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-01-13 21:56:03,743 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2019-01-13 21:56:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:03,744 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-01-13 21:56:03,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-01-13 21:56:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:03,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:03,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:03,745 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:03,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1170138931, now seen corresponding path program 1 times [2019-01-13 21:56:03,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:03,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:03,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:03,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:03,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:03,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:03,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:03,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:03,855 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2019-01-13 21:56:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:03,949 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-01-13 21:56:03,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:03,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-13 21:56:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:03,952 INFO L225 Difference]: With dead ends: 46 [2019-01-13 21:56:03,952 INFO L226 Difference]: Without dead ends: 41 [2019-01-13 21:56:03,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-13 21:56:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-13 21:56:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 21:56:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-13 21:56:03,960 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2019-01-13 21:56:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:03,960 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-13 21:56:03,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-13 21:56:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 21:56:03,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:03,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:03,961 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:03,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:03,965 INFO L82 PathProgramCache]: Analyzing trace with hash 164977750, now seen corresponding path program 1 times [2019-01-13 21:56:03,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:03,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:03,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:03,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:03,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:04,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:04,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:04,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:04,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:04,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:04,013 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2019-01-13 21:56:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:04,026 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-01-13 21:56:04,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:04,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-13 21:56:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:04,030 INFO L225 Difference]: With dead ends: 43 [2019-01-13 21:56:04,030 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:56:04,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:56:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 21:56:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:56:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-01-13 21:56:04,033 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2019-01-13 21:56:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:04,035 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-01-13 21:56:04,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-01-13 21:56:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:56:04,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:04,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:04,036 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:04,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:04,037 INFO L82 PathProgramCache]: Analyzing trace with hash -376031245, now seen corresponding path program 1 times [2019-01-13 21:56:04,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:04,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:04,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:04,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:04,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:04,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:04,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 21:56:04,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 21:56:04,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 21:56:04,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:04,322 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 10 states. [2019-01-13 21:56:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:04,769 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-01-13 21:56:04,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:56:04,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-01-13 21:56:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:04,770 INFO L225 Difference]: With dead ends: 64 [2019-01-13 21:56:04,770 INFO L226 Difference]: Without dead ends: 64 [2019-01-13 21:56:04,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-13 21:56:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-13 21:56:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-01-13 21:56:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-13 21:56:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-01-13 21:56:04,776 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 24 [2019-01-13 21:56:04,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:04,777 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-01-13 21:56:04,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 21:56:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-01-13 21:56:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:56:04,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:04,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:04,778 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:04,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:04,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1964379147, now seen corresponding path program 1 times [2019-01-13 21:56:04,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:04,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:04,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:04,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:04,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:05,207 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-13 21:56:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:05,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:05,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:05,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:05,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:05,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:56:05,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:05,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:05,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-13 21:56:05,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 21:56:05,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 21:56:05,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:05,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:05,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:06,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-13 21:56:06,081 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 22 treesize of output 23 [2019-01-13 21:56:06,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-13 21:56:06,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:06,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:06,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:06,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2019-01-13 21:56:06,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-01-13 21:56:06,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-13 21:56:06,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:06,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2019-01-13 21:56:06,382 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:06,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:06,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:06,391 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2019-01-13 21:56:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 21:56:06,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 21:56:06,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2019-01-13 21:56:06,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-13 21:56:06,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-13 21:56:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-01-13 21:56:06,469 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 19 states. [2019-01-13 21:56:06,713 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-13 21:56:08,918 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-13 21:56:11,901 WARN L181 SmtUtils]: Spent 2.93 s on a formula simplification that was a NOOP. DAG size: 49 [2019-01-13 21:56:14,186 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 51 [2019-01-13 21:56:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:14,896 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-01-13 21:56:14,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 21:56:14,897 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-01-13 21:56:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:14,900 INFO L225 Difference]: With dead ends: 101 [2019-01-13 21:56:14,900 INFO L226 Difference]: Without dead ends: 86 [2019-01-13 21:56:14,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2019-01-13 21:56:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-13 21:56:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2019-01-13 21:56:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-13 21:56:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-01-13 21:56:14,907 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2019-01-13 21:56:14,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:14,908 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-01-13 21:56:14,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-13 21:56:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-01-13 21:56:14,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-13 21:56:14,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:14,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:14,909 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:14,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:14,910 INFO L82 PathProgramCache]: Analyzing trace with hash -280555850, now seen corresponding path program 1 times [2019-01-13 21:56:14,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:14,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:14,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:14,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:14,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:15,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:15,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:15,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:15,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:15,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:56:15,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-13 21:56:15,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-13 21:56:15,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-13 21:56:15,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:15,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-13 21:56:15,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-13 21:56:15,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-13 21:56:15,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:15,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-13 21:56:15,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2019-01-13 21:56:15,558 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-13 21:56:15,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:15,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2019-01-13 21:56:15,594 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:15,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:15,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:15,649 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2019-01-13 21:56:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:15,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:15,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-01-13 21:56:15,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 21:56:15,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 21:56:15,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-01-13 21:56:15,755 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 17 states. [2019-01-13 21:56:16,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:16,701 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2019-01-13 21:56:16,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:56:16,703 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-01-13 21:56:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:16,705 INFO L225 Difference]: With dead ends: 146 [2019-01-13 21:56:16,705 INFO L226 Difference]: Without dead ends: 146 [2019-01-13 21:56:16,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2019-01-13 21:56:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-13 21:56:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 107. [2019-01-13 21:56:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-13 21:56:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2019-01-13 21:56:16,724 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 25 [2019-01-13 21:56:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:16,724 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2019-01-13 21:56:16,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 21:56:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2019-01-13 21:56:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 21:56:16,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:16,729 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:16,729 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:16,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash 185536167, now seen corresponding path program 1 times [2019-01-13 21:56:16,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:16,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:16,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:16,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:17,069 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-01-13 21:56:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:17,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:17,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:17,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:17,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:17,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:56:17,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:56:17,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:17,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:17,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-13 21:56:17,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:56:17,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 21:56:17,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-13 21:56:17,747 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 19 treesize of output 15 [2019-01-13 21:56:17,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:56:17,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:17,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:17,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:17,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2019-01-13 21:56:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:18,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:18,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-01-13 21:56:18,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 21:56:18,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 21:56:18,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-01-13 21:56:18,086 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 22 states. [2019-01-13 21:56:18,796 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-01-13 21:56:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:20,533 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2019-01-13 21:56:20,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 21:56:20,534 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-01-13 21:56:20,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:20,536 INFO L225 Difference]: With dead ends: 148 [2019-01-13 21:56:20,536 INFO L226 Difference]: Without dead ends: 148 [2019-01-13 21:56:20,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2019-01-13 21:56:20,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-13 21:56:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 76. [2019-01-13 21:56:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-13 21:56:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2019-01-13 21:56:20,545 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 30 [2019-01-13 21:56:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:20,546 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2019-01-13 21:56:20,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 21:56:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2019-01-13 21:56:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 21:56:20,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:20,549 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:20,549 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 21:56:20,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:20,549 INFO L82 PathProgramCache]: Analyzing trace with hash -566502313, now seen corresponding path program 2 times [2019-01-13 21:56:20,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:20,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:20,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:20,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:20,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:21,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:21,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:21,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:56:21,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:56:21,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:56:21,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:21,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:56:21,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:56:21,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:56:21,215 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,224 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:56:21,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:56:21,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:56:21,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2019-01-13 21:56:21,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-13 21:56:21,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:56:21,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:21,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-01-13 21:56:21,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2019-01-13 21:56:21,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:56:21,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:21,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2019-01-13 21:56:21,533 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:21,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:21,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:21,548 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2019-01-13 21:56:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:21,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:21,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-01-13 21:56:21,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-13 21:56:21,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-13 21:56:21,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-01-13 21:56:21,710 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 19 states. [2019-01-13 21:56:24,127 WARN L181 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-01-13 21:56:26,344 WARN L181 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-13 21:56:28,505 WARN L181 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-01-13 21:56:28,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:28,905 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-01-13 21:56:28,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 21:56:28,907 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-13 21:56:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:28,908 INFO L225 Difference]: With dead ends: 93 [2019-01-13 21:56:28,908 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:56:28,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2019-01-13 21:56:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:56:28,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:56:28,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:56:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:56:28,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-01-13 21:56:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:28,912 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:56:28,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-13 21:56:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:56:28,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:56:28,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:56:28 BoogieIcfgContainer [2019-01-13 21:56:28,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:56:28,918 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:56:28,918 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:56:28,918 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:56:28,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:00" (3/4) ... [2019-01-13 21:56:28,922 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:56:28,928 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:56:28,928 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2019-01-13 21:56:28,928 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:56:28,928 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:56:28,928 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:56:28,933 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-13 21:56:28,934 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-13 21:56:28,934 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 21:56:28,993 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:56:28,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:56:28,994 INFO L168 Benchmark]: Toolchain (without parser) took 29687.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -317.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:28,997 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:28,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 604.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:28,998 INFO L168 Benchmark]: Boogie Preprocessor took 91.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:28,998 INFO L168 Benchmark]: RCFGBuilder took 811.67 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-13 21:56:28,999 INFO L168 Benchmark]: TraceAbstraction took 28099.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:28,999 INFO L168 Benchmark]: Witness Printer took 75.14 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:29,006 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.76 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 604.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.66 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 811.67 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 28099.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 75.14 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 15 error locations. SAFE Result, 28.0s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 20.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 501 SDtfs, 1181 SDslu, 1696 SDs, 0 SdLazy, 1860 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 98 SyntacticMatches, 6 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 161 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 21 QuantifiedInterpolants, 95100 SizeOfPredicates, 47 NumberOfNonLiveVariables, 589 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 5/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...